Computing the lambda-covers of a string

Q Guo; H Zhang; C S Iliopoulos

doi:10.1016/j.ins.2007.02.020

Computing the lambda-covers of a string

Q Guo, H Zhang, C S Iliopoulos

Informatics

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

14 Citations (Scopus)

Abstract

Given a string x of length n and an integer constant lambda, the lambda-Cover Problem is defined to be the identification of all the sets of substrings each of equal length that cover x. This problem can be solved by a general algorithm in O(n(2)) time for constant alphabet size. We also generalize the lambda-Cover Problem, whereby a set of lambda substrings of different lengths are considered, which can be computed using the general algorithm in O(n(2)) time. (c) 2007 Elsevier Inc. All rights reserved

Original language	English
Pages (from-to)	3957 - 3967
Number of pages	11
Journal	INFORMATION SCIENCES
Volume	177
Issue number	19
DOIs	https://doi.org/10.1016/j.ins.2007.02.020
Publication status	Published - 1 Oct 2007

Access to Document

10.1016/j.ins.2007.02.020

Cite this

@article{0ab41763e5b14723b16cd67b37c54c72,

title = "Computing the lambda-covers of a string",

abstract = "Given a string x of length n and an integer constant lambda, the lambda-Cover Problem is defined to be the identification of all the sets of substrings each of equal length that cover x. This problem can be solved by a general algorithm in O(n(2)) time for constant alphabet size. We also generalize the lambda-Cover Problem, whereby a set of lambda substrings of different lengths are considered, which can be computed using the general algorithm in O(n(2)) time. (c) 2007 Elsevier Inc. All rights reserved",

author = "Q Guo and H Zhang and Iliopoulos, {C S}",

year = "2007",

month = oct,

day = "1",

doi = "10.1016/j.ins.2007.02.020",

language = "English",

volume = "177",

pages = "3957 -- 3967",

journal = "INFORMATION SCIENCES",

publisher = "ELSEVIER SCIENCE INC",

number = "19",

}

TY - JOUR

T1 - Computing the lambda-covers of a string

AU - Guo, Q

AU - Zhang, H

AU - Iliopoulos, C S

PY - 2007/10/1

Y1 - 2007/10/1

N2 - Given a string x of length n and an integer constant lambda, the lambda-Cover Problem is defined to be the identification of all the sets of substrings each of equal length that cover x. This problem can be solved by a general algorithm in O(n(2)) time for constant alphabet size. We also generalize the lambda-Cover Problem, whereby a set of lambda substrings of different lengths are considered, which can be computed using the general algorithm in O(n(2)) time. (c) 2007 Elsevier Inc. All rights reserved

AB - Given a string x of length n and an integer constant lambda, the lambda-Cover Problem is defined to be the identification of all the sets of substrings each of equal length that cover x. This problem can be solved by a general algorithm in O(n(2)) time for constant alphabet size. We also generalize the lambda-Cover Problem, whereby a set of lambda substrings of different lengths are considered, which can be computed using the general algorithm in O(n(2)) time. (c) 2007 Elsevier Inc. All rights reserved

U2 - 10.1016/j.ins.2007.02.020

DO - 10.1016/j.ins.2007.02.020

M3 - Article

VL - 177

SP - 3957

EP - 3967

JO - INFORMATION SCIENCES

JF - INFORMATION SCIENCES

IS - 19

ER -

Computing the lambda-covers of a string

Abstract

Access to Document

Fingerprint

Cite this