A linear size index for approximate pattern matching
type: Item
instance of: scholarly article
title: A linear size index for approximate pattern matching
zbMATH Open document ID: 1230.68223
author: Ho-Leung Chan
author: Tak-Wah Lam
author: Wing-Kin Sung
author: Siu-Lung Tam
author: Swee-Seong Wong
published in: Journal of Discrete Algorithms
publication date: 2012-01-04T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68U15
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5994307
zbMATH Keywords: approximate pattern matching
zbMATH Keywords: full text indexing
zbMATH Keywords: indexing with errors
zbMATH Keywords: space complexity
MaRDI profile type: Publication
full work available at URL: j.jda.2011.04.004
OpenAlex ID: W2036463783
Wikidata QID: Q58062906
cites work: Text Indexing and Dictionary Matching with One Error
cites work: Q2753929
cites work: Q3044326
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
cites work: Combinatorial Pattern Matching
cites work: Improved approximate string matching using compressed suffix data structures
cites work: Text indexing with errors
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: Compressed suffix trees with full functionality
DBLP publication ID: journals/jda/ChanLSTW11
DOI: 10.1016/J.JDA.2011.04.004
description: scientific article; zbMATH DE number 5994307