Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
We introduce BubbleSearch, a general approach for extending priority-based greedy heuristics. Following the framework recently developed by Borodin et al., we consider priority al...
Abstract. In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a give...
Guillaume Blin, Guillaume Fertin, Danny Hermelin, ...
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...