Efficient indexing algorithms for one-dimensional discretely-scaled strings
type: Item
instance of: scholarly article
title: Efficient indexing algorithms for one-dimensional discretely-scaled strings
zbMATH Open document ID: 1234.68480
author: Yung-Hsing Peng
author: Chang-Biau Yang
author: Kuo-Si Huang
author: Hsing-Yen Ann
published in: Information Processing Letters
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 68W32
zbMATH DE Number: 6016066
zbMATH Keywords: string matching
zbMATH Keywords: discrete scale
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.05.012
OpenAlex ID: W1969880101
cites work: Real scaled matching
cites work: Efficient pattern matching with scaling
cites work: Real two dimensional scaled matching
cites work: Efficient one-dimensional real scaled matching
cites work: Q4508365
cites work: Matching patterns in strings subject to multi-linear transformations
cites work: On the sorting-complexity of suffix tree construction
cites work: Constructing suffix arrays in linear time
cites work: Fast Pattern Matching in Strings
cites work: On-line construction of suffix trees
cites work: Efficient algorithms for the scaled indexing problem
DOI: 10.1016/J.IPL.2010.05.012
description: scientific article; zbMATH DE number 6016066