scientific article; zbMATH DE number 4007744

zbMATH Open0621.68050MaRDI QIDQ3758253FDOQ3758253

Maxime Crochemore

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• String-matching on ordered alphabets
• Title not available (Why is that?)
• Longest Common Extensions in Partial Words
• Forty Years of Text Indexing
• On finding common subtrees
• 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
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays

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)