Some approximation results for the maximum agreement forest problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2129, Issue , 2015, Pages 159-169

  Maris Rodrigues, Estela ^a   Sagot, Marie France ^b   Wakabayashi, Yoshiko ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b INSTITUT PASTEUR   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BREEDER REACTORS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; FORESTRY; OPTIMIZATION; RANDOM PROCESSES;

APPROXIMATION RATIOS; APPROXIMATION RESULTS; EDGE CONTRACTIONS; MAXIMUM AGREEMENT FOREST PROBLEMS; NUMBER OF COMPONENTS; PERFORMANCE RATIO; PHYLOGENETIC TREES; S-ALGORITHMS;

APPROXIMATION ALGORITHMS;

DATA; FORESTS; PROBLEM SOLVING;

EID: 84923082288     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (5)

1. B. Allen and M. Steel. Subtree transfer operations and their induced metrics on evolutionary trees. Submitted to the Annals of Combinatorics, 2001.
2. B. dasGupta, X. He, T. Jiang, M. Li, J. Tromp, and L. Zhang. On distances between phylogenetic trees. In Proceedings of the 8th ACM-SIAM Symposium of Discrete Algorithms, pages 427–436, 1997.
3. J. Hein, T. Jiang, L. Wang, and K. Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71:153–169, 1996.
4. M. Li, J. Tromp, and L. Zhang. On the nearest neighbor interchange distance between evolutionary trees. Journal on Theoretical Biology, 182(4):463–467, 1996.
5. D. L. Swofford, G. J. Olsen, P. J. Waddell, and D. H. Hillis. Phylogenetic inference. In D. Hillis, C. Moritz, and B. Mable, editors, Molecular Systematics, pages 407–513. Sinauer Associates, 1996.