Sciweavers

910 search results - page 40 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
ICCS
2005
Springer
15 years 8 months ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
LATIN
1998
Springer
15 years 7 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
ICARIS
2009
Springer
15 years 6 months ago
Efficient Algorithms for String-Based Negative Selection
Abstract. String-based negative selection is an immune-inspired classification scheme: Given a self-set S of strings, generate a set D of detectors that do not match any element of...
Michael Elberfeld, Johannes Textor
ICPR
2008
IEEE
16 years 4 months ago
A contrario matching of SIFT-like descriptors
In this paper, the matching of SIFT-like features [5] between images is studied. The goal is to decide which matches between descriptors of two datasets should be selected. This m...
Julie Delon, Julien Rabin, Yann Gousseau
MST
2006
96views more  MST 2006»
15 years 2 months ago
Juggling with Pattern Matching
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
Jean Cardinal, Steve Kremer, Stefan Langerman