85 search results - page 1 / 17 » Hardness of Optimal Spaced Seed Design |
138
click to vote
CPM
2005
Springer
15 years 5 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,...
127
click to vote
ICALP
2005
Springer
15 years 8 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...
133
click to vote
RECOMB
2004
Springer
16 years 3 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
140
Voted
AISB
1995
Springer
15 years 6 months ago
1995
Springer
This paper describes a form of dynamical computational system--4he ant colony---and presents an ant colony model for continuous space optimisation problems. The ant colony metapho...
135
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
A novel evolutionary approach for the bin packing problem (BPP) is presented. A simple steady-state genetic algorithm is developed that produces results comparable to other approa...