An introductory text that emphasizes the underlying algorithmic ideas that are driving
advances in bioinformatics. This introductory text offers a clear exposition of the algorithmic …

Basic properties of finite subsets of the integer lattice ℤ n are investigated from the point of
view of geometric tomography. Results obtained concern the Minkowski addition of convex …

A Golomb Ruler is a ruler with integer marks where the distances between every two marks
are distinct. Golomb Rulers find diverse applications in computer science and electrical …

We state in previous paper [A. Daurat, Y. Gérard, M. Nivat, The chords' problem, Theoret.
Comput. Sci. 282 (2)(2002) 319–336] that the chords' problem can be solved in polynomial …

The covariogram of a compact set A⊂ ℝn is the function that to each x∈ ℝn associates the
volume of A∩(A+ x). Recently it has been proved that the covariogram determines any …

Given a function p: N→[0, 1] of period n, we study the minimal size (number of states) of a
one-way quantum finite automaton (Iqfa) inducing the stochastic event ap+ b, for real …

The complexity of searching minimum difference covers, both in Z+ and in Zn, is studied. We
prove that these two optimization problems are NP-hard. To obtain this result, we …

The point placement problem is to determine the positions of a set of n distinct points, P={p
1, p 2, p 3,…, pn}, on a line uniquely, up to translation and reflection, from the fewest …

In the early 1990s when one of us was teaching his first bioinformatics class, he was not
sure that there would be enough students to teach. Although the Smith-Waterman and …

The point placement problem is to determine the positions of a linear set of points, P={p1,
p2, p3,..., pn}, uniquely, up to translation and reflection, from the fewest possible distance …