Výsledky vyhledávání - "Mathieu Raffinot"

VectorTSP: A Traveling Salesperson Problem with Racetrack-Like Acceleration Constraints

Autor: Mathieu Raffinot, Jason Schoeters, Arnaud Casteigts

Publikováno v: Algorithms for Sensor Systems ISBN: 9783030624002
ALGOSENSORS

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 contras

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::45e2cf3618e70246ad304943a23a5a55
https://doi.org/10.1007/978-3-030-62401-9_4

Zobrazit plný text záznamu

Indexing and querying color sets of images

Autor: Djamal Belazzougui, Roman Kolpakov, Mathieu Raffinot

Publikováno v: Theoretical Computer Science. 647:74-84

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: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce3a38d6ad154907c2af05f9a8309db5
https://doi.org/10.1016/j.tcs.2016.07.041

Zobrazit plný text záznamu

A Clique Finding Algorithm for the Approximate Gene Cluster Discovery Problem

Autor: Mathieu Raffinot, Jaime D. L. Caro, Geoffrey A. Solano, Guillaume Blin

Publikováno v: Theory and Practice of Computation.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::76b891b134163885fcf506a42952ded4
https://doi.org/10.1142/9789813279674_0006

Zobrazit plný text záznamu

Various improvements to text fingerprinting

Autor: Roman Kolpakov, Djamal Belazzougui, Mathieu Raffinot

Publikováno v: Journal of Discrete Algorithms. 22:1-18

Let s=s"1..s"n be a text (or sequence) on a finite alphabet @S of size @s. 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 F of all fingerprints of all substri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e5275d0908edaf109f5e1360f56060b
https://doi.org/10.1016/j.jda.2013.06.004

Zobrazit plný text záznamu

A note on computing set overlap classes

Autor: Mathieu Raffinot, Pierre Charbit, Vincent Limouzy, Michel Habib, Fabien de Montgolfier, Michaël Rao

Publikováno v: Information Processing Letters
Information Processing Letters, Elsevier, 2008, 108 (4), pp.186-191. ⟨10.1016/j.ipl.2008.05.005⟩

International audience; Let ${\cal V}$ be a finite set of $n$ elements and ${\cal F}=\{X_1,X_2, \ldots , X_m\}$ a family of $m$ subsets of ${\cal V}.$ Two sets $X_i$ and $X_j$ of ${\cal F}$ overlap if $X_i \cap X_j \neq \emptyset,$ $X_j \setminus X_i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03554a04b7ff7d9f48e4142e3836cce3
https://doi.org/10.1016/j.ipl.2008.05.005

Zobrazit plný text záznamu

New algorithms for text fingerprinting

Autor: Roman Kolpakov, Mathieu Raffinot

Publikováno v: Journal of Discrete Algorithms. 6(2):243-255

Let s=s1..sn be a text (or sequence) on a finite alphabet Σ. A fingerprint in s is the set of distinct characters contained in one of its substrings. Fingerprinting a text consists of computing the set F of all fingerprints of all its substrings and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae3beaa340fb8635ecda1778f74b3b97

Zobrazit plný text záznamu

Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs

Autor: Anne Bergeron, Fabien de Montgolfier, Cedric Chauve, Mathieu Raffinot

Publikováno v: SIAM Journal on Discrete Mathematics. 22:1022-1039

We introduce a new approach to compute the common intervals of $K$ permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple and efficient algorithms to compute the set of all common inte

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e53501703d1e9780d0f4748bb22821bc
https://doi.org/10.1137/060651331

Zobrazit plný text záznamu

APPROXIMATE MATCHING OF STRUCTURED MOTIFS IN DNA SEQUENCES

Autor: Jean-Eudes Duchesne, Nicholas Luc, Mathieu Raffinot, Nadia El-Mabrouk, Mathieu Lajoie

Publikováno v: Journal of Bioinformatics and Computational Biology. :317-342

Several methods have been developed for identifying more or less complex RNA structures in a genome. All these methods are based on the search for conserved primary and secondary sub-structures. In this paper, we present a simple formal representatio

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c05b3ea417c8dc98b79ecec735cc3fa9
https://doi.org/10.1142/s0219720005001065

Zobrazit plný text záznamu

Practical and flexible pattern matching over Ziv–Lempel compressed text

Autor: Gonzalo Navarro, Mathieu Raffinot

Publikováno v: Journal of Discrete Algorithms. 2(3):347-371

We address the problem of string matching on Ziv–Lempel compressed text. The goal is to search for a pattern in a text without uncompressing it. This is a highly relevant issue to keep compressed text databases where efficient searching is still po

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6a3377d4589431277e20ccb90b0a96cc

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání