Computing the λ-covers of a string-Reference-Cited by-同舟云学术

Computing the λ-covers of a string

Published:2007-10 Issue:19 Volume:177 Page:3957-3967
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Guo Qing,Zhang Hui,Iliopoulos Costas S.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference12 articles.

1. A. Amir, E. Chencinski, C.S. Iliopoulos, T. Kopelowitz, H. Zhang, Property matching and weighted matching, in: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching (CPM 06), Lecture notes in Computer Science, Barcelona, Spain, vol. 4009, 2006, pp. 188–199.

2. Optimal superprimitivity testing for strings;Apostolico;Information Processing Letters,1991

3. An on-line string superprimitivity test;Breslauer;Information Processing Letters,1992

4. R. Cole, C.S. Iliopoulos, M. Mohamed, W.F. Smyth, L. Yang, Computing the minimum k-cover of a string, in: Proceedings of the 2003 Prague Stringology Conference, Prague, 2003, pp. 51–64.

5. An optimal algorithm for computing the repetitions in a word;Crochemore;Information Processing Letters,1981

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. String Covering: A Survey;Fundamenta Informaticae;2023-10-27

2. Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem;String Processing and Information Retrieval;2023

3. Experimental evaluation of algorithms for computing quasiperiods;Theoretical Computer Science;2021-01

4. A Linear-Time Algorithm for Seeds Computation;ACM Transactions on Algorithms;2020-04-30

5. On-line Minimum Closed Covers;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2014