scientific article; zbMATH DE number 5263622
From MaRDI portal
Publication:5458488
zbMATH Open1134.68300MaRDI QIDQ5458488FDOQ5458488
Thierry Lecroq, Christophe Hancart, Maxime Crochemore
Publication date: 15 April 2008
Title of this publication is not available (Why is that?)
Searching and sorting (68P10) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Cited In (12)
- Indexing Circular Patterns
- On the Suffix Automaton with Mismatches
- Content-dependent chunking for differential compression, the local maximum approach
- On z-factorization and c-factorization of standard episturmian words
- Lyndon words, permutations and trees.
- Parsing with a finite dictionary
- Indeterminate strings, prefix arrays \& undirected graphs
- A simple fast hybrid pattern-matching algorithm
- de Bruijn sequences and de Bruijn graphs for a general language
- Languages with mismatches
- Word assembly through minimal forbidden words
- Words over an ordered alphabet and suffix permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458488)
