Computing Longest Common Substrings Via Suffix Arrays

DOI10.1007/978-3-540-79709-8_10zbMath1142.68592OpenAlexW1568850903MaRDI QIDQ3503625

Tatiana Starikovskaya, Maxim A. 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)

Related Items (3)

Longest common substring with approximately \(k\) mismatches ⋮ Near-optimal quantum algorithms for string problems ⋮ On finding a longest common palindromic subsequence

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