Cargando…
A k-mismatch string matching for generalized edit distance using diagonal skipping method
This paper proposes an approximate string matching with k-mismatches when calculating the generalized edit distance. When the edit distance is generalized, more sophisticated string matching can be provided. However, the execution time increases because of the bundle of complex computations for calc...
Autor principal: | Kim, HyunJin |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8096107/ https://www.ncbi.nlm.nih.gov/pubmed/33945564 http://dx.doi.org/10.1371/journal.pone.0251047 |
Ejemplares similares
-
A parallel approximate string matching under Levenshtein distance on graphics processing units using warp-shuffle operations
por: Ho, ThienLuan, et al.
Publicado: (2017) -
A Pipelined Non-Deterministic Finite Automaton-Based String Matching Scheme Using Merged State Transitions in an FPGA
por: Kim, HyunJin, et al.
Publicado: (2016) -
Computing the Shortest String and the Edit-Distance for Parsing Expression Languages
por: Cheon, Hyunjoon, et al.
Publicado: (2020) -
A Memory-Efficient Deterministic Finite Automaton-Based Bit-Split String Matching Scheme Using Pattern Uniqueness in Deep Packet Inspection
por: Kim, HyunJin, et al.
Publicado: (2015) -
MVDR-LSTM Distance Estimation Model Based on Diagonal Double Rectangular Array
por: Zhang, Xiong, et al.
Publicado: (2023)