Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
From MaRDI portal
Publication:5470727
DOI10.1137/S0097539704446529zbMath1100.68081MaRDI QIDQ5470727
Wing-Kin Sung, Nguyen Bao Nguyen, Jesper Jansson
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Mathematical biology in general (92B99)
Related Items (24)
On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters ⋮ Kernelizations for the hybridization number problem on multiple nonbinary trees ⋮ Encoding and constructing 1-nested phylogenetic networks with trinets ⋮ Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations ⋮ Optimizing tree and character compatibility across several phylogenetic trees ⋮ Algorithms for visualizing phylogenetic networks ⋮ Phylogenetic Networks ⋮ Caterpillars on three and four leaves are sufficient to binary normal networks ⋮ Computing the rooted triplet distance between galled trees by counting triangles ⋮ Faster computation of the Robinson-Foulds distance between phylogenetic networks ⋮ On encodings of phylogenetic networks of bounded level ⋮ Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable ⋮ Reconstructing a phylogenetic level-1 network from quartets ⋮ Trinets encode orchard phylogenetic networks ⋮ Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets ⋮ Trinets encode tree-child and level-2 phylogenetic networks ⋮ A cubic-time algorithm for computing the trinet distance between level-1 networks ⋮ Constructing the simplest possible phylogenetic network from triplets ⋮ When two trees go to war ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks ⋮ New results on optimizing rooted triplets consistency ⋮ All that glisters is not galled ⋮ Hierarchies from lowest stable ancestors in nonbinary phylogenetic networks ⋮ Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
This page was built for publication: Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
