We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
We propose a new technique for the efficient search and navigation in XML documents and streams. This technique takes string matching algorithms designed for efficient keyword sear...
Christoph Koch, Stefanie Scherzinger, Michael Schm...
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
A hybrid algorithm is devised to boost the performance of complete search on under-constrained problems. We suggest to use random variable selection in combination with restarts, ...