A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
Finding all covers of an indeterminate string in O(n) time on average
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2022 1verdicts
UNVERDICTED 1roles
background 1polarities
background 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.