Sciweavers

2089 search results - page 9 / 418
» A New Problem in String Searching
Sort
View
SODA
1997
ACM
199views Algorithms» more  SODA 1997»
14 years 11 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick
CIKM
2009
Springer
15 years 4 months ago
AS-index: a structure for string search using n-grams and algebraic signatures
AS-Index is a new index structure for exact string search in disk resident databases. It uses hashing, unlike known alternate structures, tree or trie based, and indexes every n-g...
Cédric du Mouza, Witold Litwin, Philippe Ri...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
15 years 9 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
15 years 3 months ago
Efficiently generating test vectors with state pruning
- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that ...
Ying Chen, Dennis Abts, David J. Lilja
CORR
2000
Springer
149views Education» more  CORR 2000»
14 years 9 months ago
On The Closest String and Substring Problems
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
Ming Li, Bin Ma, Lusheng Wang