Discovering Repetitions in Strings

Michael O. Rabin

doi:10.1007/978-3-642-82456-2_19

Discovering Repetitions in Strings

Michael O. Rabin

The Rachel and Selim Benin School of Engineering and Computer Science

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

Abstract

There are many variants of problems involving string matchings. The basic problem is to determine whether a pattern string x appears as a (contiguous) substring of a text y, i.e. whether for some strings u, v, we have y= uxv. The classical string matching algorithm due to Knuth, Morris, Pratt [5] solves this problem in time linear in the length |y| of y. The KMP algorithm requires |x| auxiliary storage locations. Galil and Seiferas [3, 9] reduced the auxiliary storage requirements first to o(log|x|) and then to a constant number.

Original language	English
Title of host publication	Combinatorial Algorithms on Words
Editors	Alberto Apostolico, Zvi Galil
Place of Publication	Berlin, Heidelberg
Publisher	Springer Berlin Heidelberg
Pages	279-288
Number of pages	10
ISBN (Print)	978-3-642-82456-2
DOIs	https://doi.org/10.1007/978-3-642-82456-2_19
State	Published - 1985

Access to Document

10.1007/978-3-642-82456-2_19

Cite this

@inproceedings{bf417c725968444bbaf1f7e532cdcdcd,

title = "Discovering Repetitions in Strings",

abstract = "There are many variants of problems involving string matchings. The basic problem is to determine whether a pattern string x appears as a (contiguous) substring of a text y, i.e. whether for some strings u, v, we have y= uxv. The classical string matching algorithm due to Knuth, Morris, Pratt [5] solves this problem in time linear in the length |y| of y. The KMP algorithm requires |x| auxiliary storage locations. Galil and Seiferas [3, 9] reduced the auxiliary storage requirements first to o(log|x|) and then to a constant number.",

author = "Rabin, \{Michael O.\}",

year = "1985",

doi = "10.1007/978-3-642-82456-2\_19",

language = "אנגלית",

isbn = "978-3-642-82456-2",

pages = "279--288",

editor = "Alberto Apostolico and Zvi Galil",

booktitle = "Combinatorial Algorithms on Words",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Discovering Repetitions in Strings

AU - Rabin, Michael O.

PY - 1985

Y1 - 1985

N2 - There are many variants of problems involving string matchings. The basic problem is to determine whether a pattern string x appears as a (contiguous) substring of a text y, i.e. whether for some strings u, v, we have y= uxv. The classical string matching algorithm due to Knuth, Morris, Pratt [5] solves this problem in time linear in the length |y| of y. The KMP algorithm requires |x| auxiliary storage locations. Galil and Seiferas [3, 9] reduced the auxiliary storage requirements first to o(log|x|) and then to a constant number.

AB - There are many variants of problems involving string matchings. The basic problem is to determine whether a pattern string x appears as a (contiguous) substring of a text y, i.e. whether for some strings u, v, we have y= uxv. The classical string matching algorithm due to Knuth, Morris, Pratt [5] solves this problem in time linear in the length |y| of y. The KMP algorithm requires |x| auxiliary storage locations. Galil and Seiferas [3, 9] reduced the auxiliary storage requirements first to o(log|x|) and then to a constant number.

U2 - 10.1007/978-3-642-82456-2_19

DO - 10.1007/978-3-642-82456-2_19

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

SN - 978-3-642-82456-2

SP - 279

EP - 288

BT - Combinatorial Algorithms on Words

A2 - Apostolico, Alberto

A2 - Galil, Zvi

PB - Springer Berlin Heidelberg

CY - Berlin, Heidelberg

ER -

Discovering Repetitions in Strings

Abstract

Access to Document

Fingerprint

Cite this