Cross-Document Pattern Matching

Tsvi Kopelowitz (1) , Gregory Kucherov (2) , Yakov Nekrich (3) , Tatiana Starikovskaya (4)

1 Weizmann Institute of Science [Rehovot, Israël]
2 LIGM - Laboratoire d'Informatique Gaspard-Monge
3 Department of Electrical Engineering & Computer Science, University of Kansas
4 Faculty of Mechanics and Mathematics

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 e cient 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 e cient 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.

Mots clés: algorithms; pattern matching; document reporting; weighted ancestor problem

Domaines: Algorithme et structure de données [cs.DS]; Traitement du texte et du document

Tsvi Kopelowitz, Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya. Cross-Document Pattern Matching. Journal of Discrete Algorithms, 2014, 24, pp.40-47. ⟨10.1016/j.jda.2013.05.002⟩. ⟨hal-00842364⟩