Analogs and duals of the MAST problem for sequences and trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1461 LNCS, Issue , 1998, Pages 103-114

  Fellows, Michael ^a   Hallett, Michael ^b   Korostensky, Chantal ^b   Stege, Ulrike ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

GENES; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

FEEDBACK VERTEX SET; FIXED-PARAMETER TRACTABILITY; GENE DUPLICATIONS; LONGEST COMMON SUBSEQUENCES; MAXIMUM AGREEMENT SUBTREES; PARAMETERIZED COMPLEXITY; PHYLOGENETIC TREES; SHORTEST COMMON SUPERSEQUENCE;

BINARY TREES;

EID: 84896746389     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-68530-8_9     Document Type: Conference Paper

References (17)

1. D. Bryant. "Building Trees, Hunting for Trees, and Comparing Trees - Theory and Methods in Phylogenetic Analysis," Ph.D. Thesis. Department of Mathematics. University of Canterbury, 1997.
2. P. Buneman. "The Recovery of Trees from Measures of Dissimilarity," In F. R. Hodson, D. G. Kendall, P. Tautu, editors, Mathematics in the Archaeological and Historical Sciences, pp. 387-395. Edinburg University Press, Edinburgh, 1971.
3. R. Downey and M. Fellows. "Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W-Hierarchy," in: K. Ambos-Spies, S. Homer and U. Schöning, editors, Complexity Theory: Current Research, Cambridge Univ. Press (1993), 166-191.
4. R. G. Downey and M. R. Fellows. "Fixed Parameter Tractability and Completeness I: Basic Theory," SIAM Journal of Computing 24 (1995), 873-921.
5. R. G. Downey and M. R. Fellows. "Fixed Parameter Tractability and Completeness II: Completeness for W[1]," Theoretical Computer Science A 141 (1995), 109-131.
6. R. G. Downey and M. R. Fellows. "Parametrized Computational Feasibility," in: Feasible Mathematics II, P. Clote and J. Remmel (eds.) Birkhauser, Boston (1995) 219-244.
7. R. G. Downey and M. R. Fellows. Parameterized Complexity, Springer-Verlag, 1998.
8. M. Farach, T. Przytycka, and M. Thorup. "On the agreement of many trees" Information Processing Letters 55 (1995), 297-301.
9. M. R. Fellows, M. T. Hallett, C. Korostensky, U. Stege. "The complexity of problems on sequences and trees." Technical Report, ETH-Zurich, 1998.
10. M. R. Garey and D. S. Johnson. "Computers and Intractability: A Guide to the Theory of NP-Completeness," W. H. Freeman, San Francisco, 1979.
11. M. Goodman, J. Czelusniak, G. W. Moore, A. E. Romero-Herrera and G. Matsuda. "Fitting the Gene Lineage into its Species Lineage: A parsimony strategy illustrated by cladograms constructed from globin sequences," Syst. Zool. (1979), 28, 132-163.
12. R. Guigó, I. Muchnik, and T. F. Smith. "Reconstruction of Ancient Molecular Phylogeny," Molecular Phylogenetics and Evolution (1996), 6: 2, 189-213.
13. B. Ma, M. Li, and L. Zhang. "On Reconstructing Species Trees from Gene Trees in Term of Duplications and Losses," Recomb 98, to appear.
14. D. Maier. "The Complexity of Some Problems on Subsequences and Superse-quences," J. ACM, 25, 2 (1978), 322-336.
15. R. D. M. Page. "Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas," Syst. Biol. 43 (1994), 58-77.
16. T. Przytycka. private communication, 1997.
17. L. Zhang. "On a Mirkin-Muchnik-Smith Conjecture for Comparing Molecular Phylogenies," Journal of Computational Biology (1997) 4: 2, 177-187.