Pattern-matching for strings with short descriptions

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

Volumn 937, Issue , 1995, Pages 205-214

  Karpinski, Marek ^a   Rytter, Wojciech ^a,b   Shinohara, Ayumi ^a,c  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957879924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60044-2_44     Document Type: Conference Paper

References (7)

1. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York (1994).
2. M. Farach and M. Thorup, "String-matching in Lempel-Ziv compressed strings", to appear in Proc. 27th ACM STOC (1995).
3. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979).
4. R.M. Karp, "Reducibility among combinatoriM problems", in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plemum Press, New York, pp.85-103 (1972).
5. D. Knuth, The Art of Computing, Vol. II: Seminumerical Algorithms. Second edition. Addison-Wesley (1981).
6. M. Lothaire, Combinatorics on Words. Addison-Wesley (1993).
7. W. Plandowski, "Testing equivalence of morphisms on context-free languages", ESA'94, Lecture Notes in Computer Science 855, Springer-Verlag, 460-470 (1994).