Name
Abstract | ||
|---|---|---|
In this paper, we study approximate regularities of strings, that is, approximate periods, approximate covers, and approximate seeds. We explore their similarities and differences and we implement algorithms for solving the smallest distance approximate period/cover/seed problem and the restricted smallest approximate period/cover/seed/ problem in polynomial time, under a variety of distance rules (the Hamming distance, the edit distance, and the weighted edit distance). Then, we analyse our experimental results to find out the time complexity of the algorithms in practice. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.mcm.2005.09.013 | Mathematical and Computer Modelling |
Keywords | Field | DocType |
distance rule,approximate cover,hamming distance,weighted edit distance,smallest distance approximation,seed problem,smallest distance,edit distance,restricted smallest distance approximation,approximate period,approximate regularity,approximate seed,polynomial time,restricted smallest approximate period,approximate regularities,time complexity | Edit distance,Similitude,Combinatorics,Algorithm complexity,Polynomial,Jaro–Winkler distance,Hamming distance,Approximate string matching,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 7-8 | Mathematical and Computer Modelling |
Citations | PageRank | References |
1 | 0.36 | 6 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. Christodoulakis | 1 | 1 | 0.36 |
| C. S. Iliopoulos | 2 | 52 | 6.67 |
| Kunsoo Park | 3 | 1396 | 171.00 |
| Jeong Seop Sim | 4 | 231 | 20.00 |