article

Free access

String Matching in Real Time

Author:

Zvi GalilAuthors Info & Claims

Journal of the ACM (JACM), Volume 28, Issue 1

Pages 134 - 149

https://doi.org/10.1145/322234.322244

Published: 01 January 1981 Publication History

PDF eReader

References

[1]

AHO, A.V., HOPCROET, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.

Crossref

Google Scholar

[2]

BAKER, T.P. An extended pattern matching algorithm applied to rectangular arrays. Unpublished manuscript, Computer Science Department, Cornell University, Ithaca, New York, August 1972.

Google Scholar

[3]

FISCHER, P.C., MEYER, A.R., AND ROSENBERG, A.L. Real-time simulation ofmultihead tape units. ~ ACM 19, 4 (Oct. 1972), 590-607.

Crossref

Google Scholar

[4]

FISCHER, M.J., AND PATERSON, i .S . String-matching and other products. Siam AMS Proe. on Complexity of Computation, R.M. Karp, Ed., American Mathematical Society, Providence, R.I., 1974, pp. 113-126.

Google Scholar

[5]

FREIDSON, R.1. A characterization of the complexity of recursive predicates. Proc. Steklov Inst. Math 113 (1970), 91-117.

Google Scholar

[6]

GALIL, Z. Real-time algorithms for string matching and palindrome recognition. Proc. 8th Ann. ACM Symp. on Theory of Computing, Hershey, Pa., May 1976, 161-173.

Crossref

Google Scholar

[7]

GALIL, Z. Palindrome recognition in real time. by multitape Turing machines. ~ Comput. Syst. Sci. 16, 2 (1978), 140-157.

Google Scholar

[8]

HARTMANIS, J., AND STEARNS, R.E. On the computation complexity of algorithms. Trans. Amer. Math. Soc. 117 (1965), 285-306.

Google Scholar

[9]

KNUTH, D.E., MORRIS, J.H., AND PRATT, V.R. Fast pattern matching in strings. SlAM J. Comput. 6, 2 (1977), 323-350.

Google Scholar

[10]

MANACHER, G. A new linear-time "on-line" algorithm for finding the smallest initial palindrome of a string.I. ACM 22, 3 (July 1975), 346-351.

Crossref

Google Scholar

[11]

MAT1JESEVIC, YU. V. Real-time recognition of the inclusion relation. ~ Soviet Math. 1, 1 (1973), 64- 70.

Google Scholar

[12]

MORRIS, J.H. JR., AND PRATT, V.R. A linear pattern matching algorithm. Tech. Rep. No. 40, Computing Center, University of California, Berkeley, Calif. June 1970.

Google Scholar

[13]

RABIN, M.O. Real-time computation. Israel J. Math. 1 (1963), 203-211.

Google Scholar

[14]

SLISENKO, A.O. Private communication, October 1976.

Google Scholar

[15]

TARJAN, R.E., AND YAO, A.C.-C. Storing a sparse table. Commun. ACM 22, II (Nov. 1979), 606- 611.

Crossref

Google Scholar

Cited By

View all

Kucherov GNekrich Y(2017)Full-Fledged Real-Time Indexing for Constant Size AlphabetsAlgorithmica10.1007/s00453-016-0199-779:2(387-400)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s00453-016-0199-7
Lecroq T(2014)Pattern Matching and Text Compression AlgorithmsComputing Handbook, Third Edition10.1201/b16812-18(1-58)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-18
Breslauer DGalil Z(2014)Real-Time Streaming String-MatchingACM Transactions on Algorithms10.1145/263581410:4(1-12)Online publication date: 25-Aug-2014
https://dl.acm.org/doi/10.1145/2635814
Show More Cited By

Index Terms

String Matching in Real Time
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

String Matching under a General Matching Relation

In standard string matching, each symbol matches only itself, In other string matching problems, e.g., the string matching with "don t-cares" problem, a symbol may match several symbols. In general, an arbitrary many-to-many matching relation might hold ...
Read More
Average-optimal string matching

The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple ...
Read More
Approximate string matching in sublinear expected time
SFCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer Science

The k differences approximate string matching problem specifies a text string of length n, a pattern string of length m, and the number k of differences (insertions, deletions, substitutions) allowed in a match, and asks for every location in the text ...
Read More

Comments

Information & Contributors

Information

Published In

Journal of the ACM Volume 28, Issue 1

Jan. 1981

190 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/322234

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 January 1981

Published in JACM Volume 28, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

46
Total Citations
View Citations
985
Total Downloads

Downloads (Last 12 months)159
Downloads (Last 6 weeks)12

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kucherov GNekrich Y(2017)Full-Fledged Real-Time Indexing for Constant Size AlphabetsAlgorithmica10.1007/s00453-016-0199-779:2(387-400)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s00453-016-0199-7
Lecroq T(2014)Pattern Matching and Text Compression AlgorithmsComputing Handbook, Third Edition10.1201/b16812-18(1-58)Online publication date: 8-May-2014
https://doi.org/10.1201/b16812-18
Breslauer DGalil Z(2014)Real-Time Streaming String-MatchingACM Transactions on Algorithms10.1145/263581410:4(1-12)Online publication date: 25-Aug-2014
https://dl.acm.org/doi/10.1145/2635814
Clifford RJalsenius MSach BKhanna S(2013)Tight cell-probe bounds for online Hamming distance computationProceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms10.5555/2627817.2627865(664-674)Online publication date: 6-Jan-2013
https://dl.acm.org/doi/10.5555/2627817.2627865
Faro SLecroq T(2013)The exact online string matching problemACM Computing Surveys10.1145/2431211.243121245:2(1-42)Online publication date: 12-Mar-2013
https://dl.acm.org/doi/10.1145/2431211.2431212
Breslauer DGrossi RMignosi F(2013)Simple real-time constant-space string matchingTheoretical Computer Science10.1016/j.tcs.2012.11.040483(2-9)Online publication date: 1-Apr-2013
https://dl.acm.org/doi/10.1016/j.tcs.2012.11.040
Crochemore MHancart C(2013)Automata for Matching PatternsHandbook of Formal Languages10.1007/978-3-662-07675-0_9(399-462)Online publication date: 26-Mar-2013
https://doi.org/10.1007/978-3-662-07675-0_9
Kucherov GNekrich Y(2013)Full-Fledged real-time indexing for constant size alphabetsProceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I10.1007/978-3-642-39206-1_55(650-660)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39206-1_55
Clifford RJalsenius MPorat ESach B(2012)Pattern matching in multiple streamsProceedings of the 23rd Annual conference on Combinatorial Pattern Matching10.1007/978-3-642-31265-6_8(97-109)Online publication date: 3-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31265-6_8
Gawrychowski P(2012)Simple and efficient LZW-Compressed multiple pattern matchingProceedings of the 23rd Annual conference on Combinatorial Pattern Matching10.1007/978-3-642-31265-6_19(232-242)Online publication date: 3-Jul-2012
https://dl.acm.org/doi/10.1007/978-3-642-31265-6_19
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

String Matching under a General Matching Relation

Average-optimal string matching

Approximate string matching in sublinear expected time

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations