Sciweavers

1513 search results - page 120 / 303
» Cryptographic Pattern Matching
Sort
View
112
Voted
SPIRE
2010
Springer
15 years 26 days ago
String Matching with Variable Length Gaps
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
Philip Bille, Inge Li Gørtz, Hjalte Wedel V...
129
Voted
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 4 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
BMCBI
2008
129views more  BMCBI 2008»
15 years 2 months ago
Triad pattern algorithm for predicting strong promoter candidates in bacterial genomes
Background: Bacterial promoters, which increase the efficiency of gene expression, differ from other promoters by several characteristics. This difference, not yet widely exploite...
Michael Dekhtyar, Amelie Morin, Vehary Sakanyan
99
Voted
CVPR
2007
IEEE
16 years 4 months ago
A Robust Warping Method for Fingerprint Matching
This paper presents a robust warping method for minutiae based fingerprint matching approaches. In this method, a deformable fingerprint surface is described using a triangular me...
Dongjin Kwon, Il Dong Yun, Sang Uk Lee
SPIRE
2007
Springer
15 years 8 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...