Add to ORKGAbstract. LetW be a dictionary consisting of n binary strings of length m each, represented as a trie. The usual d-query asks if there exists a string in W within Hamming distance d of a given binary query string q. We present an algorithm to determine if there is a member in W within edit distance d of a given query string q of length m. The method takes time O(dm d+1) in the RAM model, independent of n, and requires O(dm) additional space.
In this paper we consider the problem of finding the ap-proximate nearest neighbor when the data set...
Abstract. Finding similar substrings/substructures is a central task in analyzing huge amounts of st...
We present a new bit-parallel technique for approximate string matching. We build on two previous te...
Given a dictionary S of n binary strings each of length m,we consider the problem of designing a dat...
Abstract. Given a set of n binary strings of length m each. We consider the problem of answering d{q...
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
Let X* be any unknown word from a finite dictionary H. Let U be any arbitrary subsequence of X*. We ...
[[abstract]]Let T be a text of length n and P be a pattern of length m, both strings over a fixed fi...
This paper proposes new solutions for the approximate dictionary queries problem. These solutions co...
In this thesis, we study the Hamming distance query problem. Hamming distance measures the number of...
This paper deals with the problem of estimating an unknown transmitted string X, belonging to a fini...
In many database applications involving string data, it is common to have near neighbor queries (ask...
This paper deals with the problem of estimating a transmitted string X* by processing the correspond...
Within the context of the approximate searching of names in a DB, we discuss searching techniques f...
In this paper we consider the problem of finding the ap-proximate nearest neighbor when the data set...
Abstract. Finding similar substrings/substructures is a central task in analyzing huge amounts of st...
We present a new bit-parallel technique for approximate string matching. We build on two previous te...
Given a dictionary S of n binary strings each of length m,we consider the problem of designing a dat...
Abstract. Given a set of n binary strings of length m each. We consider the problem of answering d{q...
This paper studies the 1-error dictionary search problem in external memory. The input is a set D of...
We revisit the fundamental problem of dictionary look-up with mismatches. Given a set (dictionary) o...
Let X* be any unknown word from a finite dictionary H. Let U be any arbitrary subsequence of X*. We ...
[[abstract]]Let T be a text of length n and P be a pattern of length m, both strings over a fixed fi...
This paper proposes new solutions for the approximate dictionary queries problem. These solutions co...
In this thesis, we study the Hamming distance query problem. Hamming distance measures the number of...
This paper deals with the problem of estimating an unknown transmitted string X, belonging to a fini...
In many database applications involving string data, it is common to have near neighbor queries (ask...
This paper deals with the problem of estimating a transmitted string X* by processing the correspond...
Within the context of the approximate searching of names in a DB, we discuss searching techniques f...
In this paper we consider the problem of finding the ap-proximate nearest neighbor when the data set...
Abstract. Finding similar substrings/substructures is a central task in analyzing huge amounts of st...
We present a new bit-parallel technique for approximate string matching. We build on two previous te...