Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks-Reference-Cited by-同舟云学术

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

Published:2010-03 Issue:1 Volume:8 Page:65-75
ISSN:1570-8667
Container-title:Journal of Discrete Algorithms
language:en
Short-container-title:Journal of Discrete Algorithms

Author:

Byrka Jaroslaw,Gawrychowski Pawel,Huber Katharina T.,Kelk Steven

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference27 articles.

1. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions;Aho;SIAM Journal on Computing,1981

2. A framework for representing reticulate evolution;Baroni;Annals of Combinatorics,2004

3. Phylogenetic supertrees: Combining information to reveal the tree of life;Bininda-Emonds,2004

4. D. Bryant, Building trees, hunting for trees, and comparing trees: Theory and methods in phylogenetic analysis, Ph.D. thesis, University of Canterbury, Christchurch, New Zealand, 1997

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Building a small and informative phylogenetic supertree;Information and Computation;2023-10

2. Computing the Rooted Triplet Distance Between Phylogenetic Networks;Algorithmica;2021-03-16

3. CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem;IRAN J BIOTECHNOL;2020

4. The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets;Discrete Applied Mathematics;2019-03

5. Computing the Rooted Triplet Distance Between Phylogenetic Networks;Lecture Notes in Computer Science;2019