Linear-Time Haplotype Inference on Pedigrees Without Recombinations

M. Y. Chan; Wun Tat Chan; Francis Y.L. Chin; Stanley P.Y. Fung; Ming Yang Kao

doi:10.1007/11851561_6

Linear-Time Haplotype Inference on Pedigrees Without Recombinations

M. Y. Chan^*
, Wun Tat Chan
, Francis Y.L. Chin
, Stanley P.Y. Fung
, Ming Yang Kao

^*Corresponding author for this work

School of Continuing Education

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

18 Citations (Scopus)

Abstract

In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no mating loops. The approach is based on the use of graphs to capture SNP, Mendelian and parity constraints of the given pedigree.

Original language	English
Title of host publication	Algorithms in Bioinformatics
Subtitle of host publication	6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings
Editors	Philipp Bücher, Bernard M. E. Moret
Place of Publication	Heidelberg
Publisher	Springer Berlin Heidelberg
Pages	56-67
Number of pages	12
Edition	1st
ISBN (Electronic)	9783540395843
ISBN (Print)	3540395830, 9783540395836
DOIs	https://doi.org/10.1007/11851561_6
Publication status	Published - 30 Aug 2006
Event	6th International Workshop on Algorithms in Bioinformatics, WABI 2006 - Zurich, Switzerland Duration: 11 Sept 2006 → 13 Sept 2006

Publication series

Name	Lecture Notes in Computer Science
Volume	4175
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Name	Lecture Notes in Bioinformatics
ISSN (Print)	2366-6323
ISSN (Electronic)	2366-6331

Name	WABI: International Workshop on Algorithms in Bioinformatics

Conference

Conference	6th International Workshop on Algorithms in Bioinformatics, WABI 2006
Country/Territory	Switzerland
City	Zurich
Period	11/09/06 → 13/09/06

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

User-Defined Keywords

Family Problem
Pedigree Data
Heterozygous Locus
Haplotype Inference
Haplotype Pair

Access to Document

10.1007/11851561_6

Cite this

Chan, M. Y., Chan, W. T., Chin, F. Y. L., Fung, S. P. Y., & Kao, M. Y. (2006). Linear-Time Haplotype Inference on Pedigrees Without Recombinations. In P. Bücher, & B. M. E. Moret (Eds.), Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings (1st ed., pp. 56-67). (Lecture Notes in Computer Science; Vol. 4175), (Lecture Notes in Bioinformatics), (WABI: International Workshop on Algorithms in Bioinformatics). Springer Berlin Heidelberg. https://doi.org/10.1007/11851561_6

Chan, M. Y. ; Chan, Wun Tat ; Chin, Francis Y.L. et al. / Linear-Time Haplotype Inference on Pedigrees Without Recombinations. Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings. editor / Philipp Bücher ; Bernard M. E. Moret. 1st. ed. Heidelberg : Springer Berlin Heidelberg, 2006. pp. 56-67 (Lecture Notes in Computer Science). (Lecture Notes in Bioinformatics). (WABI: International Workshop on Algorithms in Bioinformatics).

@inproceedings{b3739b7931ea405ca4583fb939fc27a1,

title = "Linear-Time Haplotype Inference on Pedigrees Without Recombinations",

abstract = "In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no mating loops. The approach is based on the use of graphs to capture SNP, Mendelian and parity constraints of the given pedigree.",

keywords = "Family Problem, Pedigree Data, Heterozygous Locus, Haplotype Inference, Haplotype Pair",

author = "Chan, \{M. Y.\} and Chan, \{Wun Tat\} and Chin, \{Francis Y.L.\} and Fung, \{Stanley P.Y.\} and Kao, \{Ming Yang\}",

note = "This research was supported by Hong Kong RGC Grant HKU-7119/05E and HKU Strategic Research Team Fund. Publisher copyright: {\textcopyright} 2006 Springer-Verlag Berlin Heidelberg; 6th International Workshop on Algorithms in Bioinformatics, WABI 2006 ; Conference date: 11-09-2006 Through 13-09-2006",

year = "2006",

month = aug,

day = "30",

doi = "10.1007/11851561\_6",

language = "English",

isbn = "3540395830",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "56--67",

editor = "Philipp B{\"u}cher and Moret, \{Bernard M. E.\}",

booktitle = "Algorithms in Bioinformatics",

edition = "1st",

}

Chan, MY, Chan, WT, Chin, FYL, Fung, SPY & Kao, MY 2006, Linear-Time Haplotype Inference on Pedigrees Without Recombinations. in P Bücher & BME Moret (eds), Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings. 1st edn, Lecture Notes in Computer Science, vol. 4175, Lecture Notes in Bioinformatics, WABI: International Workshop on Algorithms in Bioinformatics, Springer Berlin Heidelberg, Heidelberg, pp. 56-67, 6th International Workshop on Algorithms in Bioinformatics, WABI 2006, Zurich, Switzerland, 11/09/06. https://doi.org/10.1007/11851561_6

Linear-Time Haplotype Inference on Pedigrees Without Recombinations. / Chan, M. Y.; Chan, Wun Tat; Chin, Francis Y.L. et al.
Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings. ed. / Philipp Bücher; Bernard M. E. Moret. 1st. ed. Heidelberg: Springer Berlin Heidelberg, 2006. p. 56-67 (Lecture Notes in Computer Science; Vol. 4175), (Lecture Notes in Bioinformatics), (WABI: International Workshop on Algorithms in Bioinformatics).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Linear-Time Haplotype Inference on Pedigrees Without Recombinations

AU - Chan, M. Y.

AU - Chan, Wun Tat

AU - Chin, Francis Y.L.

AU - Fung, Stanley P.Y.

AU - Kao, Ming Yang

PY - 2006/8/30

Y1 - 2006/8/30

N2 - In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no mating loops. The approach is based on the use of graphs to capture SNP, Mendelian and parity constraints of the given pedigree.

AB - In this paper, a linear-time algorithm, which is optimal, is presented to solve the haplotype inference problem for pedigree data when there are no recombinations and the pedigree has no mating loops. The approach is based on the use of graphs to capture SNP, Mendelian and parity constraints of the given pedigree.

KW - Family Problem

KW - Pedigree Data

KW - Heterozygous Locus

KW - Haplotype Inference

KW - Haplotype Pair

UR - https://www.scopus.com/pages/publications/33750231432

U2 - 10.1007/11851561_6

DO - 10.1007/11851561_6

M3 - Conference proceeding

AN - SCOPUS:33750231432

SN - 3540395830

SN - 9783540395836

T3 - Lecture Notes in Computer Science

SP - 56

EP - 67

BT - Algorithms in Bioinformatics

A2 - Bücher, Philipp

A2 - Moret, Bernard M. E.

PB - Springer Berlin Heidelberg

CY - Heidelberg

T2 - 6th International Workshop on Algorithms in Bioinformatics, WABI 2006

Y2 - 11 September 2006 through 13 September 2006

ER -

Chan MY, Chan WT, Chin FYL, Fung SPY, Kao MY. Linear-Time Haplotype Inference on Pedigrees Without Recombinations. In Bücher P, Moret BME, editors, Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings. 1st ed. Heidelberg: Springer Berlin Heidelberg. 2006. p. 56-67. (Lecture Notes in Computer Science). (Lecture Notes in Bioinformatics). (WABI: International Workshop on Algorithms in Bioinformatics). doi: 10.1007/11851561_6

Linear-Time Haplotype Inference on Pedigrees Without Recombinations

Abstract

Publication series

Conference

UN SDGs

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this