316 search results - page 45 / 64 » A 3D pattern matching algorithm for DNA sequences |
164
Voted
CPM
1998
Springer
15 years 6 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...
127
click to vote
PKDD
2005
Springer
15 years 7 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
120
Voted
FUIN
2006
15 years 1 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
122
Voted
BMCBI
2005
15 years 1 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
153
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...