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 treesKernelizations for the hybridization number problem on multiple nonbinary treesOn joint subtree distributions under two evolutionary modelsSpaces of phylogenetic networks from generalized nearest-neighbor interchange operationsImproved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic treesThe rigid hybrid number for two phylogenetic treesA parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating treesAnalyzing and reconstructing reticulation networks under timing constraintsComputing the minimum number of hybridization events for a consistent evolutionary historyCherry picking: a characterization of the temporal hybridization number for a set of phylogeniesHypercubes and Hamilton cycles of display sets of rooted phylogenetic networksCyclic generators and an improved linear kernel for the rooted subtree prune and regraft distanceOn the existence of a cherry-picking sequenceOn the complexity of computing the temporal hybridization number for two phylogeniesA quadratic kernel for computing the hybridization number of multiple treesA cluster reduction for computing the subtree distance between phylogeniesAttaching leaves and picking cherries to characterise the hybridisation number for a set of phylogeniesOn the fixed parameter tractability of agreement-based phylogenetic distancesOn unrooted and root-uncertain variants of several well-known phylogenetic network problemsConstructing the simplest possible phylogenetic network from tripletsWhen two trees go to warPhylogenetic networks from multi-labelled treesAn Improved Approximation Algorithm for rSPR DistanceHybridization Number on Three Rooted Binary Trees is EPTNote on the hybridization number and subtree distance in phylogeneticsComputing Maximum Agreement Forests without Cluster Partitioning is FollyA practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees



Cites Work


This page was built for publication: Bounding the number of hybridisation events for a consistent evolutionary history