Neerja Mhaskar ; W. F. Smyth - String Covering: A Survey

fi:10368 - Fundamenta Informaticae, October 14, 2023, Volume 190, Issue 1
String Covering: A SurveyArticle

Authors: Neerja Mhaskar ; W. F. Smyth

    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.

    Volume: Volume 190, Issue 1
    Published on: October 14, 2023
    Accepted on: August 24, 2023
    Submitted on: November 24, 2022
    Keywords: Computer Science - Data Structures and Algorithms

    Consultation statistics

    This page has been seen 520 times.
    This article's PDF has been downloaded 193 times.