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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationAlgorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings
PublisherSpringer Verlag
Pages56-67
Number of pages12
ISBN (Print)3540395830, 9783540395836
StatePublished - Jan 1 2006
Event6th International Workshop on Algorithms in Bioinformatics, WABI 2006 - Zurich, Switzerland
Duration: Sep 11 2006Sep 13 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4175 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Workshop on Algorithms in Bioinformatics, WABI 2006
CountrySwitzerland
CityZurich
Period9/11/069/13/06

Fingerprint

Pedigree
Haplotype
Recombination
Linear Time
Linear-time Algorithm
Parity
Graph in graph theory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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 Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings (pp. 56-67). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4175 LNBI). Springer Verlag.
Chan, M. Y. ; Chan, Wun Tat ; Chin, Francis Y.L. ; Fung, Stanley P.Y. ; Kao, Ming-Yang. / Linear-time haplotype inference on pedigrees without recombinations. Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings. Springer Verlag, 2006. pp. 56-67 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{1ae15f2d83764f44971d789cd3217954,
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.",
author = "Chan, {M. Y.} and Chan, {Wun Tat} and Chin, {Francis Y.L.} and Fung, {Stanley P.Y.} and Ming-Yang Kao",
year = "2006",
month = "1",
day = "1",
language = "English (US)",
isbn = "3540395830",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "56--67",
booktitle = "Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings",
address = "Germany",

}

Chan, MY, Chan, WT, Chin, FYL, Fung, SPY & Kao, M-Y 2006, Linear-time haplotype inference on pedigrees without recombinations. in Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4175 LNBI, Springer Verlag, pp. 56-67, 6th International Workshop on Algorithms in Bioinformatics, WABI 2006, Zurich, Switzerland, 9/11/06.

Linear-time haplotype inference on pedigrees without recombinations. / Chan, M. Y.; Chan, Wun Tat; Chin, Francis Y.L.; Fung, Stanley P.Y.; Kao, Ming-Yang.

Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings. Springer Verlag, 2006. p. 56-67 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4175 LNBI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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/1/1

Y1 - 2006/1/1

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.

UR - http://www.scopus.com/inward/record.url?scp=33750231432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750231432&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750231432

SN - 3540395830

SN - 9783540395836

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 56

EP - 67

BT - Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings

PB - Springer Verlag

ER -

Chan MY, Chan WT, Chin FYL, Fung SPY, Kao M-Y. Linear-time haplotype inference on pedigrees without recombinations. In Algorithms in Bioinformatics - 6th International Workshop, WABI 2006, Proceedings. Springer Verlag. 2006. p. 56-67. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).