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

  • 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, 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, 80424, Taiwan

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a pattern string P and a text string T, the one-dimensional real-scale pattern matching problem is to ask for all matched positions in T at which P occurs for some real scales =1. The real-scale indexing problem, which is derived from the real-scale matching problem, aims to preprocess T, so that all positions of scaled P in T can be answered efficiently. In this paper, we propose an improved algorithm for the real-scale indexing problem. For constant-sized alphabets, our preprocessing takes O(|T|^2) time and space, achieving the answering time O(|P|+w), where U"r denotes the number of matched positions and w=