Longest Common Factor After One Edit Operation

DOI10.1007/978-3-319-67428-5_2zbMath1454.68196OpenAlexW2752874428MaRDI QIDQ5150915

Costas S. Iliopoulos, Panagiotis Charalampopoulos, Solon P. Pissis, Amihood Amir, Jakub Radoszewski

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67428-5_2

zbMATH Keywords

suffix treeheavy-path decompositiondynamic data structureorthogonal range searchinglongest common factor

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (14)

Minimal unique palindromic substrings after single-character substitution ⋮ The heaviest induced ancestors problem: better data structures and applications ⋮ Shortest unique palindromic substring queries in semi-dynamic settings ⋮ Data structures for computing unique palindromes in static and non-static strings ⋮ Unnamed Item ⋮ Dynamic and internal longest common substring ⋮ Computing longest palindromic substring after single-character or block-wise edits ⋮ Repetition Detection in a Dynamic String ⋮ Longest common substring made fully dynamic ⋮ Faster queries for longest substring palindrome after block edit ⋮ Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms. ⋮ Longest Lyndon Substring After Edit ⋮ Longest substring palindrome after edit ⋮ The Heaviest Induced Ancestors Problem Revisited

Cites Work

• Computing the longest common substring with one mismatch
• A note on the longest common substring with \(k\)-mismatches problem
• Longest common substrings with \(k\) mismatches
• Sublinear Space Algorithms for the Longest Common Substring Problem
• Dynamic text and static pattern matching
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Algorithms on Strings, Trees and Sequences
• Time-Space Trade-Offs for the Longest Common Substring Problem
• Longest Common Substring with Approximately k Mismatches
• Algorithms on Strings
• Unnamed Item

This page was built for publication: Longest Common Factor After One Edit Operation