Cross-Document Pattern Matching

Details Cross-Document Pattern Matching Cross-Document Pattern Matching

2012-02-18

arxiv.org/abs/1202.4076v1

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cross-Document Pattern Matching does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cross-Document Pattern Matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cross-Document Pattern Matching will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33348