Bounds on the minimum mosaic of population sequences under recombination

DOI10.1007/978-3-642-13509-5_15MaRDI QIDQ3575244zbMATH OpenOpenAlexFDO

Authors Yu-Feng Wu

Publication date 26 July 2010

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13509-5_15

Mathematics Subject Classification ID

Integer programming (90C10) Genetics and epigenetics (92D10)

Recommendations

• Minimum mosaic inference of a set of recombinants
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Research in Computational Molecular Biology
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem

Cited in

(6)

• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• Minimum mosaic inference of a set of recombinants
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
• Research in Computational Molecular Biology

This page was built for publication: Bounds on the minimum mosaic of population sequences under recombination

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