The problem of context sensitive string matching

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

Volumn 2373, Issue , 2002, Pages 64-75

  Chakaravarthy, Venkatesan T ^a   Krishnamurthy, Rajasekar ^a  

^a University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MAPPING; PATTERN MATCHING;

CONTEXT SENSITIVE; NP COMPLETE; STRING MATCHING;

APPROXIMATION ALGORITHMS;

EID: 84937423406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_7     Document Type: Conference Paper

References (17)

1. P. Alimonti and V. Kann. Hardness of approximating problems on cubic graphs. In Proc. 3rd Italian Conf. on Algorithms and Complexity, Lecture Notes in Computer Science, 1203, pages 288–298. Springer-Verlag, 1997.
2. A. Amir, Y. Aumann, G. Landau, M. Lewenstein, and N. Lewenstein. Pattern matching with swaps. In Proc. 38th IEEE Conf. on Foundations of Computer Science (FOCS), pages 144–153, 1997.
3. A. Amir, R. Cole, R. Hariharan, M. Lewenstein, and E. Porat. Overlap matching. In Proceeding of the Twelfth Annual Symposium on Discrete algorithms (SODA), pages 279–288, 2001.
4. D. Angluin. Finding patterns common to a set of strings. In Journal of Computer and Systems Sciences, volume 21, pages 46–62, 1980.
5. A. Apostolico and Z. Galil (eds.). Pattern Matching Algorithms. Oxford Univ. Press, 1997.
6. M. Crochemore and W. Rytter. Text Algorithms. Oxford Univ. Press, 1994.
7. J. Dassow, Gh. Paun, and A. Salomaa. Grammars based on patterns. In Intl. Journal on Foundations of Computer Science, volume 4, pages 1–14, 1993.
8. M.J. Fischer and M.S. Paterson. String matching and other products. In Complexity of Computation, SIAM-AMS Proceedings, pages 7:113–125, 1974.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
10. C. Heitsch. Computational Complexity of Generalized Pattern Matching. Ph.D thesis, Dept. of Math., Univ. of California at Berkeley, 2000.
11. T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Decision problems for patterns. In Journal of Computer and Systems Sciences, volume 50, pages 53–63, 1995.
12. M. Karpinski. Approximating bounded degree instances of NP-Hard problems. In Electronic Colloquium on Computational Complexity, ECCC Report TR01-042, 2001.
13. M. Lothaire. Combinatorics on Words. Addison-Wesley, 1983.
14. V. Mitrana, Gh. Paun, G. Rozenberg, and A. Salomaa. Patttern systems. In The oretical Computer Science, volume 154, pages 183–201, 1996.
15. E. Ohlebusch and E. Ukkonen. On the equivalence problem for e-pattern languages. In The oretical Computer Science, volume 186, pages 231–248, 1997.
16. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
17. A. I. Zimin. Blocking sets of terms. In Math. Sbornik, volume 119, pages 363–375, 1982.