Minimum mosaic inference of a set of recombinants
From MaRDI portal
Publication:2841985
Recommendations
- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
- scientific article; zbMATH DE number 1945170
- Bounds on the minimum mosaic of population sequences under recombination
- Research in Computational Molecular Biology
- Reconstructing a history of recombinations from a set of sequences
Cites work
Cited in
(10)- scientific article; zbMATH DE number 1945170 (Why is no real title available?)
- Minimum segmentation for pan-genomic founder reconstruction in linear time
- Constructing founder sets under allelic and non-allelic homologous recombination
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- Research in Computational Molecular Biology
- Bounds on the minimum mosaic of population sequences under recombination
- Two strikes against the phage recombination problem
- Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
- Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction
- Linear time maximum segmentation problems in column stream model
This page was built for publication: Minimum mosaic inference of a set of recombinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841985)