A lower bound for the breakpoint phylogeny problem

Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny algorithms for the analysis of large genomes with varied gene content are heuristics with no optimality guarantee. Here we address this shortcoming by describing new bounds for the breakpoint median problem, and for the more complicated breakpoint phylogeny problem. In both cases we employ Lagrangian multipliers and subgradient optimization to tighten the bounds. The experimental results are promising: we achieve lower bounds close to the upper bounds established using breakpoint phylogeny heuristics.

[1]  David Sankoff,et al.  Multiple Genome Rearrangement and Breakpoint Phylogeny , 1998, J. Comput. Biol..

[2]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[3]  Pavel A. Pevzner,et al.  Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals , 1995, JACM.

[4]  David Sankoff,et al.  Probability models for genome rearrangement and linear invariants for phylogenetic inference , 1999, RECOMB.

[5]  David Sankoff,et al.  Early eukaryote evolution based on mitochondrial gene order breakpoints , 2000, RECOMB '00.

[6]  R. Shamir,et al.  Approximation Algorithms for the Median Problem in the Breakpoint Model , 2000 .

[7]  HannenhalliSridhar,et al.  Transforming cabbage into turnip , 1999 .

[8]  B. Larget,et al.  Markov Chain Monte Carlo Algorithms for the Bayesian Analysis of Phylogenetic Trees , 2000 .

[9]  Ron Shamir,et al.  The median problems for breakpoints are NP-complete , 1998, Electron. Colloquium Comput. Complex..

[10]  W. Fitch.  Toward Defining the Course of Evolution: Minimum Change for a Specific Tree Topology , 1971 .

[11]  David Sankoff,et al.  Steiner Points in the Space of Genome Rearrangements , 1996, Int. J. Found. Comput. Sci..

[12]  David Sankoff,et al.  The Median Problem for Breakpoints in Comparative Genomics , 1997, COCOON.

[13]  David A. Bader,et al.  A New Implmentation and Detailed Study of Breakpoint Analysis , 2000, Pacific Symposium on Biocomputing.

[14]  David Sankoff,et al.  Edit Distances for Genome Comparisons Based on Non-Local Operations , 1992, CPM.

[15]  Alberto Caprara,et al.  Formulations and hardness of multiple sorting by reversals , 1999, RECOMB.

[16]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[17]  Timothy G. Littlejohn,et al.  The Organelle Genome Database Project (GOBASE) , 1998, Nucleic Acids Res..

[18]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[19]  Breakpoint Phylogenies. , 1997, Genome informatics. Workshop on Genome Informatics.

[20]  D. Sankoff,et al.  Gene Order Breakpoint Evidence in Animal Mitochondrial Phylogeny , 1999, Journal of Molecular Evolution.

[21]  David Sankoff,et al.  Chloroplast Gene Order and the Divergence of Plants and Algae, from the Normalized Number of Induced Breakpoints , 2000 .

[22]  Anil K. Kesarwani,et al.  Genome Informatics , 2019, Encyclopedia of Bioinformatics and Computational Biology.

[23]  C. Gallut,et al.  Gene Order and Phylogenetic Information , 2000 .

[24]  P A Pevzner,et al.  Genome sequence comparison and scenarios for gene rearrangements: a test case. , 1995, Genomics.

[25]  David Sankoff,et al.  Locating the vertices of a steiner tree in an arbitrary metric space , 1975, Math. Program..

[26]  Tao Liu,et al.  Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data , 2002, WABI.

[27]  P. Pevzner,et al.  Genome-scale evolution: reconstructing gene orders in the ancestral species. , 2002, Genome research.

[28]  Bernard M. E. Moret,et al.  An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae , 2000 .

[29]  Tandy J. Warnow,et al.  Steps toward accurate reconstructions of phylogenies from gene-order data , 2002, J. Comput. Syst. Sci..

[30]  Monique Turmel,et al.  Ancestral chloroplast genome in Mesostigma viride reveals an early branch of green plant evolution , 2000, Nature.