Maxime Crochemore - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Periodic-Finite-Type Shift SpacesMarie-Pierre Béal, Maxime Crochemore, Bruce E. Moision, Paul H. Siegel. TIT, 57(6):3677-3691, 2011. [doi]

Hunting Redundancies in StringsGolnaz Badkobeh, Supaporn Chairungsee, Maxime Crochemore. dlt 2011: 1-14 [doi]

Building Phylogeny with Minimal Absent WordsSupaporn Chairungsee, Maxime Crochemore. wia 2011: 100-109 [doi]

Efficient Seeds Computation RevisitedMichalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen. cpm 2011: 350-363 [doi]

On the Right-Seed Array of a StringMichalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis. cocoon 2011: 492-502 [doi]

Reactive automataMaxime Crochemore, Dov M. Gabbay. iandc, 209(4):692-704, 2011. [doi]

The runs conjectureMaxime Crochemore, Lucian Ilie, Liviu Tinta. TCS, 412(27):2931-2941, 2011. [doi]

Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081)Maxime Crochemore, Lila Kari, Mehryar Mohri, Dirk Nowotka. dagstuhl-reports, 1(2):47-66, 2011. [doi]

Computing Longest Previous non-overlapping FactorsMaxime Crochemore, German Tischler. ipl, 111(6):291-295, 2011. [doi]

2010

A Parallel Algorithm for Fixed-Length Approximate String-Matching with ::::k::::-mismatchesMaxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis. birthday 2010: 92-101 [doi]

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix ArraysMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen. sofsem 2010: 296-307 [doi]

Extracting Powers and Periods in a String from Its Runs StructureMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. spire 2010: 258-269 [doi]

Cover Array String ReconstructionMaxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler. cpm 2010: 251-259 [doi]

The Gapped Suffix Array: A New Index Structure for Fast Approximate MatchingMaxime Crochemore, German Tischler. spire 2010: 359-364 [doi]

Finding Patterns In Given IntervalsMaxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman. FUIN, 101(3):173-186, 2010. [doi]

Fast computation of a longest increasing subsequence and applicationMaxime Crochemore, Ely Porat. iandc, 208(9):1054-1059, 2010. [doi]

On the Maximal Number of Cubic Runs in a StringMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. LATA 2010: 227-238 [doi]

Algorithms for Three Versions of the Shortest Common Superstring ProblemMaxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. cpm 2010: 299-309 [doi]

Number of Occurrences of powers in StringsMaxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera. ijfcs, 21(4):535-547, 2010. [doi]

On the Maximal Sum of Exponents of Runsin a StringMaxime Crochemore, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. iwoca 2011: 10-19 [doi]

Dictionary-Symbolwise Flexible ParsingMaxime Crochemore, Laura Giambruno, Alessio Langiu, Filippo Mignosi, Antonio Restivo. iwoca 2011: 390-403 [doi]

2009

2008

Conservative String Covering of Indeterminate StringsPavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau. stringology 2008: 108-115 [doi]

ForewordJoseph Wun-Tat Chan, Maxime Crochemore. mics, 1(4):541-542, 2008. [doi]

Improved Algorithms for the Range Next Value Problem and ApplicationsMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen. STACS 2008: 205-216 [doi]

Maximal repetitions in stringsMaxime Crochemore, Lucian Ilie. jcss, 74(5):796-807, 2008. [doi]

Towards a Solution to the Runs ConjectureMaxime Crochemore, Lucian Ilie, Liviu Tinta. cpm 2008: 290-302 [doi]

Approximating the 2-interval pattern problemMaxime Crochemore, Danny Hermelin, Gad M. Landau, Dror Rawitz, Stéphane Vialette. TCS, 395(2-3):283-297, 2008. [doi]

On the Longest Common Factor ProblemMaxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi. ifipTCS 2008: 143-155 [doi]

Optimal prefix and suffix queries on textsMaxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman. ipl, 108(5):320-325, 2008. [doi]

Bounds on Powers in StringsMaxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera. dlt 2008: 206-215 [doi]

A Simple Algorithm for Computing the Lempel Ziv FactorizationMaxime Crochemore, Lucian Ilie, W. F. Smyth. dcc 2008: 482-488 [doi]

