Longest common extension
type: Item
instance of: scholarly article
title: Longest common extension
zbMATH Open document ID: 1375.05006
author: Béla Bollobás
author: Shoham Letzter
published in: European Journal of Combinatorics
publication date: 2017-11-14T00:00:00Z
full work available at URL: longest-ext-23-May.pdf
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6806773
zbMATH Keywords: longest substring
zbMATH Keywords: string matching
MaRDI profile type: Publication
OpenAlex ID: W2765449361
cites work: Generalized String Matching
cites work: Faster algorithms for string matching with k mismatches
cites work: Longest Common Extensions in Partial Words
cites work: Suffix Trees for Partial Words and the Longest Common Compatible Prefix Problem
cites work: The k-mismatch problem revisited
cites work: A note on the longest common compatible prefix problem for partial words
cites work: Algorithms on Strings, Trees and Sequences
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: The longest common extension problem revisited and applications to approximate string searching
cites work: Fast parallel and serial approximate string matching
cites work: Efficient string matching with k mismatches
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: On string matching with mismatches
DOI: 10.1016/J.EJC.2017.07.019
description: scientific article; zbMATH DE number 6806773