1021 search results - page 80 / 205 » Fast Approximate PCPs |
135
click to vote
CPM
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
128
click to vote
VLDB
2000
ACM
15 years 6 months ago
2000
ACM
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
133
click to vote
ALGORITHMICA
2005
15 years 2 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
139
click to vote
SEBD
2003
15 years 4 months ago
2003
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
130
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...