Filtrer vos résultats
- 149
- 103
- 106
- 100
- 24
- 20
- 1
- 1
- 245
- 6
- 3
- 1
- 1
- 1
- 1
- 3
- 3
- 4
- 9
- 2
- 4
- 6
- 12
- 13
- 12
- 10
- 16
- 10
- 5
- 11
- 6
- 12
- 11
- 6
- 6
- 8
- 7
- 8
- 3
- 4
- 4
- 6
- 8
- 6
- 6
- 4
- 4
- 2
- 5
- 1
- 1
- 5
- 3
- 1
- 2
- 239
- 13
- 232
- 44
- 41
- 22
- 21
- 9
- 8
- 8
- 7
- 7
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 252
- 48
- 40
- 27
- 18
- 16
- 14
- 12
- 12
- 11
- 11
- 10
- 9
- 8
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
252 résultats
|
Forty Years of Suffix TreesCommunications of the ACM, 2016, 59 (4), pp.66-73. ⟨10.1145/2810036⟩
Article dans une revue
hal-01830856v1
|
||
Constant-Space String MatchingFoundations of Software Technology, Theoretical Computer Science (Puna, 1988), 1988, France. pp.80-87
Communication dans un congrès
hal-00619967v1
|
|||
Efficient parallel algorithms to test square-freeness and factorize stringsInformation Processing Letters, 1991, 38 (2), pp.57-60
Article dans une revue
hal-00619585v1
|
|||
Compression for an effective management of telemetry data1992, pp.823-830
Communication dans un congrès
hal-00019887v1
|
|||
|
Direct construction of compact Directed Acyclic Word GraphsCombinatorial Pattern Matching (Aarhus, 1997), 1997, France. pp.116-129
Communication dans un congrès
hal-00620006v1
|
||
Mots et morphismes sans carréCombinatorial Mathematics (Marseille-Luminy, 1981), 1983, France. pp.235-245
Communication dans un congrès
hal-00619971v1
|
|||
On the parallel recognition of unambiguous context-free languagesTheoretical Computer Science, 1991, 81 (2), pp.311-316
Article dans une revue
hal-00619552v1
|
|||
A solution to P12Bulletin- European Association for Theoretical Computer Science, 1983, 19 (1), pp.15-16
Article dans une revue
hal-00619549v1
|
|||
|
Algorithms for computing approximate repetitions in musical sequencesAustralasian Workshop On Combinatorial Algorithms, 1999, Australia. pp.129-144
Communication dans un congrès
hal-00452240v1
|
||
|
On Compact Directed Acyclic Word GraphsMycielski J., Rozenberg G., Salomaa A. Structures in Logic and Computer Science, 1261, Springer-Verlag, pp.192-211, 1997, LNCS
Chapitre d'ouvrage
hal-00620801v1
|
||
A la recherche d'un motActes des Journées Montoises (Mons, 1990), 1990, Université de Mons-Hainaut, Belgique, Belgique. pp.34-38
Communication dans un congrès
hal-00619917v1
|
|||
Two-dimensional Pattern Matching with RotationsTheoretical Computer Science, 2004, 314 (1), pp.173-187
Article dans une revue
hal-00619179v1
|
|||
Structures for indexesLothaire M. Applied Combinatorics on Words, Cambridge University Press, pp.106-163, 2005
Chapitre d'ouvrage
hal-00620787v1
|
|||
|
Motifs in Sequences: Localization and ExtractionKonopka A. K., Crabbe M. J. C. Compact Handbook of Computational Biology, Marcel Dekker, New York, pp.47-97, 2004
Chapitre d'ouvrage
hal-00620799v1
|
||
Alignments and Approximate String MatchingGemma 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
|
|||
Computing all Subtree Repeats in Ordered Ranked TreesSPIRE, 2011, Pisa, Italy. pp.338-343
Communication dans un congrès
hal-00742065v1
|
|||
|
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatchesTapio Elomaa, Heikki Mannila, Pekka Orponen. Algorithms and Applications, Springer, pp.92-101, 2010, LNCS, 978-3-642-12475-4
Chapitre d'ouvrage
hal-00741966v1
|
||
|
Finite-Repetition threshold for infinite ternary wordsWORDS, 2011, Prague, Czech Republic. pp.37-43, ⟨10.4204/EPTCS.63.7⟩
Communication dans un congrès
hal-00742056v1
|
||
The Maximum Number of Squares in a TreeCPM, 2012, Helsinki, Finland. pp.27-40
Communication dans un congrès
hal-00742087v1
|
|||
Suffix TreeEncyclopedia of Database Systems (2nd ed.), Springer New York, pp.3839-3843, 2018
Chapitre d'ouvrage
hal-02021444v1
|
|||
|
Indexing a sequence for mapping reads with a single mismatchPhilosophical 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
|
||
Fast computation of a longest increasing subsequence and applicationInformation and Computation, 2010, 208 (9), pp.1054-1059. ⟨10.1016/j.ic.2010.04.003⟩
Article dans une revue
istex
hal-00742044v1
|
|||
|
Approximating the 2-Interval Pattern Problem13th Annual European Symposium on Algorithms (ESA'05), 2005, Mallorca, Spain, Spain. pp.426-437
Communication dans un congrès
hal-00619979v1
|
||
A solution to Berstel's problem P3Bulletin- European Association for Theoretical Computer Science, 1982, 18 (1), pp.9-11
Article dans une revue
hal-00619560v1
|
|||
String pattern matching for a deluge survival kitAbello J., Pardalos P.M., Resende M.G.C. Handbook of Massive Data Sets, Kluwer Academic Publishers, pp.151-194, 2002
Chapitre d'ouvrage
hal-00620665v1
|
|||
ForewordJournal of Discrete Algorithms, 2005, 3 (2-4), pp.125
Article dans une revue
hal-00620517v1
|
|||
|
A Basis for Repeated Motifs in Pattern Discovery and Text Mining2002
Rapport
hal-00627828v1
|
||
|
Computing Longest Previous Factor in linear time and applicationsInformation Processing Letters, 2008, 106 (2), pp.75-80. ⟨10.1016/j.ipl.2007.10.006⟩
Article dans une revue
hal-00619691v1
|
||
|
Occurrence and substring heuristics for δ-matchingFundamenta Informaticae, 2003, 56 (1,2), pp.1-21
Article dans une revue
hal-00619565v1
|
||
Automata and algorithmsFormal Properties of Finite Automata and Applications (Ramatuelle, 1988), 1989, France. pp.166-175
Communication dans un congrès
hal-00619969v1
|