scientific article; zbMATH DE number 7564377
From MaRDI portal
Publication:5091725
DOI10.4230/LIPIcs.WABI.2019.1zbMath1495.92046MaRDI QIDQ5091725
Jesper Jansson, Konstantinos Mampentzidis, T. P. Sandhya
Publication date: 27 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New results on optimizing rooted triplets consistency
- Rooted maximum agreement supertrees
- On the complexity of constructing evolutionary trees
- New local search approximation techniques for maximum generalized satisfiability problems
- Parallel approximation algorithms by positive linear programming
- Distributions of cherries for two models of trees
- Constructing the maximum consensus tree from rooted Triples
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree
- The Design of Approximation Algorithms
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- Some optimal inapproximability results
- Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree
This page was built for publication:
