Name
Abstract | ||
|---|---|---|
We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings $S$ and $T$ of length $n$, we are to compute the longest factor of $S$ whose cyclic shift occurs as a factor of $T$. It is a new similarity measure, an extension of the classic Longest Common Factor. We show how to solve the LCCF problem in $O(n log^5 n)$ time. |
Year | Venue | Field |
|---|---|---|
2019 | Combinatorial Pattern Matching | Discrete mathematics,Combinatorics,Quasi linear,Similarity measure,Mathematics,Cyclic shift |
DocType | Volume | Citations |
Journal | abs/1901.11305 | 0 |
PageRank | References | Authors |
0.34 | 15 | 9 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mai Abdulaziz Alzamel | 1 | 14 | 6.02 |
| Maxime Crochemore | 2 | 2655 | 281.75 |
| Costas S. Iliopoulos | 3 | 1534 | 167.43 |
| Tomasz Kociumaka | 4 | 217 | 38.57 |
| Jakub Radoszewski | 5 | 624 | 50.36 |
| Wojciech Rytter | 6 | 2290 | 181.52 |
| Juliusz Straszynski | 7 | 2 | 5.15 |
| Tomasz Waleń | 8 | 706 | 39.62 |
| Wiktor Zuba | 9 | 1 | 5.13 |