Sciweavers

1290 search results - page 22 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 1 months ago
Compressed Pattern Matching in DNA Sequences
We propose derivative Boyer-Moore (d-BM), a new compressed pattern matching algorithm in DNA sequences. This algorithm is based on the BoyerMoore method, which is one of the most ...
Lei Chen, Shiyong Lu, Jeffrey L. Ram
DCC
2004
IEEE
15 years 1 months ago
LZW Based Compressed Pattern Matching
Compressed pattern matching is an emerging research area that addresses the following problem: given a file in compressed format and a pattern, report the occurrence(s) of the pat...
Tao Tao, Amar Mukherjee
CVPR
2006
IEEE
15 years 11 months ago
Hierarchical Procrustes Matching for Shape Retrieval
We introduce Hierarchical Procrustes Matching (HPM), a segment-based shape matching algorithm which avoids problems associated with purely global or local methods and performs wel...
Graham McNeill, Sethu Vijayakumar
ISVC
2010
Springer
14 years 8 months ago
How to Overcome Perceptual Aliasing in ASIFT?
SIFT is one of the most popular algorithms to extract points of interest from images. It is a scale+rotation invariant method. As a consequence, if one compares points of interest ...
Nicolas Noury, Frédéric Sur, Marie-O...
STACS
1992
Springer
15 years 1 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...