A Digital Order-Preserving-Matching Algorithm Based on Binary Coding Processing

Luo Guo-hui; Lin Sui; Jiang Wen-chao

doi:10.12052/gdutxb.160157

English Version Journal Login

您当前的位置：

首页 >

文章列表页 >

A Digital Order-Preserving-Matching Algorithm Based on Binary Coding Processing

更新时间：2026-05-27

- A Digital Order-Preserving-Matching Algorithm Based on Binary Coding Processing
- Vol. 34, Issue 5, Pages: 56-59(2017)
- 作者机构：
- 作者简介：
- 基金信息：
- DOI：10.12052/gdutxb.160157
  CLC： TP301
- Online First：09 September 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
罗国辉, 林穗, 姜文超. 一种基于二进制编码处理的数字保序匹配算法[J]. 广东工业大学学报, 2017, 34(5): 56-59.

Luo Guo-hui, Lin Sui, Jiang Wen-chao. A Digital Order-Preserving-Matching Algorithm Based on Binary Coding Processing[J]. 2017, 34(5): 56-59.
罗国辉, 林穗, 姜文超. 一种基于二进制编码处理的数字保序匹配算法[J]. 广东工业大学学报, 2017, 34(5): 56-59. DOI： 10.12052/gdutxb.160157.

Luo Guo-hui, Lin Sui, Jiang Wen-chao. A Digital Order-Preserving-Matching Algorithm Based on Binary Coding Processing[J]. 2017, 34(5): 56-59. DOI： 10.12052/gdutxb.160157.

摘要

给出一个数字文本

跟一个数字文本段落

，在

中找出所有跟

相同关联顺序的子串称之为数字保序匹配问题.数字保序匹配问题是检测相似度和预测趋势领域的研究重点，在股票预测、基金走势、天气预报等方面有广泛应用.针对保序匹配算法在数字匹配中的效率问题，提出了基于二进制编码的数字字符匹配方法.首先，在保序匹配前先对数字字符进行二进制编码预处理；然后使用4种主流算法实现了保序匹配，并对匹配时间和复杂度进行对比分析.实验结果表明：该处理方法有效提高了数字字符匹配效率，同时保持了较低的时间复杂度.

Abstract

Giving a digital text

and a number of text paragraphs

and then finding in

all the same order with

-related sub-string is called the digital order preserving and matching. Digital order-matching is the focus of research on similarity and prediction trend

widely used in stock forecast

fund trend and weather forecast. Aiming at the efficiency of preserving and matching algorithm in digital matching

a character matching method based on binary coding has been proposed. Firstly

the binary characters are preprocessed before the order matching. Then the four main algorithms are used to achieve the order-preserving and matching

and the matching time and complexity are compared and analyzed. The experimental results

show that the proposed method effectively improves the efficiency of digital character matching while maintaining a low time complexity.

关键词

Keywords

references

NAVARRO G, RAFFINOT M. Flexible Pattern Matching in String Practical On-line Search Algorithms for Texts and BiologicalSequences[M]. Cambridge:Cambridge University Press, 2002. 23-28.

FARO S, LECROQ T. The exact online string matching problem:A review of the most recent results[J]. ACM Computing Surveys, 2013, 45(2):13-13.

KNUTH D E, MORRIS J H, PRATT V R. Fast pattern matchingin string[J]. SIAM Journalon Computing, 1977, 20(6):323-350.

BOYER R S, MOORE J S. A fast string searching algorithm[J]. Communications of the ACM, 1977, 20(10):762-772.

苏德福, 钟诚. 计算机算法设计与分析[M]. 2版. 北京:清华大学出版社, 2001. 57-59.

DANIEL M S. Very fast substring search algorithm[J]. Communications of the ACM, 1990, 33(8):132-142.

AHMED M, KAYKOBAD M, CHOWDHURY R A. A new string matching algorithm[J]. Computer Mathematics, 2003, 80(7):825-834.

赵森严, 黄伟, 李阳铭. 一种改迚的KMP入侵检测的模式匹配算法[J]. 井冈山大学学报(自然科学版), 2013, 34(1):55-58.ZHAO S Y, HUANG W, LI Y M. Improved model matching algorithm for KMP Intrusion detection[J]. Journal of Jinggangshan University:Natural Science, 2013, 34(1):55-58.

AMIR A, FARACH M. Efficient 2-dimensional approximate matching of halfrectangular figures[J]. Information and Computation, 2010, 118(1):1-11.

欧嵬, 吴纯青. 几种字符串匹配算法的分析和比较[J]. 微处理机, 2007, 28(4):59-62.OU W, WU C Q. Analysis and comparison of several string matching algorithms[J]. Microprocessors, 2007, 28(4):59-62.

杨俊丽, 吕晓燕, 满晰. 基于改进的KMP算法的词频统计[J]. 微计算机信息, 2010, 26(9):161-162.YANG J L, LYU X Y, MAN X. Based on improved KMP algorithm for word frequency statistics[J]. Microcomputer Information, 2010, 26(9):161-162.

李莉, 江育娥, 林劼, 等. 基于KMP算法的改进算法KMPP[J]. 计算机工程与应用, 2016, 52(8):33-37.LI L, JIANG Y E, LIN J, et al. Improved algorithm KMPP based on KMP[J]. Computer Engineering and Applications, 2016, 52(8):33-37.

CLIFFORD R, ILIOPOULOS C S. Approximate string matching for music analysis[J]. Soft Computing, 2004, 8(9):597-603.

陈文伟, 赵侠, 黄金才. 进化创新的绕行变换[J]. 广东工业大学学报, 2017, 34(1):1-5.CHEN W W, ZHAO X, HUANG J C. Modeling transformation of evolutionary innovation[J]. Journal of Guangdong University of Technology, 2017, 34(1):1-5.

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Robust Design for Artificial Noise-assisted UAV Terahertz Secure Communication

Research on Foreign Object Detection in Power Transmission Lines Based on the AAGV-YOLOX Model

Bimodal Iterative Cross-attention Fusion Ensemble Framework

An Optimal Operation Strategy for Community Microgrid Alliances Considering Power Exchange under Multi-package Shared Energy Storage Model

Multi-Scale Contrastive Embedding Enhanced Adaptive Intrusion Detection Model

Related Author

No data

Related Institution

No data

AI问答

⁰