Algorithms for Finding Patterns in Strings
- 1 January 1990
- book chapter
- Published by Elsevier BV
Abstract
No abstract availableThis publication has 100 references indexed in Scilit:
- Remark on the HSUDU new algorithm for the longest common subsequence problemInformation Processing Letters, 1987
- From regular expressions to deterministic automataTheoretical Computer Science, 1986
- String-matching cannot be done by a two-head one-way deterministic finite automatonInformation Processing Letters, 1986
- RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIMEMathematics of the USSR-Izvestiya, 1985
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- Detection of periodicities and string-matching in real timeJournal of Mathematical Sciences, 1983
- Storing a sparse tableCommunications of the ACM, 1979
- An information-theoretic lower bound for the longest common subsequence problemInformation Processing Letters, 1978
- Real-time recognition of substring repetition and reversalTheory of Computing Systems, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977