Sciweavers

215 search results - page 21 / 43
» On the Linear Number of Matching Substrings
Sort
View
BMCBI
2006
141views more  BMCBI 2006»
13 years 8 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...
IPPS
2010
IEEE
13 years 5 months ago
Scalable multi-pipeline architecture for high performance multi-pattern string matching
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
Weirong Jiang, Yi-Hua Edward Yang, Viktor K. Prasa...
STACS
1992
Springer
13 years 12 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...
NAR
2010
122views more  NAR 2010»
13 years 2 months ago
ELM: the status of the 2010 eukaryotic linear motif resource
Linear motifs are short segments of multidomain proteins that provide regulatory functions independently of protein tertiary structure. Much of intracellular signalling passes thr...
Cathryn M. Gould, Francesca Diella, Allegra Via, P...
CVPR
2004
IEEE
14 years 10 months ago
Linear Model Hashing and Batch RANSAC for Rapid and Accurate Object Recognition
This paper proposes a joint feature-based model indexing and geometric constraint based alignment pipeline for efficient and accurate recognition of 3D objects from a large model ...
Ying Shan, Bogdan Matei, Harpreet S. Sawhney, Rake...