Background: Traditional genome alignment methods consider sequence alignment as a variation of the string edit distance problem, and perform alignment by matching characters of th...
The field of algorithms for pairwisc biosequence similarity search is dominated by heuristic methods of high efficiency but uncertain sensitivity. One reason that more formal stri...
This paper proposes an algorithm for rejecting false matches (known as outliers) in image pairs acquired with automobile-mounted cameras. Many intelligent vehicle applications req...
Jae Kyu Suhr, Ho Gi Jung, Kwanghyuk Bae, Jaihie Ki...
This paper presents an efficient collision resolution protocol and its variations for the tag identification problem, where an electromagnetic reader attempts to obtain within its...
Inverted indexes using sequences of characters (n-grams) as terms provide an error-resilient and language-independent way to query for arbitrary substrings and perform approximate...