Efficient indexing algorithms for one-dimensional discretely-scaled strings

DOI10.1016/J.IPL.2010.05.012zbMATH Open1234.68480OpenAlexW1969880101MaRDI QIDQ765528FDOQ765528

Authors: Yung-Hsing Peng, Chang-Biau Yang, Kuo-Si Huang, Hsing-Yen Ann 

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.012

Recommendations

• Efficient algorithms for the scaled indexing problem
• A new efficient indexing algorithm for one-dimensional real scaled patterns
• The indexing for one-dimensional proportionally-scaled strings
• Efficient one-dimensional real scaled matching
• Alphabet-Independent and Scaled Dictionary Matching

zbMATH Keywords

string matchingdiscrete scale

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• Fast Pattern Matching in Strings
• Real two dimensional scaled matching
• Real scaled matching
• On-line construction of suffix trees
• Efficient one-dimensional real scaled matching
• Efficient pattern matching with scaling
• Constructing suffix arrays in linear time
• Efficient algorithms for the scaled indexing problem
• On the sorting-complexity of suffix tree construction
• Matching patterns in strings subject to multi-linear transformations

Cited In (5)

• Efficient algorithms for the scaled indexing problem
• A new efficient indexing algorithm for one-dimensional real scaled patterns
• Two-dimensional substring indexing.
• The indexing for one-dimensional proportionally-scaled strings
• Indexing permutations for binary strings

This page was built for publication: Efficient indexing algorithms for one-dimensional discretely-scaled strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765528)