scientific article; zbMATH DE number 1445802

MaRDI QIDQ4952901zbMATH OpenFDO

Authors L. C. K. Hui

Publication date 10 May 2000

zbMATH Keywords

string matching problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• Linear time algorithms for generalizations of the longest common substring problem
• scientific article; zbMATH DE number 1782360
• Computing Longest Common Substrings Via Suffix Arrays
• String Processing and Information Retrieval
• Linear time algorithm for the longest common repeat problem

Cited in

(10)

• Linear time algorithms for generalizations of the longest common substring problem
• Linear time algorithm for the longest common repeat problem
• String Processing and Information Retrieval
• Linear-size suffix tries
• Dynamic and internal longest common substring
• scientific article; zbMATH DE number 1782360 (Why is no real title available?)
• Computing Longest Common Substrings Via Suffix Arrays
• scientific article; zbMATH DE number 1555948 (Why is no real title available?)
• The longest common substring problem
• A simple grammar-based index for finding approximately longest common substrings

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