A greedy algorithm for optimal recombination
From MaRDI portal
Recommendations
- Optimal algorithms for recombination distance problem
- Optimal recombination algorithms for generalized chains
- Reconstructing a history of recombinations from a set of sequences
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Reconstructing evolution of sequences subject to recombination using parsimony
Cited in
(7)- The optimum recombination rate that realizes the fastest evolution of a novel functional combination of many genes
- A fast algorithm for computing multilocus recombination
- On the minimum number of recombination events in the evolutionary history of DNA se\-quences
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
- Optimal recombination algorithms for generalized chains
- Optimal algorithms for recombination distance problem
- Optimal weighted recombination
This page was built for publication: A greedy algorithm for optimal recombination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551350)