Abstract
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community. Here the focus is on determining sets of SNP values on individual chromosomes since such information captures the genetic causes of diseases. Present algorithmic tools for haplotyping make effective use of phylogenetic trees. Here the underlying assumption is that recombinations are not present, an assumption based on experimental results. However these results do not fully exclude recombinations and models are needed that incorporate this extra degree of complication. Recently, Gusfield studied the two cases: haplotyping via imperfect phylogenies with a single homoplasy and via galled-tree networks with one gall. In earlier work we characterized the existence of the galled-tree networks. Building on this, we present a polynomial algorithm for haplotyping via galled-tree networks with simple galls (having two mutations). In the end, we give the experimental results comparing our algorithm with PHASE on simulated data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bafna, V., et al.: Haplotyping as perfect phylogeny: A direct approach. Journal of Computational Biology 10(3-4), 323–340 (2003)
Bonizzoni, P., et al.: The haplotyping problem: An overview of computational models and solutions. Journal of Computer Science and Technology 18, 675–688 (2003)
Clark, A.: Inference of haplotypes from PCR-amplified samples of dipoid populations. Molecular Biology and Evolution 7, 111–122 (1990)
Daly, M., et al.: High-resolution haplotype structure in the human genome. Nature Genetics 29(2), 229–232 (2001)
Gupta, A., et al.: On intractability of haplotype inferring via galled-tree networks (manuscript)
Gupta, A., et al.: Characterization of the existence of galled-tree networks. J. Bioinfo. and Comp. Biol. 4(6), 1309–1328 (2006)
Gusfield, D.: Haplotyping as perfect phylogeny: conceptual framework and efficient solutions. In: RECOMB ’02: Proc. of 6th annual international conference on Computational biology, pp. 166–175. ACM Press, New York (2002)
Gusfield, D.: An overview of combinatorial methods for haplotype inference. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol. 2983, pp. 9–25. Springer, Heidelberg (2004)
Gusfield, D.: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. J. Comput. Syst. Sci. 70(3), 381–398 (2005)
Gusfield, D., Eddhu, S., Langley, C.: Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proceedings of the 2003 IEEE CSB Bioinformatics Conference, pp. 363–374 (2003)
Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology 2(1), 173–213 (2004)
Istrail, S., et al.: A Survey of Computational Methods for Determining Haplotypes. In: Istrail, S., Waterman, M.S., Clark, A. (eds.) DIMACS/RECOMB Satellite Workshop 2002. LNCS (LNBI), vol. 2983, pp. 26–47. Springer, Heidelberg (2004)
Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences 98, 185–200 (1990)
Hein, J.: A heuristic method to reconstruct the history of sequences subject to recombination. Journal of Molecular Evolution 36, 396–405 (1993)
Hudson, R.R.: Generating samples under a Wright-Fisher neutral model of genetic variation. Bioinformatics 18(2), 337–338 (2002)
Lin, S., et al.: Haplotype inference in random population samples. American Journal of Human Genetics 71, 1129–1137 (2002)
Mitra, R.D., et al.: Digital genotyping and haplotyping with polymerase colonies. Proceedings of the Nationlal Academy of Sciences of the United States of America 100, 5926–5931 (2003)
Patil, N., et al.: Blocks of limited haplotype diversity revealed by high-resolution scanning of human chromosome 21. Science 294(5547), 1719–1723 (2001)
Song, Y., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology 48, 160–186 (2003)
Song, Y.S., Wu, Y., Gusfield, D.: Algorithms for imperfect phylogeny haplotyping (IPPH) with a single homoplasy or recombination event. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, pp. 152–164. Springer, Heidelberg (2005)
Stephens, M., Donnelly, P.: A comparison of bayesian methods for haplotype reconstruction from population genotype data. American Journal of Human Genetics 73, 1162–1169 (2003)
Stephens, M., Smith, N., Donnelly, P.: A new statistical method for haplotype reconstruction from population data. American Journal of Human Genetics 68, 978–989 (2001)
Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology 8(1), 69–78 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Maňuch, J., Stacho, L., Zhao, X. (2007). Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. In: Măndoiu, I., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2007. Lecture Notes in Computer Science(), vol 4463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72031-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-72031-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72030-0
Online ISBN: 978-3-540-72031-7
eBook Packages: Computer ScienceComputer Science (R0)