A lower bound for the breakpoint phylogeny problem

DOI10.1016/S1570-8667(03)00077-7MaRDI QIDQ876716zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1615284
• Phylogenetic reconstruction from genome order data
• Approximation algorithms for the median problem in the breakpoint model
• Combinatorial Pattern Matching
• scientific article; zbMATH DE number 1088277

Cites work

• scientific article; zbMATH DE number 1088277 (Why is no real title available?)
• scientific article; zbMATH DE number 1945189 (Why is no real title available?)
• An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanula\-ceae
• Approximation algorithms for the median problem in the breakpoint model
• Chloroplast gene order and the divergence of plants and algae, from the normalized number of induced breakpoints
• Gene order and phylogenetic information
• Locating the vertices of a steiner tree in an arbitrary metric space
• Reducibility among combinatorial problems
• STEINER POINTS IN THE SPACE OF GENOME REARRANGEMENTS
• Steps toward accurate reconstructions of phylogenies from gene-order data.
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Transforming cabbage into turnip

Cited in

(5)

• An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanula\-ceae
• scientific article; zbMATH DE number 1615284 (Why is no real title available?)
• Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
• Phylogenetic reconstruction from genome order data
• Phylogenetic flexibility via Hall-type inequalities and submodularity

Describes a project that uses

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)