Name
Abstract | ||
|---|---|---|
Three new simple O(nlogn) time algorithms related to repeating factors are presented in the paper. The first two algorithms employ only a basic textual data structure called the Dictionary of Basic Factors. Despite their simplicity these algorithms not only detect existence of powers (in particular, squares) in a string but also find all primitively rooted cubes (as well as higher powers) and all cubic runs. Our third O(nlogn) time algorithm computes all runs and is probably the simplest known efficient algorithm for this problem. It uses additionally the Longest Common Extension function, however, due to relaxed running time constraints, a simple O(nlogn) time implementation can be used. At the cost of logarithmic factor (in time complexity) we obtain novel algorithmic solutions for several classical string problems which are much simpler than (usually quite sophisticated) linear time algorithms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.dam.2013.05.009 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
new simple efficient algorithm,time complexity,basic factors,new simple o,linear time algorithm,simple o,time implementation,classical string problem,efficient algorithm,time constraint,time algorithm | Conference | 163 |
ISSN | Citations | PageRank |
0166-218X | 3 | 0.40 |
References | Authors | |
19 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| maxime crochemore | 1 | 73 | 6.84 |
| C. S. Iliopoulos | 2 | 52 | 6.67 |
| M. Kubica | 3 | 30 | 2.52 |
| jakub radoszewski | 4 | 32 | 2.90 |
| wojciech rytter | 5 | 130 | 17.13 |
| Krzysztof Stencel | 6 | 213 | 34.02 |
| Tomasz Waleń | 7 | 706 | 39.62 |