Approximating the Maximum Agreement Forest on k trees

Information Processing Letters

Volumn 93, Issue 5, 2005, Pages 239-244

  Chataigner, Frédéric ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Approximation algorithms; Computational complexity

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS; BINARY TREES; LARGEST COMMON SUBFOREST; MAXIMUM AGREEMENT FOREST PROBLEM (MAF);

TREES (MATHEMATICS);

EID: 12244299880     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.11.004     Document Type: Article

References (5)

1. B.L. Allen, and M. Steel Subtree transfer operations and their induced metrics on evolutionary trees Ann. Combin. 5 2001 1 13
2. N. Garg, V.V. Vazirani, and M. Yannakakis Approximate max-floor min-(multi)cut theorems and their applications SIAM J. Comput. 25 1996 235 251
3. J. Hein A heuristic method to reconstruct the history of sequences subject to recombination J. Mol. Evol. 32 1993 369 405
4. J. Hein, T. Jiang, L. Wang, and K. Zhang On the complexity of comparing evolutionary trees Discrete Appl. Math. 71 1996 153 169
5. E.M. Rodrigues, M.F. Sagot, and Y. Wakabayashi Some Approximation Results for the Maximum Agreement Forest Problem Lecture Notes in Comput. Sci. vol. 2129 2001 Springer Berlin 159 163