ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations

DOI10.1007/978-3-540-69068-9_1zbMath1143.68628OpenAlexW1601327815MaRDI QIDQ3506937

Dan Gusfield

Publication date: 17 June 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_1

Mathematics Subject Classification ID

Problems related to evolution (92D15) General topics of discrete mathematics in relation to computer science (68R01) Nonnumerical algorithms (68W05) Genetics and epigenetics (92D10)

Related Items (1)

ReCombinatorics

Cites Work

• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• The Fine Structure of Galls in Phylogenetic Networks
• Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
• Algorithms to Distinguish the Role of Gene-Conversion from Single-Crossover Recombination in the Derivation of SNP Sequences in Populations
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Research in Computational Molecular Biology

This page was built for publication: ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations