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

DOI10.1016/J.DAM.2005.05.044MaRDI QIDQ876478zbMATHOpenAlexFDO

Authors 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

SNPhybridizationphylogenetic networksrecombinationancestral recombination graphmolecular evolution

Mathematics Subject Classification ID

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

Recommendations

• Research in Computational Molecular Biology
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• Research in Computational Molecular Biology

Cites work

• Efficient algorithms for inferring evolutionary trees
• On the minimum number of recombination events in the evolutionary history of DNA se\-quences
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Reconstructing evolution of sequences subject to recombination using parsimony
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• The fine structure of galls in phylogenetic networks
• Towards the development of computational tools for evaluating phylogenetic network reconstruction methods

Cited in

(16)

• ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
• Bounding the number of hybridisation events for a consistent evolutionary history
• Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
• Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
• Constructing the simplest possible phylogenetic network from triplets
• Clustered SplitsNetworks
• Counting phylogenetic networks with few reticulation vertices: a second approach
• Research in Computational Molecular Biology
• Research in Computational Molecular Biology
• When two trees go to war
• A new recombination lower bound and the minimum perfect phylogenetic forest problem
• A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
• Book review of: D. Gusfield, ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks
• A pattern recognition-based approach for phylogenetic network construction with constrained recombination
• All that glisters is not galled
• Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections

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

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