Skip to Main content Skip to Navigation
Conference papers

Cross-document pattern matching

Abstract : We study a new variant of the string matching problem called cross-document string 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 level ancestor problem.
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-00789975
Contributor : Gregory Kucherov <>
Submitted on : Tuesday, February 19, 2013 - 10:39:53 AM
Last modification on : Wednesday, May 6, 2020 - 8:18:02 PM
Long-term archiving on: : Monday, May 20, 2013 - 4:00:20 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Citation

Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya. Cross-document pattern matching. CPM 2012, Jul 2012, Helsinki, Finland. pp.196-207, ⟨10.1007/978-3-642-31265-6_16⟩. ⟨hal-00789975⟩

Share

Metrics

Record views

241

Files downloads

340