Zobrazeno 1 - 10
of 86
pro vyhledávání: '"RAFFINOT, MATHIEU"'
We study a new version of the Euclidean TSP called VectorTSP (VTSP for short) where a mobile entity is allowed to move according to a set of physical constraints inspired from the pen-and-pencil game Racetrack (also known as Vector Racer ). In contra
Externí odkaz:
http://arxiv.org/abs/2006.03666
The Shortest Common Superstring problem (SCS) consists, for a set of strings S = {s_1,...,s_n}, in finding a minimum length string that contains all s_i, 1<= i <= n, as substrings. While a 2+11/30 approximation ratio algorithm has recently been publi
Externí odkaz:
http://arxiv.org/abs/1805.00060
Autor:
Raffinot, Mathieu, Rivière, Romain
How to bid on a Google shopping account (set of shopping campaigns) with query-level matching like in Google Adwords.
Externí odkaz:
http://arxiv.org/abs/1708.04586
We aim to study the set of color sets of continuous regions of an image given as a matrix of $m$ rows over $n\geq m$ columns where each element in the matrix is an integer from $[1,\sigma]$ named a {\em color}. The set of distinct colors in a region
Externí odkaz:
http://arxiv.org/abs/1608.07847
The Shortest Superstring Problem (SSP) consists, for a set of strings S = {s_1,...,s_n}, to find a minimum length string that contains all s_i, 1 <= i <= k, as substrings. This problem is proved to be NP-Complete and APX-hard. Guaranteed approximatio
Externí odkaz:
http://arxiv.org/abs/1605.05542
Highly-repetitive collections of strings are increasingly being amassed by genome sequencing and genetic variation experiments, as well as by storing all versions of human-generated files, like webpages and source code. Existing indexes for locating
Externí odkaz:
http://arxiv.org/abs/1604.06002
In highly repetitive strings, like collections of genomes from the same species, distinct measures of repetition all grow sublinearly in the length of the text, and indexes targeted to such strings typically depend only on one of these measures. We d
Externí odkaz:
http://arxiv.org/abs/1502.05937
In this paper we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of siz
Externí odkaz:
http://arxiv.org/abs/1305.4747
Let $t$ be a permutation (that shall play the role of the {\em text}) on $[n]$ and a pattern $p$ be a sequence of $m$ distinct integer(s) of $[n]$, $m\leq n$. The pattern $p$ occurs in $t$ in position $i$ if and only if $p_1... p_m$ is order-isomorph
Externí odkaz:
http://arxiv.org/abs/1301.4952
Let s = s_1 .. s_n be a text (or sequence) on a finite alphabet \Sigma of size \sigma. A fingerprint in s is the set of distinct characters appearing in one of its substrings. The problem considered here is to compute the set {\cal F} of all fingerpr
Externí odkaz:
http://arxiv.org/abs/1301.3488