216 search results - page 4 / 44 » Fast Optimal Algorithms for Computing All the Repeats in a S... |
DAWAK
2007
Springer
14 years 15 days ago
2007
Springer
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
IPPS
2009
IEEE
14 years 3 months ago
2009
IEEE
String searching is at the core of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filters. The growing size of o...
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
JOC
1998
13 years 8 months ago
1998
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...