Cheng, Z., Liang, C.G.: Parallel Algorithms for Approximate String Matching on PRAM and LARPBS. Journal of Software 15(2), 159–169 (2004) MathSciNet MATHZhong Cheng,,Chen Guo-liang.Parallel algorithms for approxi-mate string matching on PRAM and LARPBS. Journal of Software . 2004...
Data structures and algorithms for approximate string matching (1988) Data structures and algorithms for approximate string matching. Journal of Complexity 4: pp. 33-72Galil, Z., and Giancarlo, R. Data structures ... Z Galil,R Giancarlo - 《Journal of Complexity》 被引量: 0发表: 1988年 ...
this algorithm can be easily extended to tackle the approximate case efficiently. Based on our solution for the exact case, we present two new fast average-case algorithms for approximate circular string matching withk-mismatches, under the Hamming...
Aligning sequencing reads onto a reference is an essential step of the majority of genomic analysis pipelines. Computational algorithms for read alignment have evolved in accordance with technological advances, leading to today’s diverse array of alignm
There is a wide range of applications that require to query a large database of texts to search for similar strings or substrings. Traditional approximate substring matching requests a user to specify a similarity threshold. Without top-k approximate substring matching, users have to try repeatedly...
stringapproximatealgorithmsmatchingfastgram FastAlgorithmsforTop-kApproximateStringMatching ZhengluYang #1 JianjunYu ∗2 MasaruKitsuregawa #3 # InstituteofIndustrialScience,TheUniversityofTokyo,Japan 13 {yangzl,kitsure}@tkl.iis.u-tokyo.ac.jp ∗ ComputerNetworkInformationCenter, ChineseAcademyofSciences,Bei...
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions -highly specialized and addressing only on...
This paper proposes new algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance. Fixed-length approximate string matching and...doi:10.1007/s11227-017-2192-6Ho, ThienLuanOh, Seung-Rohk...
Week 12: Approximate String Matching G. M. Landau and U. Vishkin, “Efficient string matching with k mismatches“, Theoretical Computer Science, Volume 43, 1986. M. J. Fischer and M. S. Paterson, “String Matching and Other Products“ K. Abrahamson, “Generalized string matching“, SIAM Jo...
摘要: This paper proposes new algorithms for fixed-length approximate string matching and approximate circular string matching under the Hamming distance. Fixed-length approximate string matching and...关键词: Approximate string matching Circular string Hamming distance Graphics processing units Parallel ...