Cross-Document pattern matching

Authors:
Gregory Kucherov;Yakov Nekrich;Tatiana Starikovskaya
Affiliations:
Laboratoire d'Informatique Gaspard Monge, Université Paris-Est & CNRS, Paris, France;Department of Computer Science, University of Chile, Santiago, Chile;Lomonosov Moscow State University, Moscow, Russia,Laboratoire d'Informatique Gaspard Monge, Université Paris-Est & CNRS, Paris, France
Venue:
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Year:
2012

Citing 18
Cited 3

Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Finding level-ancestors in trees

Journal of Computer and System Sciences
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Multidimensional divide-and-conquer

Communications of the ACM
Efficient algorithms for document retrieval problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
New Upper Bounds for Generalized Intersection Searching Problems

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Perfect Hashing for Strings: Formalization and Algorithms

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Two Simplified Algorithms for Maintaining Order in a List

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The level ancestor problem simplified

Theoretical Computer Science - Latin American theorotical informatics
Rank/select operations on large alphabets: a tool for text indexing

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compressed full-text indexes

ACM Computing Surveys (CSUR)
Succinct data structures for flexible text retrieval systems

Journal of Discrete Algorithms
Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)
Dynamic text and static pattern matching

ACM Transactions on Algorithms (TALG)
Compressed Suffix Trees with Full Functionality

Theory of Computing Systems
Colored range queries and document retrieval

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval

Computing lempel-ziv factorization online

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computing discriminating and generic words

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Full-Fledged real-time indexing for constant size alphabets

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

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.