Bounding the number of hybridisation events for a consistent evolutionary history
From MaRDI portal
Publication:2388380
DOI10.1007/s00285-005-0315-9zbMath1068.92034OpenAlexW2057280377WikidataQ34415638 ScholiaQ34415638MaRDI QIDQ2388380
Charles Semple, Mihaela Baroni, Vincent L. Moulton, Stefan Grünewald
Publication date: 13 September 2005
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10092/1670
Related Items (27)
Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees ⋮ Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ On joint subtree distributions under two evolutionary models ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees ⋮ The rigid hybrid number for two phylogenetic trees ⋮ A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees ⋮ Analyzing and reconstructing reticulation networks under timing constraints ⋮ Computing the minimum number of hybridization events for a consistent evolutionary history ⋮ Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies ⋮ Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks ⋮ Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance ⋮ On the existence of a cherry-picking sequence ⋮ On the complexity of computing the temporal hybridization number for two phylogenies ⋮ A quadratic kernel for computing the hybridization number of multiple trees ⋮ A cluster reduction for computing the subtree distance between phylogenies ⋮ Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies ⋮ On the fixed parameter tractability of agreement-based phylogenetic distances ⋮ On unrooted and root-uncertain variants of several well-known phylogenetic network problems ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ When two trees go to war ⋮ Phylogenetic networks from multi-labelled trees ⋮ An Improved Approximation Algorithm for rSPR Distance ⋮ Hybridization Number on Three Rooted Binary Trees is EPT ⋮ Note on the hybridization number and subtree distance in phylogenetics ⋮ Computing Maximum Agreement Forests without Cluster Partitioning is Folly ⋮ A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
Cites Work
- Reconstructing evolution of sequences subject to recombination using parsimony
- A framework for representing reticulate evolution
- On the computational complexity of the rooted subtree prune and regraft distance
- On the minimum number of recombination events in the evolutionary history of DNA se\-quences
- Subtree transfer operations and their induced metrics on evolutionary trees
- On the complexity of comparing evolutionary trees
This page was built for publication: Bounding the number of hybridisation events for a consistent evolutionary history
