Advertisement

A Nearly Linear-Time General Algorithm for Genome-Wide Bi-allele Haplotype Phasing

  • Will Casey
  • Bud Mishra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2913)

Abstract

The determination of feature maps, such as STSs (sequence tag sites), SNPs (single nucleotide polymorphisms) or RFLP (restriction fragment length polymorphisms) maps, for each chromosome copy or haplotype in an individual has important potential applications to genetics, clinical biology and association studies. We consider the problem of reconstructing two haplotypes of a diploid individual from genotype data generated by mapping experiments, and present an algorithm to recover haplotypes. The problem of optimizing existing methods of SNP phasing with a population of diploid genotypes has been investigated in [7] and found to be NP-hard. In contrast, using single molecule methods, we show that although haplotypes are not known and data are further confounded by the mapping error model, reasonable assumptions on the mapping process allow us to recover the co-associations of allele types across consecutive loci and estimate the haplotypes with an efficient algorithm. The haplotype reconstruction algorithm requires two stages: Stage I is the detection of polymorphic marker types, this is done by modifying an EM–algorithm for Gaussian mixture models and an example is given for RFLP sizing. Stage II focuses on the problem of phasing and presents a method of local maximum likelihood for the inference of haplotypes in an individual. The algorithm presented is nearly linear in the number of polymorphic loci. The algorithm results, run on simulated RFLP sizing data, are encouraging, and suggest that the method will prove practical for haplotype phasing.

Keywords

Genotype Data Gaussian Mixture Model Polymorphic Locus Allele Type Full Paper 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Anantharaman, T.S., Mishra, B., Schwartz, D.C.: Genomics via Optical Mapping II: Ordered Restriction Maps. Journal of Computational Biology 4(2), 91–118 (1997)CrossRefGoogle Scholar
  2. 2.
    Bafna, V., Gusfield, D., Lancia, G., Yooseph, S.: Haplotyping as Perfect Phylogeny, A Direct Approach. Technical Report UC Davis CSE–2002–21Google Scholar
  3. 3.
    Casey, W., Mishra, B., Wigler, M.: Placing Probes on the Genome with Pairwise Distance Data. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 52–68. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Clark, A.: Inference of Haplotypes from PCR-Amplified Samples of Diploid Populations. Mol. Biol. Evol. 7, 111–122 (1990)Google Scholar
  5. 5.
    Dempster, A., Laird, N.N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J.R. Stat. Soc. 39, 1–38 (1977)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Excoffier, L., Slatkin, M.: Maximum–Likelihood Estimation of Molecular Haplotype Frequencies in a Diploid Population. Mol. Biol. Evol. 12, 921–927 (1995)Google Scholar
  7. 7.
    Gusfield, D.: Inference of Haplotypes from Samples of Diploid Populations: Complexity and Algorithms. Journal of Computational Biology 8(3), 305–323 (2001)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Ma, J., Xu, L., Jordan, M.: Asymptotic Convergence Rate of the EM– Algorithm for Gaussian Mixtures. Neural Computation 12(12), 2881–2907 (2000)CrossRefGoogle Scholar
  9. 9.
    Mitra, R., Church, G.: In situ localized amplification and contact replication of many individual DNA molecules. Nucleic Acids Research 27(24), e34-e34 (1999)Google Scholar
  10. 10.
    Niu, T., Qin, Z., Xu, X., Liu, J.: Bayesian Haplotype Inference for Multiple Linked Single-Nucleotide Polymorphisms. Am. J. Hum. Genet. 70, 156–169 (2002)CrossRefGoogle Scholar
  11. 11.
    Parida, L., Mishra, B.: Partitioning Single-Molecule Maps into Multiple Populations: Algorithms And Probabilistic Analysis. Discrete Applied Mathematics (The Computational Molecular Biology Series) 104(l-3), 203–227 (2000)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Roweis, S., Ghahramani, Z.: A Unifying Review of Linear Gaussian Models. Neural Computation 11(2), 305–345 (1999)CrossRefGoogle Scholar
  13. 13.
    Stephens, M., Smith, N., Donnelly, P.: A new statistical method for haplotype reconstruction from population data. Am. J. Hum. Genet. 68, 978–989 (2001)CrossRefGoogle Scholar
  14. 14.
    Tarjan, R.E.: Data Structures and Network Algorithms, CBMS 44. SIAM, Philadelphia (1983)Google Scholar
  15. 15.
    Weir, B.: Genetic Data Analysis II. Sinauer Associates, Sunderland (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Will Casey
    • 1
  • Bud Mishra
    • 1
    • 2
    • 3
  1. 1.Courant Institute of Mathematical SciencesNew YorkUSA
  2. 2.Cold Spring Harbor LabCold Spring HarborNew YorkUSA
  3. 3.Tata Institute of Fundamental ResearchMumbaiIndia

Personalised recommendations