𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of computing the temporal hybridization number for two phylogenies

✍ Scribed by Humphries, Peter J.; Linz, Simone; Semple, Charles

Book ID
123598052
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
548 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Simple Fixed Parameter Tractable Algor
A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees
✍ Piovesan, Teresa; Kelk, Steven M. πŸ“‚ Article πŸ“… 2013 πŸ› IEEE 🌐 English βš– 243 KB

Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time ð6 r r!Þ Á polyðnÞ, where n ¼ jXj. The novelty of this approach is its use of terminals, which are maximal elements of a na