CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2010 vol.7 Issue No.02 - April-June

Issue No.02 - April-June (2010 vol.7)

pp: 342-353

Sylvain Guillemot , LIRMM, CNRS, University of Montpellier, Montpellier

Vincent Berry , LIRMM, CNRS, University of Montpellier, Montpellier

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2008.93

ABSTRACT

HASH(0x295276c)

INDEX TERMS

Phylogenetics, maximum agreement supertree, parameterized complexity, algorithms, reductions, rooted triples.

CITATION

Sylvain Guillemot, Vincent Berry, "Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem",

*IEEE/ACM Transactions on Computational Biology and Bioinformatics*, vol.7, no. 2, pp. 342-353, April-June 2010, doi:10.1109/TCBB.2008.93REFERENCES

- [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. 405-421, 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. 190-202, 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. 3-10, 1992.- [4] M. Ragan, "Matrix Representation in Reconstructing Phylogenetic Relationships among the Eukaryotes,"
Biosystems, vol. 28, no. 1-3, pp. 47-55, 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. 1080-1090, 2002.- [6] J. Jansson, J.H.K. Ng, K. Sadakane, and W.K. Sung, "Rooted Maximum Agreement Supertrees,"
Algorithmica, vol. 43, no. 4, pp. 293-307, 2005.- [7] V. Berry and F. Nicolas, "Maximum Agreement and Compatible Supertrees,"
J. Discrete Algorithms, vol. 5, no. 3, pp. 564-591, 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. 290-299, 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. 3119-3124, 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 Genome-Scale Estimates of Horizontal Gene Transfer,"
PLOS Biology, vol. 3, no. 10, pp. 1709-1718, 2005.- [13] L. Nakhleh, D. Ruths, and L.S. Wang, "RIATA-HGT: A Fast and Accurate Heuristic for Reconstructing Horizontal-Gene Transfer,"
Proc. 11th Ann. Int'l Conf. Computing and Combinatorics (COCOON '05), L. Wang, ed., pp. 84-93, 2005.- [14] R. Downey and M. Fellows,
Parameterized Complexity. Springer-Verlag, 1999.- [15] J. Flum and M. Grohe,
Parameterized Complexity Theory. Springer-Verlag, 2006.- [16] R. Agarwala and D. Fernandez-Baca, "A Polynomial Time Algorithm for the Perfect Phylogeny Problem When the Number of Character States Is Fixed,"
SIAM J. Computing, vol. 23, pp. 1216-1224, 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. 1656-1669, 1997.- [18] M. Farach, T.M. Przytycka, and M. Thorup, "On the Agreement of Many Trees,"
Information Processing Letters, vol. 55, no. 6, pp. 297-301, 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. 73-97, 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. 289-302, July-Sept. 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. 1-13, 1999.- [24] M. Steel and T. Warnow, "Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree,"
Information Processing Letters, vol. 48, no. 2, pp. 77-82, 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. 361-372, 2008.- [26] H. Bandelt and A. Dress, "Reconstructing the Shape of a Tree from Observed Dissimilarity Data,"
Advances in Applied Math., vol. 7, pp. 309-343, 1986.- [27] H. Fernau,
Parameterized Algorithmics: A Graph-Theoretic Approach. Habilitationsschrift, Univ. Tübingen, 2005.- [28] J. Gramm and R. Niedermeier, "A Fixed-Parameter Algorithm for Minimum Quartet Inconsistency,"
J. Computer and System Sciences, vol. 67, no. 4, pp. 723-741, 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. 13-29, 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. 115-128, 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. 192-216, 2003. |