Longest segment problems

    Research output: Contribution to journalArticleAcademicpeer-review

    8 Citations (Scopus)
    2 Downloads (Pure)

    Abstract

    The following problem is considered: given a predicate p on strings, determine the longest segment of a given string that satisfies p. This paper is an investigation of algorithms solving this problem for various predicates. The predicates considered are expressed in terms of simple functions like the size, the minimum, the maximum, the leftmost and the rightmost element of the segment. The algorithms are linear in the length of the string.
    Original languageEnglish
    Pages (from-to)39-66
    JournalScience of Computer Programming
    Volume18
    Issue number1
    DOIs
    Publication statusPublished - 1992

    Cite this