An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations

DOI10.1016/j.ipl.2008.12.016zbMath1209.68353OpenAlexW2046779486MaRDI QIDQ987779

Yu-Feng Wu

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.12.016

zbMATH Keywords

algorithmpopulation geneticscombinatorial problemsrecombinationancestral recombination graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (1)

Large neighbourhood search algorithms for the founder sequence reconstruction problem

Cites Work

• On the computational complexity of the rooted subtree prune and regraft distance
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Algorithms on Strings, Trees and Sequences
• Unnamed Item

This page was built for publication: An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations