53 search results - page 3 / 11 » Efficient Trie-Based Sorting of Large Sets of Strings |
BMCBI
2008
13 years 5 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
DAWAK
1999
Springer
13 years 9 months ago
1999
Springer
Efficient index construction in multidimensional data spaces is important for many knowledge discovery algorithms, because construction times typically must be amortized by perform...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
The full-custom CMOS realization of a new modular sorting architecture is presented. The high-performance architecture is based on rank ordering, and on efficient implementation o...
WSDM
2010
ACM
14 years 2 months ago
2010
ACM
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...