Elsevier

Journal of Algorithms

Volume 6, Issue 1, March 1985, Pages 132-137
Journal of Algorithms

Finding approximate patterns in strings

https://doi.org/10.1016/0196-6774(85)90023-9Get rights and content

Abstract

Let p (the pattern) be a string and t ≥ 0 an integer. The problem of locating in any string a substring whose edit distance from p is at most a given constant t is considered. An algorithm is presented to construct a deterministic finite-state automaton that solves the problem.

References (5)

There are more references available in the full text version of this article.

Cited by (286)

  • Auto-detection of sophisticated malware using lazy-binding control flow graph and deep learning

    2018, Computers and Security
    Citation Excerpt :

    The classification system compares an unknown malware sample with all existing ones based on three approximate matching algorithms. The first classification method employed ubiquitous edit distance (Ukkonen, 1985) on basic block sequences and a filtering algorithm. The second method applied a quantitative approach and B-Tree structure to improve speed.

  • Porting and Optimizing BWA-MEM2 Using the Fujitsu A64FX Processor

    2023, IEEE/ACM Transactions on Computational Biology and Bioinformatics
View all citing articles on Scopus
View full text