Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks

Finding the Minimum Number of Recombination Events
  • Yun S. Song
  • Jotun Hein
Conference paper

DOI: 10.1007/978-3-540-39763-2_22

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2812)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Yun S. Song
    • 1
  • Jotun Hein
    • 1
  1. 1.Department of StatisticsUniversity of OxfordOxfordUK

Personalised recommendations