DNA physical mapping: Three ways difficult

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

Volumn 726 LNCS, Issue , 1993, Pages 157-168

  Fellows, Michael R ^a   Hallett, Michael T ^a   Wareham, H Todd ^b  

^a UNIVERSITY OF VICTORIA   (Canada)

^b MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MAPPING;

ALGORITHM DESIGN; ALGORITHMIC TECHNIQUES; BOUNDED TREEWIDTH; COMBINATORIAL PROBLEM; COMPLEXITY ANALYSIS; CONCEPTUAL FRAMEWORKS; PARAMETERIZED COMPLEXITY; PHYSICAL MAPPING;

PARALLEL PROCESSING SYSTEMS;

EID: 85010136218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57273-2_52     Document Type: Conference Paper

References (14)

1. K. Abrahamson and M. Fellows. Finite automata, bounded treewidth and well-quasiordering. Proceedings of the AMS Summer Workshop on Graph Minors (Seattle, 1991), A.M.S. Contemporary Mathematics Series, to appear.
2. S. Arnborg, J. Lagergren, and D. Seese. Easy problems for tree-decomposable graphs. Algorithms, 12 (1991), 308-340.
3. H. L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (1993), 226-234.
4. H. L. Bodlaender, M. R. Fellows and T. Warnow. Two Strikes Against Perfect Phylogeny. In: W. Kuich (editor), Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP’92). Springer-Verlag, Berlin, Lecture Notes in Computer Science, volume 623, pp. 273-283.
5. L. Cai, J. Chen, R. Downey and M. Fellows. The Parameterized Complexity of Short Computation and Factorization. Technical Report, Department of Computer Science, University of Victoria, June 1993.
6. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990), 12-75.
7. R. G. Downey and M. R. Fellows. Fixed parameter intractability. Proceedings of the Seventh Annual IEEE Conference on Structure in Complexity Theory (1992), 36-49.
8. R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness II: on completeness for W[1]. To appear.
9. G. A. Evans. Combinatoric strategies for genome mapping. Bioassays 13 (1991), 39-44.
10. M. R. Fellows, M. T. Hallett and H. T. Wareham. The parameterized complexity of DNA physical mapping. Technical Report, Computer Science Department, University of Victoria, 1993.
11. M. R. Fellows and M. T. Hallett. Bandwidth is hard for W[1], Manuscript, July, 1993.
12. M. Golumbic, H. Kaplan and R. Shamir. On the complexity of DNA physical mapping. Technical Report 271/93, Tèi Aviv University, January 1993.
13. S. Kannan and T. Warnow. Triangulating three-colored graphs. Proceedings Second Annual ACM-SIAM Symposium on Discrete Algorithms (1991), 337-343. To appear, SIAM J. Discr. Math.
14. F. R. McMorris, T. Warnow, and T. Wimer. Triangulating vertex colored graphs. To appear, SIAM J. Discr. Math.