Abstract
Under the infinite-sites model of mutation, we consider the problem of finding the minimum number of recombination events which must have occurred in the evolutionary history of sampled DNA sequences. Our approach is deterministic and is based on the combinatorics of leaf-labelled rooted trees. In contrast to previously known approaches, which only yield estimated lower bounds, our approach always gives the exact minimum number of recombination events. Furthermore, our method can be used to reconstruct explicitly evolutionary histories with the minimum number of recombination events. As an additional application, we discuss how our work can be used to define haplotype blocks.
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
Daly, M.J., et al.: High-Resolution Haplotype Structure in the Human Genome. Nat. Genet. 29, 229–232 (2001)
Fearnhead, P., Donnelly, P.: Estimating Recombination Rates from Population Genetic Data. Genetics 159, 1299–1318 (2001)
Gabriel, S.B., et al.: The Structure of Haplotype Blocks in the Human Genome. Science 296, 2225–2229 (2002)
Hein, J.: Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony. Math. Biosci. 98, 185–200 (1990)
Hein, J.: A Heuristic Method to Reconstruct the History of Sequences Subject to Recombination. J. Mol. Evol. 36, 396–405 (1993)
Hudson, R.R., Kaplan, N.L.: Statistical Properties of the Number of Recombination Events in the History of a Sample of DNA Sequences. Genetics 11, 147–164 (1985)
Johnson, G.C., et al.: Haplotype Tagging for the Identification of common Disease Genes. Nat. Genet. 29, 233–237 (2001)
Kreitman, M.: Nucleotide Polymorphism at the Alcohol Dehydrogenase Locus of Drosophila Melanogaster. Nature 304, 412–417 (1983)
Myers, S.R., Griffiths, R.C.: Bounds on the Minimum Number of Recombination Events in a Sample History. Genetics 163, 375–394 (2003)
Schröder, E.: Vier Combinatorische Probleme. Zeit. für. Math. Phys 15, 361–376 (1870)
Song, Y.S.: Notes on the Combinatorics of Rooted Binary Phylogenetic Trees, submitted to Annals of Combinatorics for publication
Song, Y.S., Hein, J.: On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences. J. Math. Biol. (to appear)
Wang, L., Zhang, K., Zhang, L.: Perfect Phylogenetic Networks with Recombination. J. Comp. Biol 8, 69–78 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, Y.S., Hein, J. (2003). Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks. In: Benson, G., Page, R.D.M. (eds) Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Computer Science(), vol 2812. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39763-2_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-39763-2_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20076-5
Online ISBN: 978-3-540-39763-2
eBook Packages: Springer Book Archive