Analogs & duals of the MAST problem for sequences & trees

Journal of Algorithms

Volumn 49, Issue 1, 2003, Pages 192-216

  Fellows, Michael ^a   Hallett, Michael ^b   Stege, Ulrike ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b MCGILL UNIVERSITY   (Canada)

^c UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING; TOPOLOGY;

DIRECTED FEEDBACK VERTEX SET; MAXIMUM AGREEMENT SUBTREE; SMALLEST COMMON SUPERTREE;

TREES (MATHEMATICS);

EID: 0242583637     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(03)00081-6     Document Type: Article

References (26)

1. A.V. Aho, J.D. Ullman, Foundations of Computer Science, Freeman, 1992.
2. H. Bodlaender, R. Downey, M. Fellows, M. Hallett, H.T. Wareham, Parameterized complexity analysis in computational biology, Comput. Appl. Biosci. 11 (1995) 49-57.
3. H. Bodlaender, R. Downey, M. Fellows, H.T. Wareham, The parameterized complexity of the longest common subsequence problem, Theoret. Comput. Sci. A 147 (1995) 31-54.
4. D. Bryant, Building trees, hunting for trees, and comparing trees-theory and methods in phylogenetic analysis, PhD thesis, Department of Mathematics, University of Canterbury, 1997.
5. P. Buneman, The recovery of trees from measures of dissimilarity, in: F.R. Hodson, D.G. Kendall, P. Tautu (Eds.), Mathematics in the Archaeological and Historical Sciences, Edinburg Univ. Press, Edinburgh, 1971, pp. 387-395.
6. L. Cai, J. Chen, R. Downey, M. Fellows, The parameterized complexity of short computation and factorization, Arch. Math. Logic 36 (1997) 321-337.
7. J. Chen, I.A. Kanj, W. Jia, Vertex cover: further observations and further improvements, J. Algorithms 41 (2001) 280-301.
8. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness I: basic theory, SIAM J. Comput. 24 (1995) 873-921.
9. R.G. Downey, M.R. Fellows, Fixed parameter tractability and completeness II: completeness for W[1], Theoret. Comput. Sci. A 141 (1995) 109-131.
10. R.G. Downey, M.R. Fellows, Parameterized computational feasibility, in: P. Clote, J. Remmel (Eds.), Feasible Mathematics II, Birkhäuser, Boston, 1995, pp. 219-244.
11. R.G. Downey, M.R. Fellows, Parameterized Complexity, Springer-Verlag, 1998.
12. R.G. Downey, M.R. Fellows, U. Stege, Parameterized complexity: a framework for systematically confronting computational intractability, in: F. Roberts, J. Kratochvil, J. Nešetřil (Eds.), The Future of Discrete Mathematics: Proceedings of the First DIMATIA Symposium, Stirin Castle, Czech Republic, June, 1997, in: AMS-DIMACS Proc. Ser., 1999, in print.
13. F. Dehne, A. Rau-Chaplin, U. Stege, P.J. Taillon, Solving large FPT problems on coarse grained parallel machines, Manuscript, 2001.
14. M. Farach, T. Przytycka, M. Thorup, On the agreement of many trees, Inform. Process. Lett. 55 (1995) 297-301.
15. M. Fellows, M. Hallett, U. Stege, On the multiple gene duplication problem, Algorithms and Computation, in: 9th International Symposium, ISAAC '98, in: Lecture Notes in Comput. Sci., Vol. 1533, 1998, pp. 347-356.
16. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
17. M. Goodman, J. Czelusniak, G.W. Moore, A.E. Romero-Herrera, G. Matsuda, Fitting the gene lineage into its species lineage: a parsimony strategy illustrated by cladograms constructed from globin sequences, Syst. Zool. 28 (1979) 132-163.
18. B. Ma, M. Li, L. Zhang, On reconstructing species trees from gene trees in term of duplications and losses, Recomb 98, in preparation.
19. D. Maier, The complexity of some problems on subsequences and supersequences, J. ACM 25 (2) (1978) 322-336.
20. M. Middendorf, Zur Komplexität von Einbettungsproblemen von Wortmengen, Dissertation, Fachbereich Mathematik, Universität Hannover, 1992.
21. R.D.M. Page, Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas, Syst. Biol. 43 (1994) 58-77.
22. T. Przytycka, Private communication, 1997.
23. U. Stege, Resolving conflicts in problems in computational biochemistry, PhD Dissertation ETH, Zurich, 2000.
24. U. Stege, M. Fellows, An improved fixed-parameter tractable algorithm for vertex cover, Tech. Rep., ETH Zurich, 1999.
25. V.G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Cybernetics 25 (1990) 1-13.
26. R.A. Wagner, M.J. Fischer, The string-to-string correction problem, J. Assoc. Comput. Mach. 21 (1974) 168-173.