Skip to main content

Linear-Time Haplotype Inference on Pedigrees Without Recombinations

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 4175))

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cox, R., Bouzekri, N., et al.: Angiotensin-1-converting enzyme (ACE) plasma concentration is influenced by multiple ACE-linked quantitative trait nucleotides. Hum. Mol. Genet. 11, 2969–2977 (2002)

    Article  Google Scholar 

  2. Li, J., Jiang, T.: Efficient rule-based haplotyping algorithms for pedigree data. In: RECOMB 2003, pp. 197–206 (2003)

    Google Scholar 

  3. Li, J., Jiang, T.: Efficient inference of haplotypes from genotypes on a pedigree. J. Bioinfo. Comp. Biol. 1(1), 41–69 (2003)

    Article  Google Scholar 

  4. Li, J., Jiang, T.: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. In: RECOMB 2004, pp. 20–29 (2004)

    Google Scholar 

  5. O’Connell, J.R.: Zero-recombinant haplotyping: applications to fine mapping using SNPs. Genet. Epidemiol. 19(1), S64–S70 (2000)

    Article  Google Scholar 

  6. Russo, E., et al.: Single nucleotide polymorphism: Big pharmacy hedges its bets. The Scientist 13 (1999)

    Google Scholar 

  7. Wang, N., Akey, J.M., Zhang, K., Chakraborty, K., Jin, L.: Distribution of recombination crossovers and the origin of haplotype blocks: The interplay of population history, recombination, and mutation. Am. J. Hum. Genet. 11, 1227–1234 (2002)

    Article  Google Scholar 

  8. Wijsman, E.M.: A deductive method of haplotype analysis in pedigrees. Am. J. Hum. Genet. 41(3), 356–373 (1987)

    Google Scholar 

  9. Xiao, J., Liu, L., Xia, L., Jiang, T.: Fast Elimination of Redundant Linear Equations and Reconstruction of Recombination-Free Mendelian Inheritance on a Pedigree (manuscript)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, M.Y., Chan, WT., Chin, F.Y.L., Fung, S.P.Y., Kao, MY. (2006). Linear-Time Haplotype Inference on Pedigrees Without Recombinations. In: Bücher, P., Moret, B.M.E. (eds) Algorithms in Bioinformatics. WABI 2006. Lecture Notes in Computer Science(), vol 4175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11851561_6

Download citation

  • DOI: https://doi.org/10.1007/11851561_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39583-6

  • Online ISBN: 978-3-540-39584-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics