Alphabet independent two dimensional matching

Amihood Amir; Gary Benson; Martin Farach

doi:10.1145/129712.129719

Alphabet independent two dimensional matching

Amihood Amir, Gary Benson, Martin Farach

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

46 Scopus citations

Abstract

There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithm for two dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in O(n² log m) with O(m² log m) preprocessing. We show an algorithm for two dimensional matching with an O(n²) text scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear time string matching algorithm.

Original language	English
Title of host publication	Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
Publisher	Association for Computing Machinery
Pages	59-68
Number of pages	10
ISBN (Electronic)	0897915119
DOIs	https://doi.org/10.1145/129712.129719
State	Published - 1 Jul 1992
Externally published	Yes
Event	24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129722
ISSN (Print)	0737-8017

Conference

Conference	24th Annual ACM Symposium on Theory of Computing, STOC 1992
Country/Territory	Canada
City	Victoria
Period	4/05/92 → 6/05/92

Bibliographical note

Publisher Copyright:
© 1992 ACM.

Funding

*College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280; (404) 853-0083; [email protected]. edu; Partially supported by NSF ~ant IR.I-90-13055. tDept. of Computer Scienee, University of Maryland, Col- lege Park, MD 20742; (301) 405-2715; [email protected] Partially supported by NSF grant IRI-90-13055. :DIMACS, Box 1179, Rutgers University, 08855; (808) 932-592% [email protected], by DIMACS under NSF contract STC-88-09648.

Funders	Funder number
National Science Foundation
University of Maryland	IRI-90-13055, 08855
Center for Discrete Mathematics and Theoretical Computer Science	STC-88-09648

Access to Document

10.1145/129712.129719

Cite this

@inproceedings{14580157be2a46dcb0cbfdc17581a5db,

title = "Alphabet independent two dimensional matching",

abstract = "There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithm for two dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in O(n2 log m) with O(m2 log m) preprocessing. We show an algorithm for two dimensional matching with an O(n2) text scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear time string matching algorithm.",

author = "Amihood Amir and Gary Benson and Martin Farach",

note = "Publisher Copyright: {\textcopyright} 1992 ACM.; 24th Annual ACM Symposium on Theory of Computing, STOC 1992 ; Conference date: 04-05-1992 Through 06-05-1992",

year = "1992",

month = jul,

day = "1",

doi = "10.1145/129712.129719",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "59--68",

booktitle = "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992",

}

Amir, A, Benson, G & Farach, M 1992, Alphabet independent two dimensional matching. in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129722, Association for Computing Machinery, pp. 59-68, 24th Annual ACM Symposium on Theory of Computing, STOC 1992, Victoria, Canada, 4/05/92. https://doi.org/10.1145/129712.129719

Alphabet independent two dimensional matching. / Amir, Amihood; Benson, Gary; Farach, Martin.
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, 1992. p. 59-68 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129722).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Alphabet independent two dimensional matching

AU - Amir, Amihood

AU - Benson, Gary

AU - Farach, Martin

PY - 1992/7/1

Y1 - 1992/7/1

N2 - There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithm for two dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in O(n2 log m) with O(m2 log m) preprocessing. We show an algorithm for two dimensional matching with an O(n2) text scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear time string matching algorithm.

AB - There are many solutions to the string matching problem which are strictly linear in the input size and independent of alphabet size. Furthermore, the model of computation for these algorithms is very weak: they allow only simple arithmetic and comparisons of equality between characters of the input. In contrast, algorithm for two dimensional matching have needed stronger models of computation, most notably assuming a totally ordered alphabet. The fastest algorithms for two dimensional matching have therefore had a logarithmic dependence on the alphabet size. In the worst case, this gives an algorithm that runs in O(n2 log m) with O(m2 log m) preprocessing. We show an algorithm for two dimensional matching with an O(n2) text scanning phase. Furthermore, the text scan requires no special assumptions about the alphabet, i.e. it runs on the same model as the standard linear time string matching algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0026992709&partnerID=8YFLogxK

U2 - 10.1145/129712.129719

DO - 10.1145/129712.129719

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0026992709

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 59

EP - 68

BT - Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992

PB - Association for Computing Machinery

T2 - 24th Annual ACM Symposium on Theory of Computing, STOC 1992

Y2 - 4 May 1992 through 6 May 1992

ER -

Alphabet independent two dimensional matching

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this