Abstract
We study the λ-seed problem of a string in this paper. Given a string x of length n and an integer λ, the λ-seed problem is to find all the sets of λ substrings of x that cover a superstring of x, assuming that each element of the set is of equal length. We present an efficient algorithm that can compute all the λ-seeds of x in O(n 2) time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings. Information Processing Letters 39, 17–20 (1991)
Apostolico, A., Preparata, F.P.: Optimal off-line detection of repetitions in a string. Theoretical Computer Science 22, 297–315 (1983)
Breslauer, D.: An on-line string superprimitivity test. Information Processing Letters 44, 345–347 (1992)
Breslauer, D.: Testing string superprimitivity in parallel. Information Processing Letters 49, 235–241 (1994)
Ben-Amram, A.M., Berkman, O., Iliopoulos, C.S., Park, K.: The subtree max gap problem with application to parallel string covering. In: Proc. of 5th ACM-SIAM Symp. on Discrete Algorithmsocessing Letters, Arlington, VA, pp. 501–510 (1994)
Cole, R., Iliopoulos, C.S., Mohamed, M., Smith, W.F., Yang, L.: Computing the minimum k-cover of a string. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 51–64 (2003)
Crochemore, M.: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letters 12(5), 244–250 (1981)
Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a string. Algorithmica 16, 288–297 (1996)
Iliopoulos, C.S., Park, K.: An optimal O(loglogn) time algorithm for parellel superprimitivity testing. J. of the Korean Information Science Society 21(8), 1400–1404 (1994)
Iliopoulos, C.S., Park, K.: A work-time optimal algorithm for computing all string covers. Theoretical Computer Science 2(164), 299–310 (1996)
Iliopoulos, C.S., Smith, W.F.: An on-line algorithm of computing a minimum set of k-covers of a string. In: Proc. of the Ninth Australian Workshop on Combinatorial Algorithms (AWOCA), pp. 97–106 (1998)
Li, Y., Smyth, W.F.: Computing the cover array in linear time. Algorithmica 32(1), 95–106 (2002)
Moore, D.W.G., Smyth, W.F.: A correction to Computing the covers of a string in linear time. Information Processing Letters 54, 101–103 (1995)
Zhang, H., Guo, Q., Iliopoulos, C.S.: The λ-cover problem of a string. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998. Springer, Heidelberg (submitted, 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Q., Zhang, H., Iliopoulos, C.S. (2006). Computing the λ-Seeds of a String. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_28
Download citation
DOI: https://doi.org/10.1007/11775096_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35157-3
Online ISBN: 978-3-540-35158-0
eBook Packages: Computer ScienceComputer Science (R0)