Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)

DOI10.1007/978-3-319-67428-5_12zbMath1454.92022arXiv1705.05295OpenAlexW2752773495MaRDI QIDQ5150927

No author found.

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.05295

zbMATH Keywords

approximation algorithmcomputational biologyphylogeneticsparameterized algorithmconsensus treesleaf deletion

Mathematics Subject Classification ID

Problems related to evolution (92D15) Approximation algorithms (68W25)

Uses Software

• FastRFS
• TERA

Cites Work

• Unnamed Item
• Kernel and fast algorithm for dense triplet inconsistency
• New results on optimizing rooted triplets consistency
• An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
• Algorithms on Strings, Trees and Sequences
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs
• Fixed-Parameter Algorithms for Finding Agreement Supertrees
• Fast Compatibility Testing for Rooted Phylogenetic Trees

This page was built for publication: Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)