Reconstructing fully-resolved trees from triplet cover distances

Katharina T. Huber, Mike Steel

Type: Preprint

Publication Date: 2012-01-01

Citations: 5

DOI: https://doi.org/10.48550/arxiv.1209.2391

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Minimum triplet covers of binary phylogenetic $X$-trees	2016	Katharina T. Huber Vincent Moulton Mike Steel
+	Minimum triplet covers of binary phylogenetic $X$-trees	2016	Katharina T. Huber Vincent Moulton Mike Steel
+ PDF Chat	Minimum triplet covers of binary phylogenetic X-trees	2017	Katharina T. Huber Vincent Moulton Mike Steel
+	Combinatorial properties of triplet covers for binary trees	2017	Stefan Gruenewald Katharina T. Huber Vincent Moulton Mike Steel
+	Combinatorial properties of triplet covers for binary trees	2017	Stefan Gruenewald Katharina T. Huber Vincent Moulton Mike Steel
+	Constructing a Consensus Phylogeny from a Leaf-Removal Distance	2017	Cédric Chauve Mark Jones Manuel Lafond Céline Scornavacca Mathias Weller
+	`Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers	2011	Andreas Dress Katharina T. Huber Mike Steel
+	Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks	2009	Jarosław Byrka Paweł Gawrychowski Katharina T. Huber Steven Kelk
+	Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks	2007	Jarosław Byrka Paweł Gawrychowski Katharina T. Huber Steven Kelk
+ PDF Chat	Split-or-decompose: Improved FPT branching algorithms for maximum agreement forests	2024	David Mestel Steven Chaplick Steven Kelk Ruben Meuwese
+	On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters	2015	Philippe Gambette Katharina T. Huber Steven Kelk
+ PDF Chat	On the challenge of reconstructing level-1 phylogenetic networks from triplets and clusters	2016	Philippe Gambette Katharina T. Huber Steven Kelk
+	Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees	2008	Sylvain Guillemot François Nicolas
+	Reconstructing trees from subtree weights	2004	Lior Pachter David E Speyer
+	Reconstructing Trees from Subtree Weights	2003	Lior Pachter David E Speyer
+	Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance	2022	Steven Kelk Simone Linz Ruben Meuwese
+	Constructing level-2 phylogenetic networks from triplets	2007	Leo van Iersel Judith Keijsper Steven Kelk Leen Stougie
+	Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees	2018	Marc Hellmuth
+	Generalized Fitch Graphs: Edge-labeled Graphs that are explained by Edge-labeled Trees	2018	Marc Hellmuth
+	Recovering tree-child networks from shortest inter-taxa distance information	2017	Magnus Bordewich Katharina T. Huber Vincent Moulton Charles Semple

Works That Cite This (3)

Action	Title	Year	Authors
+ PDF Chat	Lassoing and Corralling Rooted Phylogenetic Trees	2013	Katharina T. Huber Andrei-Alin Popescu
+	Combinatorial properties of triplet covers for binary trees	2018	Stefan Grünewald Katharina T. Huber Vincent Moulton Mike Steel
+ PDF Chat	Minimum triplet covers of binary phylogenetic X-trees	2017	Katharina T. Huber Vincent Moulton Mike Steel

Works Cited by This (2)

Action	Title	Year	Authors
+	An Optimal Diagonal Tree Code	1983	Seth Chaiken A. K. Dewdney Peter J. Slater
+ PDF Chat	‘Lassoing’ a phylogenetic tree I: basic properties, shellings, and covers	2011	Andreas Dress Katharina T. Huber Mike Steel