Algorithms for Jumbled Pattern Matching in Strings

Details Algorithms for Jumbled Pattern Matching in Strings Algorithms for Jumbled Pattern Matching in Strings

2011-02-08

arxiv.org/abs/1102.1746v1

Computer Science

Data Structures and Algorithms

18 pages, 9 figures; article accepted for publication in the International Journal of Foundations of Computer Science

Scientific paper

The Parikh vector p(s) of a string s is defined as the vector of multiplicities of the characters. Parikh vector q occurs in s if s has a substring t with p(t)=q. We present two novel algorithms for searching for a query q in a text s. One solves the decision problem over a binary text in constant time, using a linear size index of the text. The second algorithm, for a general finite alphabet, finds all occurrences of a given Parikh vector q and has sub-linear expected time complexity; we present two variants, which both use a linear size index of the text.

Affiliated with

Also associated with

No associations

Rating

Algorithms for Jumbled Pattern Matching in Strings 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 Algorithms for Jumbled Pattern Matching in Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms for Jumbled Pattern Matching in Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-649832