Sciweavers

160 search results - page 2 / 32
» Improved Single and Multiple Approximate String Matching
Sort
View
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
14 years 17 days ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...
JMLR
2010
111views more  JMLR 2010»
13 years 1 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
MJ
2006
138views more  MJ 2006»
13 years 6 months ago
A CAM-based keyword match processor architecture
This paper demonstrates a keyword match processor capable of performing fast dictionary search with approximate match capability. Using a content addressable memory with processor...
Long Bu, John A. Chandy
VLDB
2007
ACM
107views Database» more  VLDB 2007»
14 years 6 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang