Sciweavers

102 search results - page 8 / 21
» Fast exact string matching algorithms
Sort
View
FUIN
2008
80views more  FUIN 2008»
13 years 8 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
GCB
2008
Springer
174views Biometrics» more  GCB 2008»
13 years 9 months ago
Lightweight Comparison of RNAs based on Exact Sequence-structure Matches
: Specific functions of RNA molecules are often associated with different motifs in the RNA structure. The key feature that forms such an RNA motif is the combination of sequence ...
Steffen Heyne, Sebastian Will, Michael Beckstette,...
CVPR
2004
IEEE
14 years 10 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
CIKM
2009
Springer
14 years 1 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
SOFSEM
2007
Springer
14 years 2 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach