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

DOI10.1007/S00285-003-0227-5MaRDI QIDQ1889356zbMATH OpenOpenAlexWikidataFDO

Authors Yun S. Song, Jotun 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 boundsGraphRecombinationIncompatibilityEvolutionary historyMinimum number

Mathematics Subject Classification ID

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

Recommendations

• On the minimum number of topologies explaining a sample of DNA sequences
• Reconstructing a history of recombinations from a set of sequences
• scientific article; zbMATH DE number 1796956
• Research in Computational Molecular Biology
• scientific article; zbMATH DE number 1003279

Cited in

(7)

• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Constructing the simplest possible phylogenetic network from triplets
• Bounding the number of hybridisation events for a consistent evolutionary history
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
• Quantifying genetic innovation: mathematical foundations for the topological study of reticulate evolution

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

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