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

DOI10.1016/j.dam.2005.05.044zbMath1259.92077MaRDI 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

recombination; molecular evolution; SNP; hybridization; phylogenetic networks; ancestral recombination graph

Mathematics Subject Classification ID

05C05: Trees

92D15: Problems related to evolution

05C90: Applications of graph theory

92C42: Systems biology, networks

Related Items

Clustered SplitsNetworks, Constructing the simplest possible phylogenetic network from triplets, All that glisters is not galled, A new recombination lower bound and the minimum perfect phylogenetic forest problem, ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations

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