Finding approximate patterns in strings
References (5)
The theory and computation of evolutionary distances: Pattern recognition
J. Algorithms
(1980)- et al.
A fast string matching algorithm
Comm. ACM
(1977)
There are more references available in the full text version of this article.
Cited by (286)
An alignment-free measure based on physicochemical properties of amino acids for protein sequence comparison
2019, Computational Biology and ChemistryAuto-detection of sophisticated malware using lazy-binding control flow graph and deep learning
2018, Computers and SecurityCitation 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.
Who rides the tide of regionalization: Examining the effect of the China-ASEAN Free Trade Area on the exports of Chinese firms
2018, International Business ReviewWFA-GPU: Gap-affine pairwise read-alignment using GPUs
2023, BioinformaticsPorting and Optimizing BWA-MEM2 Using the Fujitsu A64FX Processor
2023, IEEE/ACM Transactions on Computational Biology and Bioinformatics
Copyright © 1985 Published by Elsevier Inc.