An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study

DOI10.1016/j.dam.2005.05.044zbMath1259.92077OpenAlexW2033833391MaRDI QIDQ876478

Dan Gusfield, Satish Eddhu, Dean R. Hickerson

Publication date: 18 April 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.044

zbMATH Keywords

recombinationmolecular evolutionSNPhybridizationphylogenetic networksancestral recombination graph

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Systems biology, networks (92C42)

Related Items (7)

ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations ⋮ Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ When two trees go to war ⋮ All that glisters is not galled ⋮ A new recombination lower bound and the minimum perfect phylogenetic forest problem ⋮ Clustered SplitsNetworks

Cites Work

• Unnamed Item
• Reconstructing evolution of sequences subject to recombination using parsimony
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• The Fine Structure of Galls in Phylogenetic Networks
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study