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...
Saved in:
| Main Author: | HyunJin Kim |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2021-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0251047&type=printable |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimization of Expression Matching for String Matching
by: Tianlong Yang, et al.
Published: (2013-01-01) -
Optimization of Expression Matching for String Matching
by: Tianlong Yang, et al.
Published: (2013-01-01) -
Collective field theory of gauged multi-matrix models: integrating out off-diagonal strings
by: Suddhasattwa Brahma, et al.
Published: (2025-06-01) -
Generalized Perron complements in diagonally dominant matrices
by: Qin Zhong, et al.
Published: (2024-11-01) -
Finite-Time Attractivity for Diagonally Dominant Systems with Off-Diagonal Delays
by: T. S. Doan, et al.
Published: (2012-01-01)