Longest common extension

DOI10.1016/j.ejc.2017.07.019zbMath1375.05006OpenAlexW2765449361MaRDI QIDQ1678103

Shoham Letzter, Béla Bollobás

Publication date: 14 November 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10107278/1/longest-ext-23-May.pdf

zbMATH Keywords

string matchinglongest substring

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A note on the longest common compatible prefix problem for partial words
• The longest common extension problem revisited and applications to approximate string searching
• Efficient string matching with k mismatches
• An \(O(ND)\) difference algorithm and its variations
• On string matching with mismatches
• Linear time algorithms for finding and representing all the tandem repeats in a string
• Longest Common Extensions in Partial Words
• An O(n log n) algorithm for finding all repetitions in a string
• Generalized String Matching
• Fast parallel and serial approximate string matching
• Algorithms on Strings, Trees and Sequences
• The k-mismatch problem revisited
• Faster algorithms for string matching with k mismatches
• Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem

This page was built for publication: Longest common extension