Search Results - "Mouchard, Laurent"
-
1
Linear-time computation of minimal absent words using suffix array
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
Algorithms For Computing Approximate Repetitions In Musical Sequences
Published in International journal of computer mathematics (01-01-2002)“…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
FM-index of alignment: A compressed index for similar strings
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
Editorial
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-03-2015)Get full text
Journal Article -
5
Dealing with uncertainty and imprecision in image segmentation using belief function theory
Published in International journal of approximate reasoning (01-01-2014)“…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
Efficient dynamic range minimum query
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
Editorial
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-12-2012)Get full text
Journal Article -
8
Extending alignments with k-mismatches and ℓ-gaps
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
-
10
Whole-Genome Shotgun Assembly and Comparison of Human Genome Assemblies
Published in Proceedings of the National Academy of Sciences - PNAS (17-02-2004)“…We report a whole-genome shotgun assembly (called WGSA) of the human genome generated at Celera in 2001. The Celera-generated shotgun data set consisted of 27…”
Get full text
Journal Article -
11
Combinatorial Pattern Matching
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-12-2007)Get full text
Journal Article -
12
On the number of elements to reorder when updating a suffix array
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-02-2012)“…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
Dynamic extended suffix arrays
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-06-2010)“…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
A Four-Stage Algorithm for Updating a Burrows-Wheeler Transform
Published in Theoretical computer science (2009)Get full text
Journal Article -
15
An algorithm for mapping short reads to a dynamically changing genomic sequence
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (2012)“…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
A fast and efficient algorithm for mapping short sequences to a reference genome
Published in Advances in experimental medicine and biology (2010)“…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
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching
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
Querying highly similar sequences
Published in International journal of computational biology and drug design (2013)“…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
Segmentation of 18F-Miso PET images
Published in Journal of Nuclear Medicine (2012)Get full text
Conference Proceeding -
20
Segmentation of biological target volumes on multi-tracer PET images based on information fusion for achieving dose painting in radiotherapy
Published in Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention (2012)“…Medical imaging plays an important role in radiotherapy. Dose painting consists in the application of a nonuniform dose prescription on a tumoral region, and…”
Get more information
Journal Article