Search Results - "Mouchard, Laurent"

Refine Results
  1. 1

    Linear-time computation of minimal absent words using suffix array by Barton, Carl, Heliou, Alice, Mouchard, Laurent, Pissis, Solon P

    Published in BMC bioinformatics (20-12-2014)
    “…An absent word of a word y of length n is a word that does not occur in y. It is a minimal absent word if all its proper factors occur in y. Minimal absent…”
    Get full text
    Journal Article
  2. 2

    Algorithms For Computing Approximate Repetitions In Musical Sequences by Cambouropoulos, Emilios, Crochemore, Maxime, Iliopoulos, Costas, Mouchard, Laurent, Pinzon, Yoan

    “…Here we introduce two new notions of approximate matching with application in computer assisted music analysis. We present algorithms for each notion of…”
    Get full text
    Journal Article
  3. 3

    FM-index of alignment: A compressed index for similar strings by Na, Joong Chae, Kim, Hyunjoon, Park, Heejin, Lecroq, Thierry, Léonard, Martine, Mouchard, Laurent, Park, Kunsoo

    Published in Theoretical computer science (25-07-2016)
    “…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…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Dealing with uncertainty and imprecision in image segmentation using belief function theory by Lelandais, Benoît, Gardin, Isabelle, Mouchard, Laurent, Vera, Pierre, Ruan, Su

    “…In imaging, physical phenomena and the acquisition system are responsible for noise and the partial volume effect, respectively, which affect the uncertainty…”
    Get full text
    Journal Article
  6. 6

    Efficient dynamic range minimum query by Heliou, A., Léonard, M., Mouchard, L., Salson, M.

    Published in Theoretical computer science (20-12-2016)
    “…The Range Minimum Query problem consists in answering efficiently the simple question: “what is the minimal element between two specified indices of a given…”
    Get full text
    Journal Article
  7. 7
  8. 8

    Extending alignments with k-mismatches and ℓ-gaps by Barton, Carl, Iliopoulos, Costas S., Lee, Inbok, Mouchard, Laurent, Park, Kunsoo, Pissis, Solon P.

    Published in Theoretical computer science (13-03-2014)
    “…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…”
    Get full text
    Journal Article
  9. 9
  10. 10
  11. 11
  12. 12

    On the number of elements to reorder when updating a suffix array by Léonard, M., Mouchard, L., Salson, M.

    “…Recently new algorithms appeared for updating the Burrows–Wheeler Transform or the suffix array, when the text they index is modified. These algorithms proceed…”
    Get full text
    Journal Article
  13. 13

    Dynamic extended suffix arrays by Salson, M., Lecroq, T., Léonard, M., Mouchard, L.

    “…The suffix tree data structure has been intensively described, studied and used in the eighties and nineties, its linear-time construction counterbalancing his…”
    Get full text
    Journal Article
  14. 14
  15. 15

    An algorithm for mapping short reads to a dynamically changing genomic sequence by Iliopoulos, Costas S., Kourie, Derrick, Mouchard, Laurent, Musombuka, Themba K., Pissis, Solon P., de Ridder, Corne

    “…Next-generation sequencing technologies have redefined the way genome sequencing is performed. They are able to produce tens of millions of short sequences…”
    Get full text
    Journal Article
  16. 16

    A fast and efficient algorithm for mapping short sequences to a reference genome by Antoniou, Pavlos, Iliopoulos, Costas S, Mouchard, Laurent, Pissis, Solon P

    “…Novel high-throughput (Deep) sequencing technology methods have redefined the way genome sequencing is performed. They are able to produce tens of millions of…”
    Get more information
    Journal Article
  17. 17

    A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching by Iliopoulos, Costas S., Mouchard, Laurent, Rahman, M. Sohel

    Published in Mathematics in computer science (01-06-2008)
    “… In this paper, we consider the pattern matching problem in DNA and RNA sequences where either the pattern or the text can be degenerate , i.e., contain sets…”
    Get full text
    Journal Article
  18. 18

    Querying highly similar sequences by Barton, Carl, Giraud, Mathieu, Iliopoulos, Costas S, Lecroq, Thierry, Mouchard, Laurent, Pissis, Solon P

    “…In this paper, we present a solution to the extreme similarity sequencing problem. The extreme similarity sequencing problem consists of finding occurrences of…”
    Get more information
    Journal Article
  19. 19
  20. 20