7 search results - page 1 / 2 » Optimal Spaced Seeds for Faster Approximate String Matching |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
CPM
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
CVPR
2007
IEEE
14 years 6 months ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
BMCBI
2008
13 years 5 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
ACCV
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. To develop statistical models for shapes, we utilize an elastic string representation where curves (denoting shapes) can bend and locally stretch (or compress) to optimal...