A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
An O(n log n) Algorithm for Com puting all Maximal Quasiperiodicities in Strings
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.