Sciweavers

910 search results - page 100 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
BMCBI
2010
143views more  BMCBI 2010»
15 years 21 days ago
A genome alignment algorithm based on compression
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...
Minh Duc Cao, Trevor I. Dix, Lloyd Allison
RECOMB
2002
Springer
16 years 3 months ago
Provably sensitive Indexing strategies for biosequence similarity search
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...
Jeremy Buhler
PRL
2008
96views more  PRL 2008»
15 years 3 months ago
Outlier rejection for cameras on intelligent vehicles
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...
106
Voted
DIALM
2000
ACM
107views Algorithms» more  DIALM 2000»
15 years 6 months ago
Efficient memoryless protocol for tag identification
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...
Ching Law, Kayi Lee, Kai-Yeung Siu
CIKM
2008
Springer
15 years 5 months ago
TinyLex: static n-gram index pruning with perfect recall
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...
Derrick Coetzee