On the minimum number of recombination events in the evolutionary history of DNA se\-quences

DOI10.1007/s00285-003-0227-5zbMath1063.92041OpenAlexW2037655215WikidataQ44743848 ScholiaQ44743848MaRDI QIDQ1889356

Yun S. Song, Jotun J. Hein

Publication date: 1 December 2004

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00285-003-0227-5

zbMATH Keywords

Lower boundsRecombinationGraphIncompatibilityEvolutionary historyMinimum number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)

Related Items (4)

Bounding the number of hybridisation events for a consistent evolutionary history ⋮ An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

This page was built for publication: On the minimum number of recombination events in the evolutionary history of DNA se\-quences