Resolving unresolved resolved and unresolved triplets consistency problems

DOI10.1007/978-3-031-63021-7_15MaRDI QIDQ7021097zbMATH OpenFDO

Authors Daniel J. Harvey, Jesper Jansson, Mikołaj Marciniak, Yukihiro Murakami

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_15

zbMATH Keywords

computational complexityphylogenetic treerooted triplets consistencytree algorithm

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network
• An efficient algorithm for supertrees
• Analytic solutions for three taxon ML trees with variable rates across sites
• Constructing rooted supertrees using distances
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Reconstructing minimal rooted trees.
• Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets
• Reconstruction of rooted trees from subtrees

This page was built for publication: Resolving unresolved resolved and unresolved triplets consistency problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7021097)