A lower bound for the breakpoint phylogeny problem
From MaRDI portal
(Redirected from Publication:876716)
Recommendations
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)- Phylogenetic flexibility via Hall-type inequalities and submodularity
- Phylogenetic reconstruction from genome order data
- Additive Bounding, Worst-Case Analysis, and the Breakpoint Median Problem
- 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?)
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)
