Laurent Mouchard
Publications
Publications
|
|
Efficient pattern matching in degenerate strings with the Burrows–Wheeler transformInformation Processing Letters, 2019, 147, pp.82-87. ⟨10.1016/j.ipl.2019.03.003⟩ |
|
|
Absent words in a sliding window with applicationsInformation and Computation, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩ |
|
|
FM-index of alignment with gapsTheoretical Computer Science, 2018, 710, pp.148 - 157. ⟨10.1016/j.tcs.2017.02.020⟩ |
|
|
FM-index of alignment: A compressed index for similar stringsTheoretical Computer Science, 2016, 638, pp.159 - 170. ⟨10.1016/j.tcs.2015.08.008⟩ |
|
|
Efficient dynamic range minimum queryTheoretical Computer Science, 2016, 656, pp.108-117. ⟨10.1016/j.tcs.2016.07.002⟩ |
Dealing with uncertainty and imprecision in image segmentation using belief function theoryInternational Journal of Approximate Reasoning, 2014, 55 (1), pp.376-87 |
|
|
|
Linear-time computation of minimal absent words using suffix arrayBMC Bioinformatics, 2014, 15, pp.11. ⟨10.1186/s12859-014-0388-9⟩ |
|
|
On the number of elements to reorder when updating a suffix arrayJournal of Discrete Algorithms, 2012, 11, pp.87-99. ⟨10.1016/j.jda.2011.01.002⟩ |
Algorithms for mapping short degenerate and weighted sequences to a reference genomeInternational journal of computational biology and drug design, 2010, 2 (4), pp.385--397 |
|
A fast and efficient algorithm for mapping short sequences to a reference genomeAdvances in Experimental Medicine and Biology, 2010, Accepted |
|
Dynamic Extended Suffix ArraysJournal of Discrete Algorithms, 2010, 8 (2), pp.241-257 |
|
Dynamic Extended Suffix ArrayJournal of Discrete Algorithms, 2010, 8 (2), pp.241--257 |
|
A Four-Stage Algorithm for Updating a Burrows-Wheeler TransformTheoretical Computer Science, 2009, 43 (10), pp.4350-4359 |
|
efficient dynamic suffix arrayACM Journal of Experimental Algorithmics, 2009, pp.en révision |
|
A four-stage algorithm for updating a Burrows-Wheeler TranformTheoretical Computer Science, 2009, 410 (43), pp.4350--4359 |
|
A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern MatchingMathematics in Computer Science, 2008, 1 (4), pp.557--569 |
|
A Linear Algorithm for the Detection of Evolutive Tandem RepeatsJournal of Automata Languages and Combinatorics, 2005, 10 (5/6), pp.671--685 |
|
Computing the Repetitions in a Biological Weighted SequenceJournal of Automata Languages and Combinatorics, 2005, 5 (6), pp.687--696 |
|
Analysis of virtual two-dimensional gels based upon affinity capillary electrophoresis hyphenated to ion trap mass spectrometryElectrophoresis, 2005, 26 (7-8), pp.1466--1475 |
|
Whole-genome shotgun assembly and comparison of human genome assembliesProceedings of the National Academy of Sciences of the United States of America, 2004, 101 (7), pp.1916-1921 |
|
Speeding up the detection of evolutive tandem repeatsTheoretical Computer Science, 2004, 310, pp.309-328 |
|
String Regularities with Don't Cares (extended version)Nordic Journal of Computing, 2003, 10 (1), pp.40-51 |
|
Algorithms For Computing Approximate Repetitions In Musical SequencesInternational Journal of Computer Mathematics, 2002, 79 (11), pp.1135-1148. ⟨10.1080/00207160213939⟩ |
|
The sequence of the Human GenomeScience, 2001, 291 (5507), pp.1304-1351 |
|
Distributed pattern matching using finite automataJournal of Automata Languages and Combinatorics, 2001, 6 (2), pp.191-204 |
|
Normal forms of quasiperiodic stringsTheoretical Computer Science, 2000, 249 (2), pp.313-324 |
|
Sequences obtained from a series of permutations of borders and ultimately periodic words.Journal of Automata Languages and Combinatorics, 1999, 4 (3), pp.205-211 |
|
Quasiperiodicity and string coveringTheoretical Computer Science, 1999, 218 (1), pp.205-216 |
|
A mechanical approach to the distribution and orientation of genes on genetic mapsMolecular Microbiology, 1998, 27 (1), pp.235-237. ⟨10.1046/j.1365-2958.1998.00669.x⟩ |
Re-expression of the neurodevelopmental protein filamin A in glioblastoma via signaling switch of the urotensin II vasoactive peptide receptor22nd International Symposium on Regulatory Peptides, Sep 2018, Acapulco, Mexico |
|
GPCR’s activity is controlled by Filamin A in glioblastoma7th annual meeting annuel GDR GPCR, Oct 2018, Strasbourg, France |
|
Three Strategies for the Dead-Zone String Matching AlgorithmProceedings of the Prague Stringology Conference 2018, Aug 2017, Prague, Czech Republic. pp.117--128 |
|
Re-expression de la Filamine A dans les gliomes de haut grade - Rôle clé dans le switch invasif relayé par les récepteurs chimiotactiques.11èmes journées scientifiques du Cancéropôle Nord-Ouest, May 2018, Deauville, France |
|
|
|
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern MatchingFundamentals of Computation Theory, Sep 2017, Bordeaux, France. pp.164 - 176, ⟨10.1007/978-3-662-55751-8_14⟩ |
|
|
Parallelising the Computation of Minimal Absent WordsPPAM 2015, Sep 2015, Cracovie, Poland. ⟨10.1007/978-3-319-32152-3_23⟩ |
Étude in vitro et in vivo d’un nouveau traceur TEMP de l’apoptoseColloque de Médecine Nucléaire de Langue Française, 2013, Rouen, France |
|
Using belief function theory to deal with uncertainties and imprecisions in image processingxxxx, 2012, Compiègne, France |
|
Using belief function theory to deal with uncertainties and imprecisions in image processingAdvances in Intellingent and Soft Computing, 2012, France. pp.197-204 |
|
Segmentation of 18F-Miso PET imagesInternational Conference on Molecular Imaging in Radiation Oncology (MIRO), Mar 2012, Vienne, Austria |
|
Construction of parametric images to support the segmentation of BTV from PET images using belielf function theoryIn International Conference on Molecular Imaging in Radiation Oncology (MIRO), Mar 2012, Vienne, Austria |
|
Segmentation of 18F-Miso PET imagesThe annual meeting of The Society of Nuclear Medicine & Molecular Imaging (SNMMI), May 2012, Miami, United States. suppl 1 |
|
|
|
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations8th International Conference on Artificial Intelligence Applications and Innovations (AIAI), Sep 2012, Halkidiki, Greece. pp.584-592, ⟨10.1007/978-3-642-33412-2_60⟩ |
Segmentation of biological target volumes on multi-tracer pet images based on information fusion for achieving dose painting in radiotherapyInternational Conference on Medical Image Computing and Computer Assisted Intervention (MICCAI), Oct 2012, Nice, France. pp.545-552 |
|
Segmentation of biological target volumes on multi-tracer PET images based on information fusion for achieving dose painting in radiotherapy.MICCAI, Oct 2012, Nice, France. pp.545-52 |
|
Fusion d'images TEP multitraceurs par la théorie des fonctions de croyance4èmes journées scientifiques du Cancéropôle Nord-Ouest, May 2011, Deauville, France |
|
Modélisation et fusion d'images TEP par la théorie des fonctions de croyanceRecherche en Imagerie et Technologies pour la Santé (RITS), Apr 2011, Rennes, France |
|
Fusion d'images basée sur la modélisation spatiale d'incertitudes et d'imprécisions par la théorie des fonctions de croyanceXXIIIème colloque GRETSI, Sep 2011, Talence, France |
|
Coût d'une mise à jour de la table des suffixesJournées GdT COMATEGE du GDR IM, 2010, Montpellier, France |
|
Average Complexity for Updating a Suffix ArrayLondon Stringology Days, 2010, United Kingdom. Accepted |
|
Efficient Dynamic Range Minimum QueryInternational Stringology Conference, 2010, Tel Aviv, Israel |
|
Dynamic range minimum queriesThe 9th International Stringology Conference, 2010, Israel |
|
REAL: REad ALigner is an efficient short-read mapping toolLondon Stringology Days, 2010, United Kingdom. Accepted |
|
Sliding a Suffix Array Along a TextLondon Stringology Days, 2010, United Kingdom. Accepted |
|
REAL: An efficient REad ALigner for next generation sequencing readsAssociation for Computing Machinery - Bioinformatics and Computational Biology, 2010, United States. Accepted |
|
Mapping uniquely occurring short sequences derived from high throughput technologies to a reference genomeInternational Conference on Information Technology and Applications in Biomedicine, 2009, Cyprus. In press |
|
Dynamic Burrows-Wheeler TransformStringology Research Workshop 09, 2009, Tel Aviv, Israel |
|
Dynamic Extended Suffix ArraysLondon String Days and London Algorithmics Workshop, 2009, France |
|
Dynamic Suffix Array with experiments and a specific emphasis on LCP arraysStringology Research Workshop 09, 2009, Tel Aviv, Israel |
|
Practical and efficient algorithms for degenerate and weighted sequences derived from high throughput sequencing technologiesInternational Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing 2009, 2009, China. pp.174--180 |
|
A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing TechnologiesInternational Conference on Parallel Computing, 2009, France. In press |
|
Dynamic Burrows-Wheeler TransformPrague Stringology Conference, 2008, Czech Republic. pp.13--25 |
|
Dynamic Burrows-Wheeler TransformPrague Stringology Conference, 2008, Prague, Czech Republic. pp.13-25 |
|
Pattern Matching in Degenerate DNA/RNA SequencesWorkshop on Algorithms and Computation, 2007, Bangladesh. pp.109--120 |
|
Fast Practical Exact and Approximate Pattern Matching in Protein SequencesAustralasian Workshop On Combinatorial Algorithms, 2007, Australia. pp.xxx-xxx |
|
Pattern matching in degenerate DNA/RNA sequencesXXXXX, 2007, Dhaka, Bangladesh. pp.109-120 |
|
Experimental Results in Pattern Matching on Weighted SequencesInternational Conference on Numerical Analysis and Applied Mathematics, Sep 2005, Greece. pp.xxx-xxx |
|
Réalisation de gels virtuels pour l’analyse interactomiqueCongrès de la Société Française d’Electrophorèse et d’Analyse Protéomique, Oct 2004, Bordeaux, France |
|
Computing the repetitions in a weighted sequencePrague Stringology Conference, 2003, Prague, Czech Republic. pp.91-98 |
|
A linear algorithm for the detection of evolutive tandem repeatsPrague Stringology Conference, 2003, Czech Republic. pp.77-90 |
|
String Regularities with don't caresPrague Stringology Club Workshop, 2002, Czech Republic. pp.49-59 |
|
Evolutive tandem repeats using Hamming distance27th International Symposium on Mathematical Foundations of Computer Science, 2002, Otwock, Poland. pp.292-304 |
|
Le projet GénoGRID : une grille expérimentale pour la génomiqueJournées Ouvertes Biologie Informatique et Mathématiques, 2002, Saint Malo, France. pp.27-32 |
|
The Max-Shift algorithm for approximate string matchingWorskhop on Algorithms and Experiments, 2001, United Kingdom. pp.13-25 |
|
Computing repetitions in musical sequencesProceedings of the Prague Stringology Club Worshop, 2000, Slovakia. pp.49-59 |
|
Motif evolution in polyphonic musical sequences11th Australasian Workshop On Combinatorial Algorithms, 2000, Australia. pp.49-59 |
|
Periods and quasiperiods characterization11th Conference on Combinatorial Pattern Matching, 2000, France. pp.388-396 |
|
Distributed string matching using finite automata10th Australasian Workshop On Combinatorial Algorithms, 1999, Australia. pp.114-128 |
|
|
|
Algorithms for computing approximate repetitions in musical sequencesAustralasian Workshop On Combinatorial Algorithms, 1999, Australia. pp.129-144 |
An O(n log n) Algorithm for Computing all Maximal Quasiperiodicities in StringsCATS, 1999, New Zealand. pp.262-272 |
|
Canonical decompositions of quasiperiodic words9th Australasian Workshop On Combinatorial Algorithms, 1998, Australia. pp.74-84 |
|
Improving the significance of biological sequences comparison scoreFirst international Conference on Computational Biology, 1997, Washington D.C., United States. pp.21 |
Combinatorial Pattern MatchingJournal of Discrete Algorithms, pp.635, 2007 |
Using belief function theory to deal with uncertainties and imprecisions in image processingBelief functions: Theory and applications In: Advances in Intelligent and Soft Computing, SPRINGER, pp.197-204, 2012 |
|
Evolutive tandem repeats : a surveyNato Book Series on Stringology, King's College London Publications, pp.75-108, 2004 |
Modélisation et fusion d'images multi-traceurs TEP par la théorie des fonctions de croyance2010 |
|
Superpositions dans les séquences1998 |
|
Computing all motif occurrences in polyphonic musical sequences1998 |
|
Optimal computation of all the repetitions in a string1998 |
|
|
Le notebook. Une forme intelligible du numérique ? Un objet écosophique ?2022 |
|
|
FM-index of Alignment with Gaps2018 |
|
|
Efficient pattern matching in degenerate strings with the Burrows-Wheeler transform2018 |