scientific article; zbMATH DE number 1445802

zbMATH Open0954.68065MaRDI QIDQ4952901FDOQ4952901

Authors: L. C. K. Hui 

Publication date: 10 May 2000

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

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

zbMATH Keywords

string matching problem

Mathematics Subject Classification ID

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

Cited In (10)

• Linear time algorithm for the longest common repeat problem
• String Processing and Information Retrieval
• Linear-size suffix tries
• Dynamic and internal longest common substring
• Title not available (Why is that?)
• Computing Longest Common Substrings Via Suffix Arrays
• Title not available (Why is that?)
• The longest common substring problem
• A simple grammar-based index for finding approximately longest common substrings
• Linear time algorithms for generalizations of the longest common substring problem

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)