Longest segment problems

H. Zantema

doi:10.1016/0167-6423(92)90033-8

Longest segment problems

H. Zantema

Research output: Contribution to journal › Article › Academic › peer-review

10 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 language	English
Pages (from-to)	39-66
Journal	Science of Computer Programming
Volume	18
Issue number	1
DOIs	https://doi.org/10.1016/0167-6423(92)90033-8
Publication status	Published - 1992

Access to Document

10.1016/0167-6423(92)90033-8

Cite this

@article{3d223f1b1c8b41ec9291fa6ed6d6881a,

title = "Longest segment problems",

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.",

author = "H. Zantema",

year = "1992",

doi = "10.1016/0167-6423(92)90033-8",

language = "English",

volume = "18",

pages = "39--66",

journal = "Science of Computer Programming",

issn = "0167-6423",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - Longest segment problems

AU - Zantema, H.

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

U2 - 10.1016/0167-6423(92)90033-8

DO - 10.1016/0167-6423(92)90033-8

M3 - Article

SN - 0167-6423

VL - 18

SP - 39

EP - 66

JO - Science of Computer Programming

JF - Science of Computer Programming

IS - 1

ER -

Longest segment problems

Abstract

Access to Document

Fingerprint

Cite this