Minimum Recombination Histories by Branch and Bound

  • Rune B. Lyngsø
  • Yun S. Song
  • Jotun Hein
Conference paper

DOI: 10.1007/11557067_20

Volume 3692 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lyngsø R.B., Song Y.S., Hein J. (2005) Minimum Recombination Histories by Branch and Bound. In: Casadio R., Myers G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science, vol 3692. Springer, Berlin, Heidelberg

Abstract

Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M of sampled sequences, finding an evolutionary history for M with the minimum number of recombination events is a computationally very challenging problem. In this paper, we present a novel branch and bound algorithm for tackling that problem. Our method is shown to be far more efficient than the only preexisting exact method, described in [1]. Our software implementing the algorithm discussed in this paper is publicly available.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rune B. Lyngsø
    • 1
  • Yun S. Song
    • 2
  • Jotun Hein
    • 1
  1. 1.Dept. of StatisticsOxford UniversityOxfordUnited Kingdom
  2. 2.Dept. of Computer ScienceUniversity of CaliforniaDavisU.S.A.