
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sylvain Guillemot, Vincent Berry, "FixedParameter Tractability of the Maximum Agreement Supertree Problem," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 2, pp. 342353, AprilJune, 2010.  
BibTex  x  
@article{ 10.1109/TCBB.2008.93, author = {Sylvain Guillemot and Vincent Berry}, title = {FixedParameter Tractability of the Maximum Agreement Supertree Problem}, journal ={IEEE/ACM Transactions on Computational Biology and Bioinformatics}, volume = {7}, number = {2}, issn = {15455963}, year = {2010}, pages = {342353}, doi = {http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.93}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE/ACM Transactions on Computational Biology and Bioinformatics TI  FixedParameter Tractability of the Maximum Agreement Supertree Problem IS  2 SN  15455963 SP342 EP353 EPD  342353 A1  Sylvain Guillemot, A1  Vincent Berry, PY  2010 KW  Phylogenetics KW  maximum agreement supertree KW  parameterized complexity KW  algorithms KW  reductions KW  rooted triples. VL  7 JA  IEEE/ACM Transactions on Computational Biology and Bioinformatics ER   
[1] A.V. Aho, Y. Sagiv, T.G. Szymanski, and J.D. Ullman, "Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions," SIAM J. Computing, vol. 10, no. 3, pp. 405421, 1981.
[2] Y. Xia and Y. Yang, "Mining Closed and Maximal Frequent Subtrees from Databases of Labeled Rooted Trees," IEEE Trans. Knowledge and Data Eng., vol. 17, no. 2, pp. 190202, Feb. 2005.
[3] B.R. Baum, "Combining Trees as a Way of Combining Data Sets for Phylogenetic Inference, and the Desirability of Combining Gene Trees," Taxon, vol. 41, pp. 310, 1992.
[4] M. Ragan, "Matrix Representation in Reconstructing Phylogenetic Relationships among the Eukaryotes," Biosystems, vol. 28, no. 13, pp. 4755, 1992.
[5] V. Daubin, M. Gouy, and G. Perrière, "A Phylogenomic Approach to Bacterial Phylogeny: Evidence of a Core of Genes Sharing a Common History," Genome Research, vol. 12, no. 7, pp. 10801090, 2002.
[6] J. Jansson, J.H.K. Ng, K. Sadakane, and W.K. Sung, "Rooted Maximum Agreement Supertrees," Algorithmica, vol. 43, no. 4, pp. 293307, 2005.
[7] V. Berry and F. Nicolas, "Maximum Agreement and Compatible Supertrees," J. Discrete Algorithms, vol. 5, no. 3, pp. 564591, 2007.
[8] M.Y. Kao, "Encyclopedia of Algorithms," http://refworks. springer.comalgorithms/, 2007.
[9] F.J. Lapointe and L.J. Rissler, "Congruence, Consensus and the Comparative Phylogeography of Codistributed Species in California," Am. Naturalist, vol. 166, no. 2, pp. 290299, 2005.
[10] D.M. de Vienne, T. Giraud, and O.C. Martin, "A Congruency Index for Testing Topological Similarity between Trees," Bioinformatics, vol. 23, no. 23, pp. 31193124, 2007.
[11] E. Jousselin, S. van Noort, V. Berry, J.Y. Rasplus, N. Ronsted, J. Erasmus, and J. Greeff, "One Fig to Bind Them All: Host Conservatism in a Fig Wasp Community Unraveled by Cospeciation Analyses among Pollinating and Nonpollinating Fig Wasps," Evolution, 2008.
[12] F. Ge, L.S. Wang, and J. Kim, "The Cobweb of Life Revealed by GenomeScale Estimates of Horizontal Gene Transfer," PLOS Biology, vol. 3, no. 10, pp. 17091718, 2005.
[13] L. Nakhleh, D. Ruths, and L.S. Wang, "RIATAHGT: A Fast and Accurate Heuristic for Reconstructing HorizontalGene Transfer," Proc. 11th Ann. Int'l Conf. Computing and Combinatorics (COCOON '05), L. Wang, ed., pp. 8493, 2005.
[14] R. Downey and M. Fellows, Parameterized Complexity. SpringerVerlag, 1999.
[15] J. Flum and M. Grohe, Parameterized Complexity Theory. SpringerVerlag, 2006.
[16] R. Agarwala and D. FernandezBaca, "A Polynomial Time Algorithm for the Perfect Phylogeny Problem When the Number of Character States Is Fixed," SIAM J. Computing, vol. 23, pp. 12161224, 1994.
[17] A. Amir and D. Keselman, "Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithm," SIAM J. Computing, vol. 26, no. 6, pp. 16561669, 1997.
[18] M. Farach, T.M. Przytycka, and M. Thorup, "On the Agreement of Many Trees," Information Processing Letters, vol. 55, no. 6, pp. 297301, 1995.
[19] D. Bryant, "Building Trees, Hunting for Trees and Comparing Trees: Theory and Method in Phylogenetic Analysis," PhD thesis, Dept. Math., Univ. of Canterbury, 1997.
[20] R.G. Downey, M.R. Fellows, and U. Stege, "Computational Tractability: The View from Mars," Bull. European Assoc. Theoretical Computer Science, vol. 69, pp. 7397, 1999.
[21] V. Berry and F. Nicolas, "Improved Parametrized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems," IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 3, no. 3, pp. 289302, JulySept. 2006.
[22] S. Guillemot and F. Nicolas, "Parameterized Complexity of the MAST and MCT Problems," technical report, LIRMM, Univ. of Montpellier 2 (extended version of the CPM '06 paper), 2007.
[23] M. Henzinger, V. King, and T. Warnow, "Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology," Algorithmica, vol. 24, no. 1, pp. 113, 1999.
[24] M. Steel and T. Warnow, "Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree," Information Processing Letters, vol. 48, no. 2, pp. 7782, 1993.
[25] V. Hoang and W.K. Sung, "Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees," Proc. 25th Ann. Symp. Theoretical Aspects of Computer Science (STACS '08), pp. 361372, 2008.
[26] H. Bandelt and A. Dress, "Reconstructing the Shape of a Tree from Observed Dissimilarity Data," Advances in Applied Math., vol. 7, pp. 309343, 1986.
[27] H. Fernau, Parameterized Algorithmics: A GraphTheoretic Approach. Habilitationsschrift, Univ. Tübingen, 2005.
[28] J. Gramm and R. Niedermeier, "A FixedParameter Algorithm for Minimum Quartet Inconsistency," J. Computer and System Sciences, vol. 67, no. 4, pp. 723741, 2003.
[29] Y. Chen, J. Flum, and M. Grohe, "Bounded Nondeterminism and Alternation in Parameterized Complexity Theory," Proc. 18th Ann. IEEE Conf. Computational Complexity (CCC '03), pp. 1329, 2003.
[30] S. Guillemot, "Parameterized Complexity and Approximability of the SLCS Problem," Proc. Int'l Workshop Parameterized and Exact Computation (IWPEC '08), M. Grohe, R. Niedermeier, eds., pp. 115128, 2008.
[31] M. Fellows, M. Hallett, and U. Stege, "Analogs and Duals of the MAST Problem for Sequences and Trees," J. Algorithms, vol. 49, no. 1, pp. 192216, 2003.