Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

252 résultats
Page :
triés par
Image document

Forty Years of Suffix Trees

 Alberto Apostolico , Maxime Crochemore , Martín Farach-Colton , Zvi Galil , S. Muthukrishnan
Communications of the ACM, 2016, 59 (4), pp.66-73. ⟨10.1145/2810036⟩
Article dans une revue hal-01830856v1
Image document

Indexing a sequence for mapping reads with a single mismatch

 Maxime Crochemore , Alessio Langiu , M. Sohel Rahman
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2014, 2 (20130167), pp.1-18. ⟨10.1098/rsta.2013.0167⟩
Article dans une revue hal-01375933v1
Image document

Motifs in Sequences: Localization and Extraction

 Maxime Crochemore , Marie-France Sagot
Konopka A. K., Crabbe M. J. C. Compact Handbook of Computational Biology, Marcel Dekker, New York, pp.47-97, 2004
Chapitre d'ouvrage hal-00620799v1

A solution to P12

 Maxime Crochemore
Bulletin- European Association for Theoretical Computer Science, 1983, 19 (1), pp.15-16
Article dans une revue hal-00619549v1
Image document

Direct construction of compact Directed Acyclic Word Graphs

 Maxime Crochemore , Renaud Vérin
Combinatorial Pattern Matching (Aarhus, 1997), 1997, France. pp.116-129
Communication dans un congrès hal-00620006v1

Constant-Space String Matching

 Maxime Crochemore
Foundations of Software Technology, Theoretical Computer Science (Puna, 1988), 1988, France. pp.80-87
Communication dans un congrès hal-00619967v1

A la recherche d'un mot

 Maxime Crochemore
Actes des Journées Montoises (Mons, 1990), 1990, Université de Mons-Hainaut, Belgique, Belgique. pp.34-38
Communication dans un congrès hal-00619917v1

Compression for an effective management of telemetry data

 Jean-Paul Arcangeli , Maxime Crochemore , Jean-Noël Hourcastagnou , Jean-Eric Pin
1992, pp.823-830
Communication dans un congrès hal-00019887v1

Two-dimensional Pattern Matching with Rotations

 Amihood Amir , Ayelet Butman , Maxime Crochemore , Gad M. Landau , Mary Schaps
Theoretical Computer Science, 2004, 314 (1), pp.173-187
Article dans une revue hal-00619179v1

Structures for indexes

 Maxime Crochemore
Lothaire M. Applied Combinatorics on Words, Cambridge University Press, pp.106-163, 2005
Chapitre d'ouvrage hal-00620787v1
Image document

Approximating the 2-Interval Pattern Problem

 Maxime Crochemore , Danny Hermelin , Gad M. Landau , Stéphane Vialette
13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Communication dans un congrès hal-00619979v1
Image document

On Compact Directed Acyclic Word Graphs

 Maxime Crochemore , Renaud Vérin
Mycielski J., Rozenberg G., Salomaa A. Structures in Logic and Computer Science, 1261, Springer-Verlag, pp.192-211, 1997, LNCS
Chapitre d'ouvrage hal-00620801v1

Mots et morphismes sans carré

 Maxime Crochemore
Combinatorial Mathematics (Marseille-Luminy, 1981), 1983, France. pp.235-245
Communication dans un congrès hal-00619971v1
Image document

Finite-Repetition threshold for infinite ternary words

 Golnaz Badkobeh , Maxime Crochemore
WORDS, 2011, Prague, Czech Republic. pp.37-43, ⟨10.4204/EPTCS.63.7⟩
Communication dans un congrès hal-00742056v1

On the parallel recognition of unambiguous context-free languages

 Maxime Crochemore , Michal Chytil , Burkhard Monien , Wojciech Rytter
Theoretical Computer Science, 1991, 81 (2), pp.311-316
Article dans une revue hal-00619552v1

Efficient parallel algorithms to test square-freeness and factorize strings

 Maxime Crochemore , Wojciech Rytter
Information Processing Letters, 1991, 38 (2), pp.57-60
Article dans une revue hal-00619585v1

