Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks
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.
KeywordsRecombination Event Rooted Tree Sequence Evolution Haplotype Block Minimal Path
Unable to display preview. Download preview PDF.
- 2.Fearnhead, P., Donnelly, P.: Estimating Recombination Rates from Population Genetic Data. Genetics 159, 1299–1318 (2001)Google Scholar
- 6.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)Google Scholar
- 9.Myers, S.R., Griffiths, R.C.: Bounds on the Minimum Number of Recombination Events in a Sample History. Genetics 163, 375–394 (2003)Google Scholar
- 10.Schröder, E.: Vier Combinatorische Probleme. Zeit. für. Math. Phys 15, 361–376 (1870)Google Scholar
- 11.Song, Y.S.: Notes on the Combinatorics of Rooted Binary Phylogenetic Trees, submitted to Annals of Combinatorics for publicationGoogle Scholar
- 12.Song, Y.S., Hein, J.: On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences. J. Math. Biol. (to appear)Google Scholar