Time-Space Trade-Offs for the Longest Common Substring Problem

DOI10.1007/978-3-642-38905-4_22zbMath1381.68102OpenAlexW2279569755MaRDI QIDQ4928575

Tatiana Starikovskaya, Hjalte Wedel Vildhøj

Publication date: 14 June 2013

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38905-4_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (8)

Longest common substring with approximately \(k\) mismatches ⋮ Near-optimal quantum algorithms for string problems ⋮ Dynamic and internal longest common substring ⋮ Longest Common Factor After One Edit Operation ⋮ Longest property-preserved common factor: a new string-processing framework ⋮ Longest common substring made fully dynamic ⋮ Longest common substrings with \(k\) mismatches ⋮ Linear-Time Algorithm for Long LCF with k Mismatches

This page was built for publication: Time-Space Trade-Offs for the Longest Common Substring Problem