Understanding Maximal Repetitions in StringsMaxime Crochemore, Lucian Ilie. STACS 2008: 11-16 [doi]

Computing Longest Previous Factor in linear time and applicationsMaxime Crochemore, Lucian Ilie. ipl, 106(2):75-80, 2008. [doi]

Computing a Longest Increasing Subsequence of Length k in Time O(n log log k)Maxime Crochemore, Ely Porat. bcs 2008: 69-74 [doi]

External Memory Algorithms for String ProblemsKangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park. FUIN, 84(1):17-32, 2008. [doi]

2007

All maximal-pairs in step-leap representation of melodic sequenceEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. isci, 177(9):1954-1962, 2007. [doi]

On the Suffix Automaton with MismatchesMaxime Crochemore, Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi. wia 2007: 144-156 [doi]

Finding Patterns in Given IntervalsMaxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman. mfcs 2007: 645-656 [doi]

The Structure of Factor OraclesMaxime Crochemore, Lucian Ilie, Emine Seid-Hilmi. ijfcs, 18(4):781-797, 2007. [doi]

Algorithms on stringsMaxime Crochemore, Christophe Hancart, Thierry Lecroq. Cambridge University Press, 2007.

Analysis of Maximal Repetitions in StringsMaxime Crochemore, Lucian Ilie. mfcs 2007: 465-476 [doi]

2006

Longest repeats with a block of ::::k:::: don t caresMaxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. TCS, 362(1-3):248-254, 2006. [doi]

Text Searching and IndexingMaxime Crochemore, Thierry Lecroq. In Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana, editors, Recent Advances in Formal Languages and Applications. Volume 25 of Studies in Computational Intelligence, pages 43-80, Springer, 2006. [doi]

Factor OraclesMaxime Crochemore, Lucian Ilie, Emine Seid-Hilmi. wia 2006: 78-89 [doi]

2005

Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, ProceedingsAlberto Apostolico, Maxime Crochemore, Kunsoo Park, editors, Volume 3537 of Lecture Notes in Computer Science, Springer, 2005.

ForewordRicardo A. Baeza-Yates, Maxime Crochemore. jda, 3(2-4):125, 2005. [doi]

Presentations of constrained systems with unconstrained positionsMarie-Pierre Béal, Maxime Crochemore, Gabriele Fici. TIT, 51(5):1891-1900, 2005. [doi]

A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic CategoriesEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot. ismir 2005: 167-174 [doi]

Approximating the 2-Interval Pattern ProblemMaxime Crochemore, Danny Hermelin, Gad M. Landau, Stéphane Vialette. esa 2005: 426-437 [doi]

Bit-parallel (::::delta::::, ::::gamma::::)-matching and suffix automataMaxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger. jda, 3(2-4):198-214, 2005. [doi]

A note on the Burrows - CWheeler transformationMaxime Crochemore, Jacques Désarménien, Dominique Perrin. TCS, 332(1-3):567-572, 2005. [doi]

Bases of Motifs for Generating Repeated Patterns with Wild CardsNadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot. tcbb, 2(1):40-50, 2005. [doi]

2004

2003

Two-Dimensional Pattern Matching with RotationsAmihood Amir, Ayelet Butman, Maxime Crochemore, Gad M. Landau, Malka Schaps. cpm 2003: 17-31 [doi]

Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, ProceedingsRicardo A. Baeza-Yates, Edgar Chávez, Maxime Crochemore, editors, Volume 2676 of Lecture Notes in Computer Science, Springer, 2003.

Computing forbidden words of regular languagesMarie-Pierre Béal, Maxime Crochemore, Filippo Mignosi. FUIN, 56(1-2):121-135, 2003. [doi]

Speeding-up Hirschberg and Hunt-Szymanski LCS AlgorithmsMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. FUIN, 56(1-2):89-103, 2003. [doi]

Occurrence and Substring Heuristics for i-MatchingMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq. FUIN, 56(1-2):1-21, 2003. [doi]

