A new recombination lower bound and the minimum perfect phylogenetic forest problem

DOI10.1007/S10878-007-9129-6MaRDI QIDQ1029702zbMATH OpenOpenAlexFDO

Authors Dan Gusfield, Yu-Feng Wu

Publication date 13 July 2009

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-007-9129-6

zbMATH Keywords

ancestral recombination graphcomputational complexitylower bound on the minimum number of recombinationpopulation genetics

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory (05C90) Complexity and performance of numerical algorithms (65Y20) Integer programming (90C10) Applications of mathematical programming (90C90) Problems related to evolution (92D15)

Recommendations

• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Research in Computational Molecular Biology
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Bounds on the minimum mosaic of population sequences under recombination
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences

Cites work

• Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Efficient algorithms for inferring evolutionary trees
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the computational complexity of the rooted subtree prune and regraft distance
• The Steiner problem in phylogeny is NP-complete

Cited in

(7)

• When two trees go to war
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors
• Bounds on the minimum mosaic of population sequences under recombination
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Research in Computational Molecular Biology
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study

This page was built for publication: A new recombination lower bound and the minimum perfect phylogenetic forest problem

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