scientific article; zbMATH DE number 5263622

MaRDI QIDQ5458488zbMATHFDO

Authors Maxime Crochemore, Christophe Hancart, Thierry Lecroq

Publication date 15 April 2008

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Cited in

(12)

• Indeterminate strings, prefix arrays \& undirected graphs
• On the Suffix Automaton with Mismatches
• A simple fast hybrid pattern-matching algorithm
• Languages with mismatches
• Lyndon words, permutations and trees.
• Word assembly through minimal forbidden words
• Words over an ordered alphabet and suffix permutations
• On z-factorization and c-factorization of standard episturmian words
• Content-dependent chunking for differential compression, the local maximum approach
• Indexing Circular Patterns
• Parsing with a finite dictionary
• de Bruijn sequences and de Bruijn graphs for a general language

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)