Name
Title | ||
|---|---|---|
Circular Bit-Vector-Mismatches: A New Approximate Circular String Matching With K-Mismatches |
Abstract | ||
|---|---|---|
This paper proposes a circular bit-vector-mismatches (CBVM) algorithm for approximate circular string matching with k-mismatches. We develop the proposed CBVM algorithm based on the rotation feature of the circular pattern. By reusing the matching information of the previous substring, the next substring of the input string can be processed in parallel. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1587/transfun.E99.A.1726 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
approximate string matching, bit-vector-mismatches, circular string, Hamming distance | String searching algorithm,Discrete mathematics,Commentz-Walter algorithm,Theoretical computer science,Hamming distance,Approximate string matching,Hamming weight,String metric,Bitap algorithm,Bit array,Mathematics | Journal |
Volume | Issue | ISSN |
E99A | 9 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| ThienLuan Ho | 1 | 0 | 1.69 |
| Seungrohk Oh | 2 | 41 | 6.04 |
| Hyunjin Kim | 3 | 42 | 4.84 |