A lower bound for the breakpoint phylogeny problem

DOI10.1016/S1570-8667(03)00077-7zbMATH Open1114.92049OpenAlexW1973111150MaRDI QIDQ876716FDOQ876716

David Bryant

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00077-7

zbMATH Keywords

phylogeneticsbreakpointsLagrange multiplierslower boundsgene order data

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Problems related to evolution (92D15) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTS
• Steps toward accurate reconstructions of phylogenies from gene-order data.
• Transforming cabbage into turnip
• Reducibility Among Combinatorial Problems
• Locating the vertices of a steiner tree in an arbitrary metric space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Phylogenetic flexibility via Hall-type inequalities and submodularity

Uses Software

• TSPLIB
• PAUP*
• GRAPPA

This page was built for publication: A lower bound for the breakpoint phylogeny problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876716)