Work

Full-fledged Real-Time Indexing for Constant Size Alphabets

Year: 2013

Type: preprint

Abstract: In this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet ofconstant size. Each new symbol can be prepended to $T$ in O(1) worst-case time. At any moment, we can report all occurrences of a pattern $P$ in the current text in $O(|P|+k)$ time, where $|P|$ is the length of $P$ and $k$ is the number of occurrences. This resolves, under assumption of constant-size alphabet, a long-standing open problem of existence of a real-time indexing method for string matching (see \cite{AmirN08}).

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1302.4016

Authors: Kucherov, Gregory, Nekrich, Yakov

Institutions: Centre National de la Recherche Scientifique, University of Kansas, Laboratoire d'Informatique Gaspard-Monge, Pôle de recherche et d'enseignement supérieur Université Paris-Est

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4299810456

Cites:

Cited by:

Related to: 10