302 search results - page 3 / 61 » Semi-local string comparison: algorithmic techniques and app... |
153
Voted
PSB
2003
15 years 5 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
170
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
152
Voted
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
148
Voted
ALGORITHMICA
2005
15 years 4 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...
157
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...