Talks
-
FM-index of an alignment: A compressed index for highly similar strings
slides
Séminaire du LIGM
Marne-la-Vallée, France, March 2016
-
Indexation de sequences fortement similaires
slides
Journee mathematiques / informatique,
Caen, France, May 2015
-
From Indexing Data Structures to de Bruijn Graphs (talk given by Bastien Cazaux)
SeqBio 2014 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Montpellier, France, November 2014
-
Recherches de mot dans des séquences similaires(talk given by Nadia Ben Nsira)
SeqBio 2014 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Montpellier, France, November 2014
-
A fast pattern matching algorithm for highly similar sequences
Workshop on Data mining from genomic rare variants and its application to genome-wide analysis (Satellite workshop of BIBM 2014), Belfast, UK, November 2014
-
Construction d'un graphe de de Bruijn compact à partir d'un arbre des suffixes
Journée de l'Axe Algorithmique et Combinatoire de NormaStic, Caen, France, Octobre 2014
-
Recherches de mot dans des séquences similaires(talk given by Nadia Ben Nsira)
Journée de l'Axe Algorithmique et Combinatoire de NormaStic, Caen, France, Octobre 2014
-
[English]
From Indexing Data Structures to de Bruijn Graphs (talk given by Eric Rivals)
Combinatorial Pattern Matching, Moscow, Russia, June 2014
-
[English]
Omic Data Modelling for Information Retrieval (talk given by Chloé Cabot)
International Work-Conference on Bioinformatics and Biomedical Engineering, Granada, Spain, April 2014
-
[English]
On-line string matching in highly similar DNA sequences
International Conference on Algorithms for Big Data, Palermo, Italy, April 2014
-
[English]
Suffix tree and suffix array of an alignment
slides
SeqBio 2013 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Montpellier, France, November 2013
-
[English]
Abelian repetitions in Sturmian words
slides
SeqBio 2013 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Montpellier, France, November 2013
-
[English]
Suffix Array of Alignment: A Practical Index for Similar Data (talk given by Jong-Chae Na)
String Processing and Information Retrieval Symposium, Jerusalem, Israel, October 2013
-
[English]
Abelian Repetitions in Sturmian Words (talk given by Filippo Mignosi)
International Conference on Developments in Language Theory, Marne-la-Vallée France, June 2013
-
[English]
Fast Searching in Biological Sequences Using Multiple Hash Functions (talk given by Simone Faro)
International Conference on Bioinformatics and Bioengineering, Larnaca, Cyprus, November 2012
-
[English]
Quasi-Linear Time Computation of Abelian Periods of a Word
slides
SeqBio 2012 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Marne-la-Vallée, France, November 2012
-
[English]
Linear Computation of Unbordered Conjugate (talk given by Arnaud Lefebvre)
slides
SeqBio 2012 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Marne-la-Vallée, France, November 2012
-
[English]
Three new strategies for exact string matching
slides
SeqBio 2012 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Marne-la-Vallée, France, November 2012
-
[English]
EVA: Exome Variation Analyzer, a convivial tool for filtering strategies
slides
Seminar of GenScale team
IRISA, Rennes, France, October 2012
-
Linear Computation of Unbordered Conjugate
(talk given by Arnaud Lefebvre)
14th Mons Days of Theoretical Computer Science
Louvain-la-Neuve, Belgium, September 2012
-
[English]
Quasi-linear Time Computation of the Abelian Periods of a Word
(talk given by Arnaud Lefebvre)
Prague Stringology Conference, PSC 2012
Prague, Tcheque Republic, August 2012
-
[English]
A Fast Suffix Automata Based Algorithm for Exact Online String Matching (talk given by Simone Faro)
17th International Conference on Implementation and Application of Automata, CIAA 2012
Porto, Portugal, July 2012
-
[English]
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
slides
11th International Symposium on Experimental Algorithms, SEA 2012
Bordeaux, France, June 2012
-
[English]
2001-2010: Ten Years of Exact String Matching Algorithms
London Stringology Days / London Algorithmic Workshop 2012, LSD and LAW 2012, London, UK, February 2012
-
[English]
2001-2010: Ten Years of Exact String Matching Algorithms
SeqBio 2011 : Algorithmique, combinatoire du texte
et applications en bio-informatique,
Lille, France, December 2011
-
[English]
Spell-checking queries by combining Levenshtein and Stoilos distances
slides
NETTAB 2011
Pavia, Italy, October 2011
-
[English]
EVA: Exome Variation Analyzer, a convivial tool for filtering strategies
slides
NETTAB 2011
Pavia, Italy, October 2011
-
[English]
2001-2010: Ten Years of Exact String Matching Algorithms
Prague Stringology Conference,
Prague, Tcheque Republic, August 2011
-
Computing Abelian periods in words (talk given by A. Lefebvre)
Séminaire MaMuX IRCAM, Paris, France, May 2011
-
An Efficient Motif Search Algorithm based on a minimal Forbidden Patterns Approach
Séminaire MaMuX IRCAM, Paris, France, May 2011
-
[English]
An Efficient Motif Search Algorithm based on a Minimal Forbidden Patterns Approach
(talk given by T. El-Falah)
5th International Conference on Practical Applications of Computational Biology and Bioinformatics, Salamanca, Spain,
April, 2011
-
[English]
Computing Abelian Periods
London Stringology Days / London Algorithmic Workshop 2011, LSD and LAW 2011, London, UK, February 2011
-
Computing Abelian Periods in Words
(talk given by G. Fici)
Workshop Algorithmique, combinatoire du texte et applications en bio-informatique, Rennes, France, January 2011
-
A solution to index large set of short reads slides
(talk given by M. Salson)
Workshop Algorithmique, combinatoire du texte et applications en bio-informatique, Rennes, France, January 2011
-
[English]
Indexing Structures and Next Generation Sequencing (NGS)
slides
Journées Montoises d'Informatique Théorique/
Mons Theoretical Computer Science Days
Amiens, France, September 2010
-
[English]
Alignments in 2D and efficient matching on encoded binary strings
slides
Optimization and Learning:
Theory, Algorithms and Applications 2010
Metz, France, June 2010
-
[English]
Twenty years of CPM
slides
CPM 2009
Lille, France, June 2009
-
[English]
An experimentscient matching algorithm for encoded DNA sequences and binary strings
slides
CPM 2009
Lille, France, June 2009
-
[English]
Dynamic Suffix Array with experiments and a specific emphasis on LCP arrays
(talk given by M. Salson) slides
Stringology 2009
Bar Ilan University, Tel Aviv, Israel, April 2009
-
[English]
Dynamic Burrows-Wheeler Transform
(talk given by L. Mouchard) slides
Stringology 2009
Bar Ilan University, Tel Aviv, Israel, April 2009
-
[English]
Dynamic Extended Suffix Arrays
(talk given by M. Salson) slides
London String Days and London Algorithmics Workshop
London, UK, February 2009
-
[French]
Algorithmique du texte et nouvelles technologies de l'information
slides
Fête de la Science
Saint-Étienne-du-Rouvray, France, November 2008
-
[English]
Dynamic Burrows-Wheeler Transform
(talk given by M. Salson) slides
Prague Stringology Conference
Prague, Tcheque Republic, September 2008
-
[English]
Efficient Variants of the Backward-Oracle-Matching Algorithm
(talk given by S. Faro) slides
Prague Stringology Conference
Prague, Tcheque Republic, September 2008
-
[French]
Une nouvelle heuristique pour l'alignement de motifs 2D par programmation dynamique
(talk given by A. Pauchet) slides
Journées Francophones de Planification, Décision et Apprentissage pour la
conduite des systèmes
Metz, France, June 2008
-
[English]
Global and local alignements in 2D
slides
London String Days and London Algorithmics Workshop
London, UK, February 2008
-
[English]
Efficient validation and generation of Knuth-Morris-Pratt arrays (talk given by A. Lefebvre)
Conference in Honor of Donald E. Knuth
Bordeaux, France, October 2007
-
[French]
Énumeration et caractérisation des arbres compacts des suffixes (talk given by N. Philippe) slides
Journées Algorithmique, combinatoire du texte et applications à la bioinformatique
Marne-la-Vallée, France, September 2007
-
[French]
Validation et génération de tableaux de Knuth-Morris-Pratt slides
Journées Algorithmique, combinatoire du texte et applications à la bioinformatique
Marne-la-Vallée, France, September 2007
-
[French]
Algorithmes rapides pour la recherche de mot slides
Séminaire Combinatoire et Algorithmes du LITIS
Rouen, France, April 2007
-
[English]
Fast string matching algorithms slides
London Algorithms Workshop
London, UK, February 2007
-
[English]
On-line Construction of Compact Suffix Vectors and Maximal Repeats (talk given by É. Prieur) slides
Journées Montoises
Rennes, France, August 2006
-
[English]
Efficient validation and construction of border arrays slides
Journées Montoises
Rennes, France, August 2006
-
[English]
Efficient validation and construction of border arrays slides
London String Days
London, UK, February 2006
-
[French]
Différentes applications de l'oracle des facteurs slides
Séminaire du LMI,
Rouen, France, February 2006
-
[French]
Validation de tableaux de bords slides
Journées Algorithmique génomique du programme MathStic
Orsay, France, November 2005
-
[French]
Calcul linéaire de toutes les périodes d'un mot
Séminaire du LARIA
Amiens, France, February 2004
-
[French]
Recherche de répétitions dans les séquences nucléiques slides
Séminaire du PSI
Rouen, France, January 2004
-
[French]
Calcul linéaire de toutes les périodes d'un mot slides
AS Indexation et Motifs
Montpellier, France, November 2003
-
[English]
Linear-Time Computation of Local Periods (talk given by A. Lefebvre) slides
MFCS'03
Bratislava, Slovakia, August 2003
-
[English]
Linear-Time Computation of Local Periods slides
London String Day
London, UK, February 2003
-
[French]
Recherche de répétitions exactes et approximatives dans les séquences biologiques compl\`etes ou non
Programme Bioinformatique inter EPST
Paris, France, October 2002
-
[French]
Différentes applications de l'oracle des facteurs
Séminaire du LaBRI
Bordeaux, France, March 2002
-
[French]
Algorithmes de recherche de répétitions distantes dans les génomes slides
ALBIO
Montpellier, France, March 2002
-
[French]
Recherche delta- et gamma-approchée dans les séquences musicales
Séminaire de l'IGM
Marne-la-Vallée, France, December 2001
-
[English]
Approximate string matching in musical sequences
PSC'01
Prague, Tcheque Republic, September 2001
-
[French]
Différentes applications de l'oracle des facteurs d'un mot
Séminaire du GREYC
Caen, France, April 2001
-
[French]
Différentes applications de l'oracle des facteurs d'un mot
Séminaire du LIM
Marseille, France, April 2001
-
[English]
Different applications of the factor oracle of a word
Séminaire du Département d'Informatique du King's College London
London, UK, February 2001
-
[English]
New experimental results in string matching
London Algorithms Workshop
London, UK, December 2000
-
[French]
Les méthodes d'alignements dans l'analyse des séquences
TAS
Évry, France, November 2000
-
[English]
New experimental results in string matching
Séminaire d'Algorithmique de l'Université de Varsovie
Warsaw, Poland, November 2000
-
[English]
Computing repeated factors with a factor oracle
AWOCA'00
Hunter Valley, Australia, August 2000
-
[English]
Exact string matching techniques for delta and gamma approximate string matching
London String Days
London, UK, April 2000
-
[French]
Une introduction à la recherche de mot
École Jeunes Chercheurs Algorithmique et Calcul Formel du GDR ALP
Caen, France, March 2000
-
[English]
Java tools to help understanding pattern matching techniques
CAEE'99
Sofia, Bulgaria, September 1999
-
[French]
Aspects théoriques et pratiques de la recherche de mot
Séminaire du LIH
Le Havre, France, September 1999
-
[English]
Fast practical multi pattern matching
Séminaire de la School of Computing, Curtin University of Technology
Perth, Australia, September 1999
-
[English]
Theoretical and practical string matching
AWOCA'99
Perth, Australia, August 1999
-
[English]
The Boyer-Moore String Matching Algorithm and its Variants: A Survey
PSCW'99
Prague, Tcheque Republic, July 1999
-
[French]
Algorithmes de recherche de mot de type Boyer-Moore
Séminaire du GREYC
Caen, France, March 1999
-
[English]
Practical string matching
London Theory Day
London, UK, February 1999
-
[French]
Combinatoire et génome
Journée du LIFAR
Rouen, France, February 1999
-
[English]
Practical aspects of string matching
LoRIA
Nancy, France, February 1999
-
[French]
Recherche de motifs
École thématique CNRS Traitement de l'information en biologie moléculaire
Asnelles-sur-Mer, France, November 1998
-
[English]
Exact string matching animation in Java
PSCW'98
Prague, Tcheque Republic, September 1998
-
[English]
Theoretical and practical aspects of string matching
NACSA'98
Plovdiv, Bulgaria, August 1998
-
[English]
A very fast string matching algorithm for small alphabets and long patterns
CPM'98
Piscataway, New Jersey, July 1998
-
[English]
Tight bounds on the complexity of the Apostolico-Giancarlo string matching algorithm
Liapunov Institute
Moscow, Russia, April 1998
-
[French]
Recherche de motif en deux dimensions
Séminaire du LIR
Rouen, France, February 1994
-
[English]
Fast Multi-Pattern Matching
Columbia University
New York, Septembre 1993
-
[French]
Recherche rapide d'un ensemble fini de mots
Séminaire du LIR
Rouen, France, April 1993
-
[French]
Algorithmes Turbo pour la recherche de mot.
Séminaire de l'IGM
Marne-la-Vallée, France, November 1992
-
[French]
Algorithmes Turbo pour la recherche de mot
Séminaire du LITP
Paris, France, April 1992
-
[French]
Une amélioration de deux algorithmes de string-matching
Séminaire du LIFO
Orléans, France, January 1992
-
[French]
Utilisation d'automates pour la recherche de mot
Journées Informatique et Génome
Paris, France, December 1991
-
[English]
Variations sur l'algorithme de Boyer-Moore
Journées Franco-Belges
Rouen, France, September 1991
-
[English]
A variation on the Boyer-Moore algorithm
Séminaire d'Algorithmique de l'Université de Varsovie
Warsaw, Poland, April 1991
-
[English]
A variation on the Boyer-Moore algorithm
CPM'91
London, UK, april 1991
-
[English]
A variation on the Boyer-Moore algorithm
CPM'90
Paris, France, July 1990
|