82 search results - page 3 / 17 » A Fast Generic Sequence Matching Algorithm |
CPM
1998
Springer
13 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
Content-based video retrieval technology holds the key to the efficient management and sharing of video content from different sources, in different scales, across different platf...
SIGIR
2005
ACM
13 years 12 months ago
2005
ACM
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
CSR
2006
Springer
13 years 10 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
GCB
2004
Springer
13 years 10 months ago
2004
Springer
: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs. In this paper, we present a new nonheuristic algorithm, ...