A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem

DOI10.1007/978-3-540-73545-8_5zbMATH Open1206.92019OpenAlexW2124304011MaRDI QIDQ3608827FDOQ3608827

Yu-Feng Wu, Dan Gusfield

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_5

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

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Genetics and epigenetics (92D10) Problems related to evolution (92D15) Integer programming (90C10)

Cited In (4)

• ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
• Research in Computational Molecular Biology
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors
• A new recombination lower bound and the minimum perfect phylogenetic forest problem

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