scientific article; zbMATH DE number 4007744

MaRDI QIDQ3758253zbMATH OpenFDO

Authors Maxime Crochemore

Publication date 1987

zbMATH Keywords

linear time algorithmlongest common factor of two wordsminimal suffix automatonreal-time string-matching algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Algorithms for longest common abelian factors
• Computing longest previous factor in linear time and applications
• Computing the longest previous factor
• Linear-time algorithm for long LCF with \(k\) mismatches
• Locally maximal common factors as a tool for efficient dynamic string algorithms

Cited in

(10)

• On finding common subtrees
• Longest Common Extensions in Partial Words
• A string-matching interpretation of the equation \(x^ m y^ n = z^ p\)
• Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words
• scientific article; zbMATH DE number 5125588 (Why is no real title available?)
• Forty Years of Text Indexing
• String-matching on ordered alphabets
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• Algorithms for longest common abelian factors
• On multiset of factors of a word

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 Q3758253)