An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study
DOI10.1016/J.DAM.2005.05.044zbMATH Open1259.92077OpenAlexW2033833391MaRDI QIDQ876478FDOQ876478
Dan Gusfield, Dean R. Hickerson, Satish Eddhu
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
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
Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05) Systems biology, networks (92C42)
Cites Work
- The fine structure of galls in phylogenetic networks
- Efficient algorithms for inferring evolutionary trees
- Reconstructing evolution of sequences subject to recombination using parsimony
- 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
- Towards the development of computational tools for evaluating phylogenetic network reconstruction methods
- Research in Computational Molecular Biology
- Research in Computational Molecular Biology
Cited In (16)
- A pattern recognition-based approach for phylogenetic network construction with constrained recombination
- A New Recombination Lower Bound and the Minimum Perfect Phylogenetic Forest Problem
- Counting phylogenetic networks with few reticulation vertices: a second approach
- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
- When two trees go to war
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
- Research in Computational Molecular Biology
- Research in Computational Molecular Biology
- Book review of: D. Gusfield, ReCombinatorics. The algorithmics of ancestral recombination graphs and explicit phylogenetic networks
- All that glisters is not galled
- Clustered SplitsNetworks
- Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination
- Bounding the number of hybridisation events for a consistent evolutionary history
- Constructing the simplest possible phylogenetic network from triplets
- A new recombination lower bound and the minimum perfect phylogenetic forest problem
- 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)
