Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
—This paper proposes a cache consistency scheme based on a previously proposed architecture for caching database data in MANETs. The original scheme for data caching stores the q...
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
Background: High-throughput genotyping microarrays assess both total DNA copy number and allelic composition, which makes them a tool of choice for copy number studies in cancer, ...
Henrik Bengtsson, Pierre Neuvial, Terence P. Speed
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...