Cross-document pattern matching

Tsvi Kopelowitz; Gregory Kucherov; Yakov Nekrich; Tatiana Starikovskaya

doi: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

13 Scopus citations

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

Bibliographical 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 .

Funding

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 .

Funders	Funder number
Russian Foundation for Basic Research	10-01-93109-CNRS-a
Dynasty Foundation
Ministère des Affaires Etrangères

Keywords

Algorithms
Document reporting
Pattern matching
Weighted ancestor problem

Access to Document

10.1016/j.jda.2013.05.002

Cite this

@article{835ecce7ab244d3eae369abcd1146731,

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 = "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 - https://www.scopus.com/pages/publications/84891749057

U2 - 10.1016/j.jda.2013.05.002

DO - 10.1016/j.jda.2013.05.002

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84891749057

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

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this