The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Thierry Lecroq: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2002, pp:18-21 [Conf]
  2. Christian Charras, Thierry Lecroq, Joseph Daniel Pehoushek
    A Very Fast String Matching Algorithm for Small Alphabeths and Long Patterns (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CPM, 1998, pp:55-64 [Conf]
  3. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Three Heuristics for delta-Matching: delta-BM Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:178-189 [Conf]
  4. Arnaud Lefebvre, Thierry Lecroq
    Compror: Compression with a Factor Oracle. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2001, pp:502- [Conf]
  5. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-Time Computation of Local Periods. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:388-397 [Conf]
  6. Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:589-600 [Conf]
  7. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:247-267 [Journal]
  8. Arnaud Lefebvre, Thierry Lecroq, H. Dauchel, Joël Alexandre
    FORRepeats: detects repeats on entire chromosomes and between genomes. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:3, pp:319-326 [Journal]
  9. Maxime Crochemore, Thierry Lecroq
    Pattern-Matching and Text-Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:39-41 [Journal]
  10. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
    Occurrence and Substring Heuristics for i-Matching. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:1-21 [Journal]
  11. Arnaud Lefebvre, Thierry Lecroq
    A Heuristic for Computing Repeats with a Factor Oracle: Application to Biological Sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:12, pp:1303-1315 [Journal]
  12. Élise Prieur, Thierry Lecroq
    From Suffix Trees to Suffix Vectors. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1385-1402 [Journal]
  13. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    On special families of morphisms related to [delta]-matching and don't care symbols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:227-233 [Journal]
  14. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal]
  15. Maxime Crochemore, Thierry Lecroq
    Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:4, pp:195-203 [Journal]
  16. Thierry Lecroq, Guillaume Luce, Jean Frédéric Myoupo
    A Faster Linear Systolic Algorithm for Recovering a Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:3, pp:129-136 [Journal]
  17. Arnaud Lefebvre, Thierry Lecroq
    Compror: On-line lossless data compression with a factor oracle. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:1, pp:1-6 [Journal]
  18. Thierry Lecroq
    Fast exact string matching algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:102, n:6, pp:229-235 [Journal]
  19. Arnaud Lefebvre, Thierry Lecroq, Joël Alexandre
    An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:647-657 [Journal]
  20. Maxime Crochemore, Christophe Hancart, Thierry Lecroq
    A unifying look at the Apostolico-Giancarlo string-matching algorithm. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:37-52 [Journal]
  21. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    A One-Phase Parallel Algorithm for the Sequence Alignment Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:4, pp:515-526 [Journal]
  22. Thierry Lecroq
    Experimental Results on String Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1995, v:25, n:7, pp:727-765 [Journal]
  23. Thierry Lecroq
    Experiments on String Matching in Memory Structures. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1998, v:28, n:5, pp:561-568 [Journal]
  24. Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre
    Linear-time computation of local periods. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:229-240 [Journal]
  25. Thierry Lecroq
    A Variation on the Boyer-Moore Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:119-144 [Journal]
  26. Élise Prieur, Thierry Lecroq
    From suffix trees to suffix vectors. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:37-53 [Conf]

  27. CPM's 20th Anniversary: A Statistical Retrospective. [Citation Graph (, )][DBLP]


  28. An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. [Citation Graph (, )][DBLP]


  29. Efficient Variants of the Backward-Oracle-Matching Algorithm. [Citation Graph (, )][DBLP]


  30. Dynamic Burrows-Wheeler Transform. [Citation Graph (, )][DBLP]


  31. SMS-Forbid: An Efficient Agorithm for Simple Motif Problem. [Citation Graph (, )][DBLP]


  32. Projection and Inheritance of SNOMED CT Relations between MeSH Terms. [Citation Graph (, )][DBLP]


  33. Searching Related Resources in a Quality Controlled Health Gateway: a Feasibility Study. [Citation Graph (, )][DBLP]


  34. Efficient Pattern Matching on Binary Strings [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002