Abstract
This paper studies the minimum approximate λ-cover problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover problem is to find a set of λ substrings of equal length that covers x with the minimum error, under a variety of distance models including the Hamming distance, the edit distance and the weighted edit distance. We present an algorithm that can solve this problem in polynomial time.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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)
Breslauer, D.: An online string superprimitivity test. Information Processing Letters 44, 345–347 (1992)
Christodoulakis, M., Iliopoulos, C.S., Park, K., Sim, J.S.: Approximate seeds of strings. In: Proc. of the 2003 Prague Stringology Conference (PSC 2003), pp. 25–36 (2003)
Crochemore, M.: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letters 12(5), 244–250 (1981)
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)
Kim, S.-R., Park, K.: A dynamic edit distance table. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 60–68. Springer, Heidelberg (2000)
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)
Sim, J.S., Iliopoulos, C.S., Park, K., Smyth, W.F.: Approximate periods of strings. Theoretical Computer Science 262, 557–568 (2001)
Sim, J.S., Park, K., Kim, S., Lee, J.: Finding approximate covers of strings. Journal of Korea Information Science Society 29(1), 16–21 (2002)
Zhang, H., Guo, Q., Iliopoulos, C.S.: Computing the λ-covers of a string. In: AWOCA (accepted, 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 Minimum Approximate λ-Cover of a String. In: Crestani, F., Ferragina, P., Sanderson, M. (eds) String Processing and Information Retrieval. SPIRE 2006. Lecture Notes in Computer Science, vol 4209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11880561_5
Download citation
DOI: https://doi.org/10.1007/11880561_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45774-9
Online ISBN: 978-3-540-45775-6
eBook Packages: Computer ScienceComputer Science (R0)