Hard problems in similarity searching

Discrete Applied Mathematics

Volumn 144, Issue 1-2, 2004, Pages 213-227

  Moan, Christophe ^a   Rusu, Irena ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

NP complexity; Parameterized complexity

Indexed keywords

ALGORITHMS; BIOLOGY; DNA; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

BINDING SITES; COCATENATION; COMPUTATIONAL BIOLOGY; HAMMING DISTANCE;

PROBLEM SOLVING;

EID: 4544278737     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.06.003     Document Type: Article

References (14)

1. H.L. Bodlaender, M.R. Fellows, M.T. Hallett, H.T. Wareham, T.J. Warnow, The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs, Theoret. Comput. Sci. 244 (2000) 167-188.
2. R.G. Downey, M.R. Fellows, Parameterized Complexity, Monographs in Computer Science, Springer, New York, 1999.
3. P.A. Evans, A.D. Smith, Toward optimal motif enumeration, WADS' 2003.
4. P.A. Evans, A.D. Smith, H. Todd Wareham, On the complexity of finding common approximate substrings, Theoret. Comput. Sci. 306 (1-3) (2003) 407-430.
5. M.R. Fellows, J. Gramm, R. Niedermeier, On the parameterized intractability of CLOSEST SUBSTRING and Related Problems, Proceedings of STACS'02, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, 2002, pp. 262-273.
6. J. Gramm, R. Niedermeier, P. Rossmanith, Exact solutions for Closest String and related problems, Proceedings of ISAAC 2001, Lecture Notes in Computer Science, Vol. 2223, 2001, pp. 441-453.
7. http://arep.med.harvard.edu/ecoli_matrices/
8. http://members.aol.com/golomb20/
9. J.K. Lanctot, M. Li, B. Ma, S. Wang, L. Zhang, Distinguishing string selection problems, Proceedings of 10th SODA, 1999, pp. 633-642.
10. M. Li, B. Ma, L. Wang, Finding similar regions in many strings, Proceedings of 31st ACM STOC, 1999, pp. 473-482.
11. K. Robison, A.M. McGuire, G.M. Church, A comprehensive library for DNA-binding site matrices for 55 applied to the complete Escherichia coli K-12 genome, J. Mol. Biol. 284 (1998) 241-254.
12. M.-F. Sagot, Spelling approximate repeated or common motifs using a suffix tree, Latin '98, Lecture Notes in Computer Science, Vol. 1380, 1998, pp. 374-390.
13. G.D. Schuler, Sequence alignment and database searching, in: A.D. Baxevanis, B.F.F. Ouellette (Eds.), Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins, Wiley, New York, 2001, pp. 187-214.
14. M.S. Waterman, Consensus patterns in sequences, in: M.S. Waterman (Ed.), Mathematical Methods for DNA Sequences, CRC Press, Boca Raton, 1989, pp. 93-116.