On the parameterized intractability of CLOSEST SUBSTRING and related problems

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

Volumn 2285, Issue , 2002, Pages 262-273

  Fellows, Michael R ^a   Gramm, Jens ^b   Niedermeier, Rolf ^b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HARDNESS;

BINARY ALPHABETS; BIOLOGICAL SEQUENCE ANALYSIS; CLOSEST STRING; COMPUTATIONAL BIOLOGY; CONSENSUS PATTERNS; HARDNESS RESULT; PARAMETERIZED; POLYNOMIAL TIME APPROXIMATION SCHEMES;

POLYNOMIAL APPROXIMATION;

EID: 84937415926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_21     Document Type: Conference Paper

References (16)

1. M. Blanchette. Algorithms for phylogenetic footprinting. In Proc. of 5th ACM RECOMB, pages 49–58, 2001, ACM Press.
2. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science, 147:31–54, 1995.
3. H. L. Bodlaender, R. G. Downey, M. R. Fellows, M. T. Hallett, and H. T. Ware-ham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11: 49–57, 1995.
4. M. Cesati and L. Trevisan. On the efficiency of polynomial time approximation schemes. Information Processing Letters, 64(4):165–171, 1997.
5. R. G. Downey and M. R. Fellows. ParameterizedComplexity. Springer. 1999.
6. P. A. Evans and H. T. Wareham. Practical non-polynomial time algorithms for designing universal DNAoligonucleotides: a systematic approach. Manuscript, April 2001.
7. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113–119, 1997.
8. J. Gramm, R. Niedermeier, and P. Rossmanith. Exact solutions for Closest String and related problems. To appear in Proc. of 12th ISAAC (Christchurch, New Zealand), LNCS, December 2001. Springer.
9. M. T. Hallett. An IntegratedComplexity Analysis of Problems from Computational Biology. PhD Thesis, University of Victoria, Canada, 1996.
10. J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. In Proc. of 10th ACM-SIAM SODA, pages 633–642, 1999, ACM Press. To appear in Information andComputation.
11. M. Li, B. Ma, and L. Wang. Finding similar regions in many strings. In Proc. of 31st ACM STOC, pages 473-482, 1999. ACM Press. To appear in Journal of Computer andSystem Sciences.
12. B. Ma. Apolynomial time approximation scheme for the closest substring problem. In Proc. of 11th CPM, number 1848 in LNCS, pages 99–107, 2000. Springer.
13. P. A. Pevzner. Computational Molecular Biology - An Algorithmic Approach. MIT Press. 2000.
14. P. A. Pevzner and S.-H. Sze. Combinatorial approaches to finding subtle signals in DNAsequences. In Proc. of 8th ISMB, pages 269–278, 2000. AAAI Press.
15. M.-F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. In Proc. of 3rdLATIN, number 1380 in LNCS, pages 111–127, 1998. Springer.
16. D. Sankoff and J. Kruskal (eds.). Time Warps, String Edits, and Macromolecules. Addison-Wesley. 1983. Reprinted in 1999 by CSLI Publications.