Efficient indexing algorithms for one-dimensional discretely-scaled strings

Abstract

The discretely-scaled string indexing problem asks one to preprocess a given text string T , so that for a queried pattern P , the matched positions in T that P appears with some discrete scale can be reported efficiently.

The indexing for one-dimensional proportionally-scaled strings

“…Peng et al [14] integer (1) and (3) Table 1 summarizes our result with other indexing algorithms for scaled patterns. For simplicity, we assume the alphabet of T is fixed.…”

“…For fixed alphabets, related techniques of suffix trees [10,16] and suffix arrays [11] can achieve both the optimal preprocessing Problems of inexact matching [2,3,6,8] have also drawn much attention recently. Among them, related problems that involve matching [2][3][4][5] or indexing [14,15,17] scaled patterns are considered not only interesting, but also realistic in the field of computer vision. One should note that, however, these algorithms [2][3][4][5]14,15,17] only discuss enlarged patterns but avoid shrunk ones.…”

“…Among them, related problems that involve matching [2][3][4][5] or indexing [14,15,17] scaled patterns are considered not only interesting, but also realistic in the field of computer vision. One should note that, however, these algorithms [2][3][4][5]14,15,17] only discuss enlarged patterns but avoid shrunk ones. As mentioned in the previous literature [2], this is because the pattern may disappear, which would cause a scaled match at every position in T .…”