Fixed-parameter algorithms for maximum agreement forests

SIAM Journal on Computing

Volumn 42, Issue 4, 2013, Pages 1431-1466

  Whidden, Chris ^a   Beiko, Robert G ^a   Zeh, Norbert ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Agreement forest; Fixed parameter tractability; Hybridization; Lateral gene transfer; Phylogenetics; Subtree prune and regraft distance

Indexed keywords

FIXED-PARAMETER TRACTABILITY; HYBRIDIZATION; LATERAL GENE TRANSFERS; PHYLOGENETICS; SUB TREES;

ALGORITHMS; FORESTRY; GENE TRANSFER;

PARAMETER ESTIMATION;

ALGORITHMS; FORESTRY;

EID: 84884945088     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110845045     Document Type: Article

References (35)

1. B. L. ALLEN and M. STEEL, Subtree transfer operations and their induced metrics on evolutionary trees, Ann. Comb., 5 (2001), pp. 1-15.
2. M. BARONI, S. GRÜNEWALD, V. MOULTON, and C. SEMPLE, Bounding the number of hybridisation events for a consistent evolutionary history, J. Math. Biol., 51 (2005), pp. 171-182. (Pubitemid 41040209)
3. R. G. BEIKO and N. HAMILTON, Phylogenetic identification of lateral genetic transfer events, BMC Evolutionary Biol., 6 (2006), p. 15.
4. M. L. BONET and K. ST. JOHN, Efficiently calculating evolutionary tree measures using SAT, in Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing, Lecture Notes in Comput. Sci. 5584, Springer-Verlag, Berlin, 2009, pp. 4-17.
5. M. L. BONET and K. ST. JOHN, On the complexity of uSPR distance, IEEE/ACM Trans. Comput. Biol. Bioinform., 7 (2010), pp. 572-576.
6. M. L. BONET, K. ST. JOHN, R. MAHINDRU, AND N. AMENTA, Approximating subtree distances between phylogenies, J. Comput. Biol., 13 (2006), pp. 1419-1434.
7. M. BORDEWICH, C. MCCARTIN, and C. SEMPLE, A 3-approximation algorithm for the subtree distance between phylogenies, J. Discrete Algorithms, 6 (2008), pp. 458-471.
8. M. BORDEWICH and C. SEMPLE, On the computational complexity of the rooted subtree prune and regraft distance, Ann. Comb., 8 (2005), pp. 409-423. (Pubitemid 40251118)
9. M. BORDEWICH and C. SEMPLE, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Trans. Comput. Biol. Bioinform., 4 (2007), pp. 458-466. (Pubitemid 47274721)
10. M. BORDEWICH and C. SEMPLE, Computing the minimum number of hybridization events for a consistent evolutionary history, Discrete Appl. Math., 155 (2007), pp. 914-928. (Pubitemid 46436152)
11. F. CHATAIGNER, Approximating the maximum agreement forest on k trees, Inform. Process. Lett., 93 (2005), pp. 239-244. (Pubitemid 40114670)
12. Z.-Z. CHEN and L. WANG, Algorithms for reticulate networks of multiple phylogenetic trees, IEEE/ACM Trans. Comput. Biol. Bioinform., 9 (2012), pp. 372-384.
13. W. H. E. DAY, Optimal algorithms for comparing trees with labeled leaves, J. Classification, 2 (1985), pp. 7-28.
14. M. HALLETT and C. MCCARTIN, A faster FPT algorithm for the maximum agreement forest problem, Theory Comput. Syst., 41 (2007), pp. 539-550.
15. M. T. HALLETT and J. LAGERGREN, Efficient algorithms for lateral gene transfer problems, in Proceedings of the 5th Annual International Conference on Computational Biology, ACM New York, 2001, pp. 149-156. (Pubitemid 32866153)
16. J. HEIN, T. JIANG, L. WANG, and K. ZHANG, On the complexity of comparing evolutionary trees, Discrete Appl. Math., 71 (1996), pp. 153-169. (Pubitemid 126391777)
17. G. HICKEY, F. DEHNE, A. RAU-CHAPLIN, and C. BLOUIN, The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance, Technical report CS-2006-06, Faculty of Computer Science, Dalhousie University, 2006.
18. G. HICKEY, F. DEHNE, A. RAU-CHAPLIN, and C. BLOUIN, SPR distance computation for unrooted trees, Evolutionary Bioinform., 4 (2008), pp. 17-27. (Pubitemid 351419609)
19. D. M. HILLIS, C. MORITZ, and B. K. MABLE, EDS., Molecular Systematics, Sinauer Associates, Sunderland, MA, 1996.
20. S. KELK, L. VAN IERSEL, N. LEKIC, S. LINZ, C. SCORNAVACCA, and L. STOUGIE, Cycle Killer⋯ qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set, Preprint, arXiv:1112.5359, 2011.
21. S. LINZ and C. SEMPLE, Hybridization in nonbinary trees, IEEE/ACM Trans. Comput. Biol. Bioinform., 6 (2009), pp. 30-45.
22. D. MACLEOD, R. L. CHARLEBOIS, F. DOOLITTLE, and E. BAPTESTE, Deduction of probable events of lateral gene transfer through comparison of phylogenetic trees by recursive consolidation and rearrangement, BMC Evolutionary Biol., 5 (2005), p. 27.
23. W. P. MADDISON, Gene trees in species trees, System. Biol., 46 (1997), pp. 523-536.
24. L. NAKHLEH, D. A. RUTHS, and L.-S. WANG, RIATA-HGT: A fast and accurate heuristic for reconstructing horizontal gene transfer, in Proceedings of the 11th International Conference on Computing and Combinatorics, Lecture Notes in Comput. Sci. 3595, Springer-Verlag, Berlin, 2005, pp. 84-93. (Pubitemid 41450189)
25. L. NAKHLEH, T. WARNOW, C. R. LINDNER, and K. ST. JOHN, Reconstructing reticulate evolution in species-theory and practice, J. Comput. Biol., 12 (2005), pp. 796-811. (Pubitemid 41170482)
26. D. F. ROBINSON and L. R. FOULDS, Comparison of phylogenetic trees, Math. Biosci., 53 (1981), pp. 131-147. (Pubitemid 11129084)
27. E. M. RODRIGUES, M.-F. SAGOT, and Y. WAKABAYASHI, The maximum agreement forest problem: Approximation algorithms and computational experiments, Theoret. Comput. Sci., 374 (2007), pp. 91-110. (Pubitemid 46452973)
28. V. ROSAS-MAGALLANES, P. DESCHAVANNE, L. QUINTANA-MURCI, R. BROSCH, B. GICQUEL, and O. NEYROLLES, Horizontal transfer of a virulence operon to the ancestor of mycobacterium tuberculosis, Molecular Biol. Evolution, 23 (2006), pp. 1129-1135. (Pubitemid 43781588)
29. C. WHIDDEN, rSPR FPT Software, http://www.cs.dal.ca/~whidden.
30. C. WHIDDEN, A Unifying View on Approximation and FPT of Agreement Forests, MS thesis, Dalhousie University, Halifax, NS, 2009.
31. C. WHIDDEN, R. G. BEIKO, and N. ZEH, Fast FPT algorithms for computing rooted agreement forests: Theory and experiments, in Proceedings of the 9th International Symposium on Experimental Algorithms, Lecture Notes in Comput. Sci. 6049, Springer-Verlag, Berlin, 2010, pp. 141-153.
32. C. WHIDDEN, R. G. BEIKO, and N. ZEH, Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests, Preprint, arXiv:1108.2664, 2011.
33. C. WHIDDEN and N. ZEH, A unifying view on approximation and FPT of agreement forests, in Proceedings of the 9th International Workshop, Lecture Notes in Bioinformatics 5724, Springer-Verlag, Berlin, 2009, pp. 390-401.
34. Y. WU, A practical method for exact computation of subtree prune and regraft distance, Bioinformatics, 25 (2009), pp. 190-196.
35. Y. WU and J. WANG, Fast computation of the exact hybridization number of two phylogenetic trees, Bioinformatics Research Appl., (2010), pp. 203-214.