A metric index for approximate string matching
type: Item
instance of: scholarly article
title: A metric index for approximate string matching
zbMATH Open document ID: 1087.68027
author: Gonzalo Navarro
author: Edgar Chávez
published in: Theoretical Computer Science
publication date: 2006-03-24T00:00:00Z
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5015105
zbMATH Keywords: indexed approximate string matching
zbMATH Keywords: metric spaces
zbMATH Keywords: metric indexes
zbMATH Keywords: suffix trees
zbMATH Keywords: suffix arrays
describes a project that uses: GLIMPSE
describes a project that uses: PATRICIA
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.11.037
OpenAlex ID: W2164410749
cites work: Q3690245
cites work: Q2753929
cites work: Q3044326
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Transducers and repetitions
cites work: String Processing and Information Retrieval
cites work: Algorithms on Strings, Trees and Sequences
cites work: Q4035246
cites work: Q4449231
cites work: Linear-Time Construction of Suffix Arrays
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Q5528329
cites work: A new method for approximate indexing and dictionary lookup with one error
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: A Space-Economical Suffix Tree Construction Algorithm
cites work: A sublinear algorithm for approximate keyword searching
cites work: Indexing text with approximate \(q\)-grams
cites work: Q4855565
cites work: On-line construction of suffix trees
DOI: 10.1016/J.TCS.2005.11.037
description: scientific article; zbMATH DE number 5015105