Abstract
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.
Supported in part by a Bioinformatics Postdoc. Fellowship from the CIAR, Evolutionary Biology Program and by NSERC and CGAT grants to D. Sankoff.
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
Blanchette, M., Kunisawa, T. and Sankoff, D. 1999. Gene order breakpoint evidence in animal mitochondrial phylogeny. Journal of Molecular Evolution 49, 193–203.
Bryant, D., Deneault, M. and Sankoff, D. 1999. The breakpoint median problem. Centre de recherches mathématiques, Université de Montréal. ms.
Caprara, A. 1999. Formulations and hardness of multiple sorting by reversals. In: Istrail, S., Pevzner, P.A. and Waterman, M. (eds) Proceedings of the 3rd Annual International Conference on Computational Molecular Biology (RECOMB 99). ACM, New York, pp 84–93.
Hannenhalli, S., Chappey, C., Koonin, E.V. and Pevzner, P.A. 1995. Genome sequence comparison and scenarios for gene rearrangements: a test case. Genomics 30, 299–311.
Hannenhalli, S. and Pevzner, P.A. 1995. Transforming cabbage into turnip. (polynomial algorithm for sorting signed permutations by reversals). In: Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing, pp 178–189.
Held, M. and Karp, R. 1970. The traveling salesman problem and minimum spanning trees: part II. Math. Programming 1, 16–25.
Held, M. and Karp, R. 1970. The traveling salesman problem and minimum spanning trees. Operations Res. 18, 1138–1162.
Karp, R.M. Reducibility among combinatorial problems. In: Miller, R.E., and Thatcher, J. (eds) Complexity of Computer Computations, Plenum Press, New York, 85–103.
Korab-Laskowska, M., Rioux, P., Brossard, N., Littlejohn, T.G., Gray, M.W., Lang, B.F. and Burger, G. 1998. The Organelle Genome Database Project (GOBASE). Nucleic Acids Research 26, 139–146. http://megasun.bch.umontreal.ca/gobase/gobase.html
Pe’er, I. and Shamir, R. 1998. The median problems for breakpoints are NP-complete. Electronic Colloquium on Computational Complexity Technical Report 98-071, http://www.eccc.uni-trier.de/eccc
Reinelt, G. 1991. The traveling salesman-computational solutions for TSP applications. Springer Verlag.
Sankoff, D., Rousseau, P. 1975. Locating the vertices of a Steiner tree in an arbitrary metric space. Math. Programming 9(2), 240–246.
Sankoff, D. 1992. Edit distance for genome comparison based on non-local operations. In: Apostolico, A., Crochemore, M., Galil, Z. and Manber, U. (eds) Combinatorial Pattern Matching. 3rd Annual Symposium. Lecture Notes in Computer Science 644. Springer Verlag, New York, pp 121–135.
Sankoff, D., Sundaram, G. and Kececioglu, J. 1996. Steiner points in the space of genome rearrangements. International Journal of the Foundations of Computer Science 7, 1–9.
Sankoff, D., Blanchette, M. 1998. Multiple genome rearrangement and breakpoint phylogeny. Journal of Computational Biology 5, 555–570.
Sankoff, D., Bryant, D., Denault, M., Lang, B.F., Burger, G. 2000. Early eukaryote evolution based on mitochondrial gene order breakpoints. In: Istrail, S., Pevzner, P.A. and Waterman, M. (eds) Proceedings of the 5th Annual International Conference on Computational Molecular Biology (RECOMB 00). ACM, New York (to appear).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bryant, D. (2000). A Lower Bound for the Breakpoint Phylogeny Problem. In: Giancarlo, R., Sankoff, D. (eds) Combinatorial Pattern Matching. CPM 2000. Lecture Notes in Computer Science, vol 1848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45123-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-45123-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67633-1
Online ISBN: 978-3-540-45123-5
eBook Packages: Springer Book Archive