Alignments and Approximate String Matching

 Maxime Crochemore , Thierry Lecroq
Gemma Bel-Enguix, M. Dolores Jiménez-López and Carlos Martin-Vide. New Developments in Formal Languages and Applications, Springer-Verlag, pp.59-93, 2008, Studies in Computational Intelligence
Chapitre d'ouvrage hal-00470106v1

Suffix Tree

 Maxime Crochemore , Thierry Lecroq
Encyclopedia of Database Systems (2nd ed.), Springer New York, pp.3839-3843, 2018
Chapitre d'ouvrage hal-02021444v1
Image document

Algorithms for computing approximate repetitions in musical sequences

 Emilios Cambouropoulos , Maxime Crochemore , Costas S. Iliopoulos , Laurent Mouchard , Yoan J. Pinzón Ardila
Australasian Workshop On Combinatorial Algorithms, 1999, Australia. pp.129-144
Communication dans un congrès hal-00452240v1

The Maximum Number of Squares in a Tree

 Maxime Crochemore , Costas S. Iliopoulos , Tomasz Kociumaka , Marcin Kubica , Jakub Radoszewski , et al.
CPM, 2012, Helsinki, Finland. pp.27-40
Communication dans un congrès hal-00742087v1
Image document

A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches

 Maxime Crochemore , Costas S. Iliopoulos , Solon P. Pissis
Tapio Elomaa, Heikki Mannila, Pekka Orponen. Algorithms and Applications, Springer, pp.92-101, 2010, LNCS, 978-3-642-12475-4
Chapitre d'ouvrage hal-00741966v1

Computing all Subtree Repeats in Ordered Ranked Trees

 Michalis Christou , Maxime Crochemore , Tomas Flouri , Costas S. Iliopoulos , Jan Janousek , et al.
SPIRE, 2011, Pisa, Italy. pp.338-343
Communication dans un congrès hal-00742065v1

Fast computation of a longest increasing subsequence and application

 Maxime Crochemore , Ely Porat
Information and Computation, 2010, 208 (9), pp.1054-1059. ⟨10.1016/j.ic.2010.04.003⟩
Article dans une revue istex hal-00742044v1
Image document

Efficient seed computation revisited

 M. Christou , Maxime Crochemore , C.S. Iliopoulos , M. Kubica , S.P. P Pissis , et al.
Theoretical Computer Science, 2013, 483, pp.171 - 181. ⟨10.1016/j.tcs.2011.12.078⟩
Article dans une revue hal-01616469v1

On the right-seed array of a string

 Michalis Christou , Maxime Crochemore , Ondrej Guth , Costas S. Iliopoulos , Solon P. Pissis
COCOON, 2011, Dallas, United States. pp.492-502
Communication dans un congrès hal-00742060v1

Thue-Morse sequence and $p$-adic topology for the free monoid

 Jean Berstel , Maxime Crochemore , J.-E. Pin
Discrete Mathematics, 1989, 76 (2), pp.89-94
Article dans une revue hal-00619477v1

Speeding up two string-matching algorithms

 Maxime Crochemore , Artur Czumaj , Leszek Gąsieniec , Stefan Jarominek , Thierry Lecroq , et al.
9th International Symposium on Theoretical Aspects of Computer Science (STACS 1992), 1992, France. pp.589-600
Communication dans un congrès hal-00619972v1

A failure function for multiple two-dimensional pattern matching

 Maxime Crochemore , Costas Iliopoulos , Maureen Korda , James Reid
Combinatorial Mathematics and Combinatorial Computing, 2000, 35 (1), pp.225-238
Article dans une revue hal-00619569v1

Computing Longest Previous non-overlapping Factors

 Maxime Crochemore , German Tischler
Information Processing Letters, 2011, 111 (6), pp.291-295
Article dans une revue hal-00742050v1

Reactive automata

 Maxime Crochemore , Dov M. Gabbay
Information and Computation, 2011, 209 (4), pp.692-704. ⟨10.1016/j.ic.2011.01.002⟩
Article dans une revue hal-00742051v1
Page :