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 Scopus citations


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
Number of pages12
ISBN (Print)3540395830, 9783540395836
StatePublished - 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


Other6th International Workshop on Algorithms in Bioinformatics, WABI 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Linear-time haplotype inference on pedigrees without recombinations'. Together they form a unique fingerprint.

Cite this