Efficient algorithms for the scaled indexing problem

DOI10.1016/J.JALGOR.2004.03.006MaRDI QIDQ4828565zbMATH OpenOpenAlexFDO

Authors Biing-Feng Wang, Jyh-Jye Lin, Shan-Chyun Ku

Publication date 23 November 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.03.006

zbMATH Keywords

String matchingSuffix treesIndexingApproximate string matchingScaled matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Recommendations

• A new efficient indexing algorithm for one-dimensional real scaled patterns
• Efficient indexing algorithms for one-dimensional discretely-scaled strings
• The indexing for one-dimensional proportionally-scaled strings
• scientific article; zbMATH DE number 1445381
• Real two dimensional scaled matching.

Cited in

(5)

• A new efficient indexing algorithm for one-dimensional real scaled patterns
• The indexing for one-dimensional proportionally-scaled strings
• scientific article; zbMATH DE number 6792413 (Why is no real title available?)
• Efficient indexing algorithms for one-dimensional discretely-scaled strings
• A fast algorithm for index of annihilation computations

This page was built for publication: Efficient algorithms for the scaled indexing problem

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