Výsledky vyhledávání - "Yannick Guesnet"

Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform

Autor: Thierry Lecroq, Yannick Guesnet, Jacqueline W. Daykin, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Bruce W. Watson, Élise Prieur-Gaston, Richard Groult

Publikováno v: Information Processing Letters
Information Processing Letters, Elsevier, 2019, 147, pp.82-87. ⟨10.1016/j.ipl.2019.03.003⟩

A degenerate or indeterminate string on an alphabet Σ is a sequence of non-empty subsets of Σ. Given a degenerate string t of length n and its Burrows–Wheeler transform we present a new method for searching for a degenerate pattern of length m in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::095d89bb612ea3258376cc590a25a566
https://hal-normandie-univ.archives-ouvertes.fr/hal-02113307

Zobrazit plný text záznamu

Binary block order Rouen Transform

Autor: Jacqueline W. Daykin, Martine Léonard, Élise Prieur-Gaston, Arnaud Lefebvre, Richard Groult, Thierry Lecroq, Yannick Guesnet

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2016, ⟨10.1016/j.tcs.2016.05.028⟩
Daykin, J W, Groult, R, Guesnet, Y, Lecroq, T, Lefebvre, A, Léonard, M & Prieur-Gaston, É 2016, ' Binary block order Rouen transform ', Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2016.05.028

Novel twin binary Burrows-Wheeler type transforms are introduced.The transforms are defined for Lyndon-like B-words which apply binary block order.We call this approach the B-BWT Rouen Transform.These bijective Rouen Transforms and inverses are compu

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b9a3943c67454994bf01432ec7300e9
https://doi.org/10.1016/j.tcs.2016.05.028

Zobrazit plný text záznamu

A survey of string orderings and their application to the Burrows–Wheeler transform

Autor: Jacqueline W. Daykin, Arnaud Lefebvre, Richard Groult, Thierry Lecroq, Yannick Guesnet, Élise Prieur-Gaston, M. Léonard

Publikováno v: Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 710, pp.52-65. ⟨10.1016/j.tcs.2017.02.021⟩

For over 20 years the data clustering properties and applications of the efficient Burrows–Wheeler transform have been researched. Lexicographic suffix-sorting is induced during the transformation, and more recently a new direction has considered a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3138e1e664470b5d31d26fec3fd68da6
https://hal.archives-ouvertes.fr/hal-01894859

Zobrazit plný text záznamu

Three Strategies for the Dead-Zone String Matching Algorithm

Autor: Jacqueline Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce Watson

Publikováno v: Proceedings of the Prague Stringology Conference 2018
Proceedings of the Prague Stringology Conference 2018, Aug 2017, Prague, Czech Republic. pp.117--128
Aberystwyth University

International audience

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ce595c5116740a38c1ded2100862fbeb
https://hal.archives-ouvertes.fr/hal-01956358

Zobrazit plný text záznamu

Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform

Autor: Jacqueline Daykin, Richard Groult, Yannick Guesnet, Thierry Lecroq, Arnaud Lefebvre, Martine Léonard, Laurent Mouchard, Élise Prieur-Gaston, Bruce Watson

Publikováno v: Aberystwyth University

A degenerate or indeterminate string on an alphabet $\Sigma$ is a sequence of non-empty subsets of $\Sigma$. Given a degenerate string $t$ of length $n$, we present a new method based on the Burrows--Wheeler transform for searching for a degenerate p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::954670850a105272c27a486d802bba91
http://arxiv.org/abs/1708.01130

Zobrazit plný text záznamu

On maximal synchronous codes

Autor: Yannick Guesnet

Publikováno v: Theoretical Computer Science. 307:129-138

In this paper, we are interested in maximal synchronous codes. More precisely, we prove that we can embed any synchronous code in a maximal one. Moreover, we establish that, for synchronous codes, the notion of maximality in the family of synchronous

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69f7c358c93a9ac80bbfd0a6df7c25f9
https://doi.org/10.1016/s0304-3975(03)00097-5

Zobrazit plný text záznamu

On maximal codes with a finite interpreting delay

Autor: Yannick Guesnet

Publikováno v: Theoretical Computer Science. 273:167-183

The notion of codes with a finite interpreting delay (f.i.d.) was introduced in (Guesnet, Theoret. Inform. Appl. 34 (2000) 47–59). In this paper, we are interested in the notion of maximality for f.i.d. codes. We characterize the maximal f.i.d. cod

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b5edb1de2fcc19999d17d335453c279
https://doi.org/10.1016/s0304-3975(00)00439-4

Zobrazit plný text záznamu

Maximal circular codesversusmaximal codes

Autor: Yannick Guesnet

Publikováno v: RAIRO - Theoretical Informatics and Applications. 35:351-365

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7a353137f0d02bb1de434e9381cd6fb1
https://doi.org/10.1051/ita:2001124

Zobrazit plný text záznamu

On codes with finite interpreting delay: a defect theorem

Autor: Yannick Guesnet

Publikováno v: RAIRO - Theoretical Informatics and Applications. 34:47-59

We introduce two new classes of codes, namely adjacent codes and codes with finite interpreting delay. For each class, we establish an extension of the defect theorem.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0faa1be575d6a3bcf83a0e5b8e909d02
https://doi.org/10.1051/ita:2000106

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání