Cross-document pattern matching

Tsvi Kopelowitz; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya

doi:https://doi.org/10.1016/j.jda.2013.05.002

Cross-document pattern matching

Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya

Research output: Contribution to journal › Article › peer-review

Abstract

We study a new variant of the pattern matching problem called cross-document pattern matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted ancestor problem.

Original language	English
Pages (from-to)	40-47
Number of pages	8
Journal	Journal of Discrete Algorithms
Volume	24
DOIs	https://doi.org/10.1016/j.jda.2013.05.002
State	Published - Jan 2014
Externally published	Yes

Keywords

Algorithms
Document reporting
Pattern matching
Weighted ancestor problem

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

https://doi.org/10.1016/j.jda.2013.05.002

Cite this

@article{9af764b50cd648908f0b6c806778a6c2,

title = "Cross-document pattern matching",

abstract = "We study a new variant of the pattern matching problem called cross-document pattern matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted ancestor problem.",

keywords = "Algorithms, Document reporting, Pattern matching, Weighted ancestor problem",

author = "Tsvi Kopelowitz and Gregory Kucherov and Yakov Nekrich and Tatiana Starikovskaya",

note = "Funding Information: The authors gratefully acknowledge the help of Travis Gagie who suggested to use a compressed suffix tree in the succinct version of the document reporting problem. T. Starikovskaya has been supported by the mobility grant funded by the French Ministry of Foreign Affairs through the EGIDE agency, by RFBR grant 10-01-93109-CNRS-a , and by Dynasty Foundation .",

year = "2014",

month = jan,

doi = "https://doi.org/10.1016/j.jda.2013.05.002",

language = "الإنجليزيّة",

volume = "24",

pages = "40--47",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

}

TY - JOUR

T1 - Cross-document pattern matching

AU - Kopelowitz, Tsvi

AU - Kucherov, Gregory

AU - Nekrich, Yakov

AU - Starikovskaya, Tatiana

N1 - Funding Information: The authors gratefully acknowledge the help of Travis Gagie who suggested to use a compressed suffix tree in the succinct version of the document reporting problem. T. Starikovskaya has been supported by the mobility grant funded by the French Ministry of Foreign Affairs through the EGIDE agency, by RFBR grant 10-01-93109-CNRS-a , and by Dynasty Foundation .

PY - 2014/1

Y1 - 2014/1

N2 - We study a new variant of the pattern matching problem called cross-document pattern matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted ancestor problem.

AB - We study a new variant of the pattern matching problem called cross-document pattern matching, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, and efficient linear space solutions are proposed with query time bounds that either do not depend at all on the pattern size or depend on it in a very limited way (doubly logarithmic). As a side result, we propose an improved solution to the weighted ancestor problem.

KW - Algorithms

KW - Document reporting

KW - Pattern matching

KW - Weighted ancestor problem

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

U2 - https://doi.org/10.1016/j.jda.2013.05.002

DO - https://doi.org/10.1016/j.jda.2013.05.002

M3 - مقالة

SN - 1570-8667

VL - 24

SP - 40

EP - 47

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

ER -

Cross-document pattern matching

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this