Longest Common Extensions in Sublinear Space
type: Item
instance of: scholarly article
title: Longest Common Extensions in Sublinear Space
zbMATH Open document ID: 1380.68139
DOI: 10.1007/978-3-319-19929-0_6
author: Philip Bille
author: Inge Li Gørtz
author: Mathias Bæk Tejs Knudsen
author: Hjalte Wedel Vildhøj
author: Moshe Lewenstein
published in: Combinatorial Pattern Matching
publication date: 2015-08-20T00:00:00Z
full work available at URL: https://arxiv.org/abs/1504.02671
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6473968
MaRDI profile type: Publication
OpenAlex ID: W1958452835
Wikidata QID: Q60554369
arXiv ID: 1504.02671
cites work: Faster algorithms for string matching with k mismatches
cites work: Time-space trade-offs for longest common extensions
cites work: Approximate String Matching: A Simpler Faster Algorithm
cites work: Uniqueness Theorems for Periodic Functions
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Fast Algorithms for Finding Nearest Common Ancestors
cites work: Faster Sparse Suffix Sorting
cites work: Efficient randomized pattern-matching algorithms
cites work: Searching for Gapped Palindromes
cites work: Incremental String Comparison
cites work: Fast parallel and serial approximate string matching
cites work: An O(n log n) algorithm for finding all repetitions in a string
cites work: A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
cites work: An \(O(ND)\) difference algorithm and its variations
DBLP publication ID: conf/cpm/BilleGKLV15
description: scientific article