Improved approximate string matching using compressed suffix data structures
type: Item
instance of: scholarly article
title: Improved approximate string matching using compressed suffix data structures
zbMATH Open document ID: 1203.68040
author: Tak-Wah Lam
author: Wing-Kin Sung
author: Swee-Seong Wong
published in: Algorithmica
publication date: 2008-07-01T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5294784
MaRDI profile type: Publication
full work available at URL: s00453-007-9104-8
OpenAlex ID: W2615813815
cites work: Text Indexing and Dictionary Matching with One Error
cites work: Q4952702
cites work: Q2753929
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Q4035246
cites work: Fast parallel and serial approximate string matching
cites work: Succinct representation of balanced parentheses and static trees
cites work: Space efficient suffix trees
cites work: Q3024807
cites work: Q2723965
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
cites work: Time-space trade-offs for compressed suffix arrays.
cites work: Compressed suffix trees with full functionality
cites work: The theory and computation of evolutionary distances: Pattern recognition
cites work: Combinatorial Pattern Matching
cites work: Log-logarithmic worst-case range queries are possible in space theta(N)
DOI: 10.1007/S00453-007-9104-8
description: scientific article; zbMATH DE number 5294784