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

DOI10.1016/J.IPL.2008.12.016zbMATH Open1209.68353OpenAlexW2046779486MaRDI QIDQ987779FDOQ987779

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

population geneticsalgorithmrecombinationcombinatorial problemsancestral recombination graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• On the computational complexity of the rooted subtree prune and regraft distance
• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

Cited In (1)

• Large neighbourhood search algorithms for the founder sequence reconstruction problem

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

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