Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Laurent, Mouchard"'
Autor:
Clément, Levin, Emeric, Dynomant, J, Gonzalez Bruno, Laurent, Mouchard, David, Landsman, Eivind, Hovig, Kristian, Vlahovicek
Since the advent of next-generation sequencing in the early 2000s, the volume of bioinformatics software tools and databases has exploded and continues to grow rapidly. Documenting this evolution on a global and time-dependent scale is a challenging
Externí odkaz:
http://arxiv.org/abs/1807.06808
Autor:
Thierry Lecroq, Joong Chae Na, Hyunjoon Kim, Kunsoo Park, Laurent Mouchard, Seunghwan Min, M. Léonard, Heejin Park
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2018, 710, pp.148-157. ⟨10.1016/j.tcs.2017.02.020⟩
Theoretical Computer Science, Elsevier, 2018, 710, pp.148-157. ⟨10.1016/j.tcs.2017.02.020⟩
Recently, a compressed index for similar strings, called the FM-index of alignment (FMA), has been proposed with the functionalities of pattern search and random access. The FMA is quite efficient in space requirement and pattern search time, but it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f097a5c0e757e115eae2e47dc797781d
https://doi.org/10.1016/j.tcs.2017.02.020
https://doi.org/10.1016/j.tcs.2017.02.020
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⟩
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
https://hal-normandie-univ.archives-ouvertes.fr/hal-02113307
Autor:
Heejin Park, Laurent Mouchard, Martine Lonard, Kunsoo Park, Joong Chae Na, Hyunjoon Kim, Thierry Lecroq
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, Elsevier, 2016, 638, pp.159-170. ⟨10.1016/j.tcs.2015.08.008⟩
Theoretical Computer Science, Elsevier, 2016, 638, pp.159-170. ⟨10.1016/j.tcs.2015.08.008⟩
In this paper we propose the FM-index of alignment, a compressed index for similar strings with the functionalities of pattern search and random access. For this, we first design a new and improved version of the suffix array of alignment. The FM-ind
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::629b5ca00076c8a20e1ccda7d02bd141
https://doi.org/10.1016/j.tcs.2015.08.008
https://doi.org/10.1016/j.tcs.2015.08.008
Autor:
Laurent Mouchard, Alice Héliou, Yann Ramusat, Gregory Kucherov, Solon P. Pissis, Maxime Crochemore
Publikováno v:
Information and Computation
Information and Computation, Elsevier, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩
Information and Computation, 270
Information and Computation, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩
Information and Computation, Elsevier, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩
Information and Computation, 270
Information and Computation, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩
International audience; An absent word of a word y is a word that does not occur in y. It is then called minimal if all its proper factors occur in y. In fact, minimal absent words (MAWs) provide useful information about y and thus have several appli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b389a4f220fdb3280995a806278e4c8
https://doi.org/10.1016/j.ic.2019.104461
https://doi.org/10.1016/j.ic.2019.104461
Autor:
Cl��ment, Levin, Emeric, Dynomant, J, Gonzalez Bruno, Laurent, Mouchard, David, Landsman, Eivind, Hovig, Kristian, Vlahovicek
Since the advent of next-generation sequencing in the early 2000s, the volume of bioinformatics software tools and databases has exploded and continues to grow rapidly. Documenting this evolution on a global and time-dependent scale is a challenging
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::843717807846f98cd3e2a14f4c61a895
http://arxiv.org/abs/1807.06808
http://arxiv.org/abs/1807.06808
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
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
https://hal.archives-ouvertes.fr/hal-01956358
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
http://arxiv.org/abs/1708.01130
Autor:
Carl Barton, Laurent Mouchard, Solon P. Pissis, Kunsoo Park, Costas S. Iliopoulos, In-Bok Lee
Publikováno v:
Theoretical Computer Science. 525:80-88
Recently, the problem of extending an alignment with k-mismatches and a single gap for pairwise sequence alignment was introduced (Flouri et al., 2011). The authors considered the problem of extending an alignment under the Hamming distance model by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae49dc4f8aa731ffc598871f5caaa86d
https://doi.org/10.1016/j.tcs.2013.06.012
https://doi.org/10.1016/j.tcs.2013.06.012
Autor:
Solon P. Pissis, Yann Ramusat, Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783662557501
FCT
Crochemore, M, Heliou, A, Kucherov, G, Mouchard, L, Pissis, S P & Ramusat, Y 2017, Minimal Absent Words in a Sliding Window and Applications to
Pattern Matching . in R Klasing & M Zeitoun (eds), Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11--13, 2017, Proceedings . vol. 10472, Lecture Notes in Computer Science, Berlin, Heidelberg, pp. 164-176 . https://doi.org/10.1007/978-3-662-55751-8_14
Fundamentals of Computation Theory
Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.164-176, ⟨10.1007/978-3-662-55751-8_14⟩
FCT
Crochemore, M, Heliou, A, Kucherov, G, Mouchard, L, Pissis, S P & Ramusat, Y 2017, Minimal Absent Words in a Sliding Window and Applications to
Pattern Matching . in R Klasing & M Zeitoun (eds), Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11--13, 2017, Proceedings . vol. 10472, Lecture Notes in Computer Science, Berlin, Heidelberg, pp. 164-176 . https://doi.org/10.1007/978-3-662-55751-8_14
Fundamentals of Computation Theory
Fundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.164-176, ⟨10.1007/978-3-662-55751-8_14⟩
An absent (or forbidden) word of a word y is a word that does not occur in y. It is then called minimal if all its proper factors occur in y. There exist linear-time and linear-space algorithms for computing all minimal absent words of y (Crochemore
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94fe08a6767f1280df20b4c73917468b
https://doi.org/10.1007/978-3-662-55751-8_14
https://doi.org/10.1007/978-3-662-55751-8_14