Finding Matches in Unlabelled Streams

Details Finding Matches in Unlabelled Streams Finding Matches in Unlabelled Streams

2011-09-24

arxiv.org/abs/1109.5269v2

Computer Science

Data Structures and Algorithms

19 pages, 7 figures

Scientific paper

We study the problem of finding matches in a stream with unlabelled data. Where the data are not labelled, the only information we have is which items are the same and which differ. A pattern P of length m is said to match a substring of the stream T at position i if there is an injective (one-to-one) function f such that T[i+j]=f(P[j]) for all 0<=j

Affiliated with

Also associated with

No associations

Rating

Finding Matches in Unlabelled Streams 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 Finding Matches in Unlabelled Streams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding Matches in Unlabelled Streams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602660