A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

In comparative genomics, a transposition is an operation that exchanges two consecutive
sequences of genes in a genome. The transposition distance between two genomes, that is …

Networks-on-chip (NoCs) have recently emerged as a scalable alternative to classical bus
and point-to-point architectures. To date, performance evaluation of NoC designs is largely …

Multiple tasks within the field of geographical information retrieval and geographical
information sciences necessitate toponym matching, which involves the challenge of …

We revisit the complexity of one of the most basic problems in pattern matching. In the k-
mismatch problem we must compute the Hamming distance between a pattern of length m …

This paper presents a new approach for automatic concept extraction, using grammatical
parsers and Latent Semantic Analysis. The methodology is described, also the tool used to …

We study the problem of finding occurrences of motifs in vertex-colored graphs, where a
motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertices …

The algorithmic task of computing the Hamming distance between a given pattern of length
m and each location in a text of length n, both over a general alphabet\Sigma, is one of the …

We propose an effective polynomial-time preprocessing strategy for intractable median
problems. Develo** a new methodological framework, we show that if the input objects of …

We consider the problem of computing a $(1+\epsilon) $-approximation of the Hamming
distance between a pattern of length $ n $ and successive substrings of a stream. We first …