A unifying look at the Apostolico-Giancarlo string-matching algorithmMaxime Crochemore, Christophe Hancart, Thierry Lecroq. jda, 1(1):37-52, 2003. [doi]

Reducing space for index implementationMaxime Crochemore. TCS, 292(1):185-197, 2003.

A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring MatricesMaxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson. siamcomp, 32(6):1654-1673, 2003. [doi]

Waiting time and complexity for matching patterns with automataMaxime Crochemore, Valery T. Stefanov. ipl, 87(3):119-125, 2003. [doi]

A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music RetrievalMaxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon. spire 2003: 211-223 [doi]

Directed acyclic subsequence graph - OverviewMaxime Crochemore, Borivoj Melichar, Zdenek Tronícek. jda, 1(3-4):255-280, 2003. [doi]

A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher QuorumNadia Pisanti, Maxime Crochemore, Roberto Grossi, Marie-France Sagot. mfcs 2003: 622-631 [doi]

2002

Algorithms for Computing Approximate Repetitions in Musical SequencesEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon. ijcm, 79(11):1135-1148, 2002. [doi]

A sub-quadratic sequence alignment algorithm for unrestricted cost matricesMaxime Crochemore, Gad M. Landau, Michal Ziv-Ukelson. soda 2002: 679-688 [doi]

Approximate String Matching with GapsMaxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas. njc, 9(1):54-65, 2002.

Three Heuristics for delta-Matching: delta-BM AlgorithmsMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. cpm 2002: 178-189 [doi]

On the Size of DASG for Multiple TextsMaxime Crochemore, Zdenek Tronícek. spire 2002: 58-64 [doi]

Jewels of stringologyMaxime Crochemore, Wojciech Rytter. World Scientific, 2002.

Improved Antidictionary Based CompressionMaxime Crochemore, Gonzalo Navarro. sccc 2002: 7-13 [doi]

On the Implementation of Compact DAWG sJan Holub, Maxime Crochemore. wia 2003: 289-294 [doi]

2001

Efficient Experimental String Matching by Weak Factor RecognitionCyril Allauzen, Maxime Crochemore, Mathieu Raffinot. cpm 2001: 51-72 [doi]

Speeding-up Hirschberg and Hunt-Szymanski LCS AlgorithmsMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. spire 2001: 59-67

Computing Evolutionary Chains in Musical SequencesMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. combinatorics, 8(2), 2001. [doi]

2000

Finding Motifs with GapsMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. ismir 2000: [doi]

Fast Evolutionary ChainsMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon. sofsem 2000: 307-318 [doi]

1999

Factor Oracle: A New Structure for Pattern MatchingCyril Allauzen, Maxime Crochemore, Mathieu Raffinot. sofsem 1999: 295-310 [doi]

Constant-Space String-Matching in Sublinear Average TimeMaxime Crochemore, Leszek Gasieniec, Wojciech Rytter. TCS, 218(1):197-203, 1999. [doi]

Text Compression Using AntidictionariesMaxime Crochemore, Filippo Mignosi, Antonio Restivo, Sergio Salemi. icalp 1999: 261-270 [doi]

Zones of Low Entropy in Genomic SequencesMaxime Crochemore, Renaud Vérin. CANDC, 23(3-4):275-282, 1999. [doi]

Combinatorial Pattern Matching, 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999, ProceedingsMaxime Crochemore, Mike Paterson, editors, Volume 1645 of Lecture Notes in Computer Science, Springer, 1999.

Fast Practical Multi-Pattern MatchingMaxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter. ipl, 71(3-4):107-113, 1999. [doi]

1998

1997

Constant-Time Randomized Parallel String MatchingMaxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter. siamcomp, 26(4):950-960, 1997.

Tight Bounds on the Complexity of the Apostolico-Giancarlo AlgorithmMaxime Crochemore, Thierry Lecroq. ipl, 63(4):195-203, 1997. [doi]

Pattern Matching and Text Compression AlgorithmsMaxime Crochemore, Thierry Lecroq. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 161-202, CRC Press, 1997.

On Compact Directed Acyclic Word GraphsMaxime Crochemore, Renaud Vérin. BIRTHDAY 1997: 192-211

PreviousNext