The indexing for one-dimensional proportionally-scaled strings

Authors:
Yung-Hsing Peng;Chang-Biau Yang;Chiou-Ting Tseng;Chiou-Yi Hor
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan
Venue:
Information Processing Letters
Year:
2011

Citing 14
Cited 0

Matching patterns in strings subject to multi-linear transformations

Theoretical Computer Science
Efficient pattern matching with scaling

Journal of Algorithms
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Real scaled matching

Information Processing Letters
Alphabet-independent and scaled dictionary matching

Journal of Algorithms
On the sorting-complexity of suffix tree construction

Journal of the ACM (JACM)
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
New data structures for orthogonal range searching

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Faster algorithms for string matching with k mismatches

Journal of Algorithms - Special issue: SODA 2000
Efficient algorithms for the scaled indexing problem

Journal of Algorithms
Simple deterministic wildcard matching

Information Processing Letters
Efficient one-dimensional real scaled matching

Journal of Discrete Algorithms
Efficient indexing algorithms for one-dimensional discretely-scaled strings

Information Processing Letters
A new efficient indexing algorithm for one-dimensional real scaled patterns

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

Related problems of scaled matching and indexing, which aim to determine all positions in a text T that a pattern P occurs in its scaled form, are considered important because of their applications to computer vision. However, previous results only focus on enlarged patterns, and do not allow shrunk patterns since they may disappear. In this paper, we give the definition and an efficient indexing algorithm for proportionally-scaled patterns that can be visually enlarged or shrunk. The proposed indexing algorithm takes O(|T|) time in its preprocessing phase, and achieves O(|P|+U"p+logm) time in its answering phase, where |T|, |P|, U"p, and m denote the length of T, the length of P, the number of reported positions, and the length of T under run-length representation, respectively.