Computing Longest Common Substrings Via Suffix Arrays

DOI10.1007/978-3-540-79709-8_10MaRDI QIDQ3503625zbMATH OpenOpenAlexFDO

Authors Tatiana Starikovskaya, Maxim Babenko

Publication date 5 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79709-8_10

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Linear time algorithms for generalizations of the longest common substring problem
• scientific article; zbMATH DE number 1445802
• The longest common substring problem
• Efficient repeat finding in sets of strings via suffix arrays
• scientific article; zbMATH DE number 1786458

Cited in

(15)

• A substring-substring LCS data structure
• On finding a longest common palindromic subsequence
• Dynamic and internal longest common substring
• Longest property-preserved common factor: a new string-processing framework
• Longest common substring with approximately \(k\) mismatches
• Linear time algorithm for the longest common repeat problem
• The longest common substring problem
• Efficient Computation of Substring Equivalence Classes with Suffix Arrays
• Sampled Longest Common Prefix Array
• The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• scientific article; zbMATH DE number 1445802 (Why is no real title available?)
• Linear time algorithms for generalizations of the longest common substring problem
• Efficient repeat finding in sets of strings via suffix arrays
• Near-optimal quantum algorithms for string problems

This page was built for publication: Computing Longest Common Substrings Via Suffix Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503625)