A faster FPT algorithm for the maximum agreement forest problem

Theory of Computing Systems

Volumn 41, Issue 3, 2007, Pages 539-550

  Hallett, Michael ^a   McCartin, Catherine ^b  

^a MCGILL UNIVERSITY   (Canada)

^b MASSEY UNIVERSITY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; FPT ALGORITHMS; LOW-ORDER POLYNOMIALS; MAXIMUM AGREEMENT FOREST PROBLEMS; PHYLOGENETIC TREES; RUNNING TIME; SUB TREES;

ALGORITHMS; FLUORINE; FORESTRY;

BIOINFORMATICS;

EID: 36849021471     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-1329-z     Document Type: Conference Paper

References (12)

1. Addario-Berry, L., Hallett, M., and Lagergren, J. (2003) Towards identifying lateral gene transfer events. Proceedings of the Pacific Symposium on Biocomputing 2003, Hawaii, January, pp. 279-290.
2. Allen, B., and Steel, M. (2000) Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics, 5, 1-13.
3. Baroni, M., Grunewald, S., Moulton, V., and Semple, C. (2005) Bounding the number of hybridisation events for a consistent evolutionary history. Journal of Mathematical Biology, 51, 171-182.
4. Bordewich, M., and Semple, C. (2004) On the complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics, 8, 409-423.
5. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., and Zhang, L. (1997) On distances between phylogenetic trees. Proceedings of the 8th Annual, ACM-SIAM Symposium on Discrete Algorithms, SODA '97, pp. 427-436.
6. DasGupta, B., He, X., Jiang, T., Li, M., Tromp, J., and Zhang, L. (1999) On the linear-cost subtreetransfer distance between phylogenetic trees. Algorithmica (special issue on computational biology) 25, 176-195.
7. Downey, R., and Fellows, M. (1999) Parameterized Complexity, Springer-Verlag, New York.
8. Hallett, M., and Lagergren, J. (2001) Efficient algorithms for lateral gene transfer problems. Proceedings of the 5th Annual RECOMB '01, Montreal, Canada, pp. 149-156.
9. Hein. J. (1993) A heuristic method to reconstruct the history of sequences subject to recombination. Journal of Molecular Evolution, 36, 396-405.
10. Hein, J., Jiang, T., Wang, L., and Zhang, K. (1995) On the complexity of comparing evolutionary trees. In Combinatorial Pattern Matching (CPM) '95, Lecture Notes in Computer Science 937, Springer, Berlin, pp. 177-190.
11. Hein, J., Jiang, T., Wang, L., and Zhang, K. (1996) On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71, 153-169.
12. Rodrigues, E. M., Sagot, M.-F., and Wakabayashi, Y. (2001) Some approximation results for the maximum agreement forest problem. In Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (APPROX and RANDOM 2001), Berkeley, California, USA, eds. Goemans, M., Jansen, K., Rolim, J. D. P., and Trevison, L., Lectures Notes in Computer Science 2129, Springer-Verlag, Berlin, pp. 159-169.