72 search results - page 1 / 15 » External Memory Algorithms for String Problems |
FUIN
2008
13 years 4 months ago
2008
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
ICDE
2011
IEEE
12 years 8 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
DASFAA
2003
IEEE
13 years 10 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
FTTCS
2006
13 years 4 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
PROPERTYTESTING
2010
13 years 2 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...