Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

The paper considers various formalisms based on Automata, Temporal Logic and Regular Expressions for specifying queries over sequences. Unlike traditional binary semantics, the paper presents a similarity based semantics for thse formalisms. More specifically, a distance measure in the range [0,1] is associated with a sequence, query pair denoting how closely the sequence satisfies the query. These measures are defined using a spectrum of normed vector distance measures. Various distance measures based on the syntax and the traditional semantics of the query are presented. Efficient algorithms for computing these distance measure are presented. These algorithms can be employed for retrieval of sequence from a database that closely satisfy a given.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases 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 Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-529125

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.