Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases
| dc.creator | Sistla, A. Prasad | |
| dc.date | 2005-01-04 | |
| dc.date.accessioned | 2026-07-07T03:22:20Z | |
| dc.date.available | 2026-07-07T03:22:20Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0501006 | |
| dc.identifier | http://arxiv.org/abs/cs/0501006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32553 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Databases | |
| dc.subject | I.2.4; I.2.3; D.2.4 | |
| dc.title | Formal Languages and Algorithms for Similarity based Retrieval from Sequence Databases | |
| dc.type | text |