10 search results - page 1 / 2 » An efficient algorithm for finding short approximate non-tan... |
ISMB
2001
13 years 6 months ago
2001
RECOMB
2004
Springer
14 years 5 months ago
2004
Springer
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
SDM
2007
SIAM
13 years 6 months ago
2007
SIAM
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...