Cross-document pattern matching - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Cross-document pattern matching


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.
Fichier principal
Vignette du fichier
main.pdf (155.37 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00789975 , version 1 (19-02-2013)



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⟩
70 View
191 Download



Gmail Facebook Twitter LinkedIn More