Cross-document pattern matching

Authors:
Tsvi Kopelowitz;Gregory Kucherov;Yakov Nekrich;Tatiana Starikovskaya
Affiliations:
Weizmann Institute of Science, Rehovot, Israel;Laboratoire dInformatique Gaspard Monge, Université Paris-Est & CNRS, Marne-la-Valléée, Paris, France;Department of Electrical Engineering & Computer Science, University of Kansas, Lawrence, USA;Lomonosov Moscow State University, Moscow, Russia
Venue:
Journal of Discrete Algorithms
Year:
2014

Citing 23
Cited 0

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
Space efficient suffix trees

Journal of Algorithms
Efficient algorithms for document retrieval problems

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
High-order entropy-compressed text indexes

SODA '03 Proceedings of the fourteenth 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
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The level ancestor problem simplified

Theoretical Computer Science - Latin American theorotical informatics
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

SIAM Journal on Computing
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)
Dynamic weighted ancestors

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Compressed Suffix Trees with Full Functionality

Theory of Computing Systems
Faster entropy-bounded compressed suffix trees

Theoretical Computer Science
Colored range queries and document retrieval

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

ACM Transactions on Algorithms (TALG)
Fast local searches and updates in bounded universes

Computational Geometry: Theory and Applications
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List

FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.