Affiliations: [a] Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, ON L8S 4L8, Canada. [email protected]
| [b] Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, ON L8S 4L8, Canada. [email protected]
Correspondence:
[*]
Address for correspondence: Department of Computing and Software, McMaster University, 1280 Main Street West, Hamilton, ON L8S 4L8, Canada.
Note: [†] This research was funded by NSERC [Grant No. 10536797].
Abstract: The study of strings is an important combinatorial field that precedes the digital computer. Strings can be very long, trillions of letters, so it is important to find compact representations. Here we first survey various forms of one potential compaction methodology, the cover of a given string x, initially proposed in a simple form in 1990, but increasingly of interest as more sophisticated variants have been discovered. We then consider covering by a seed; that is, a cover of a superstring of x. We conclude with many proposals for research directions that could make significant contributions to string processing in future.
