Of periods, quasiperiods, repetitions and covers-Reference-Cited by-同舟云学术

Of periods, quasiperiods, repetitions and covers

Published:1997 Issue: Volume: Page:236-248
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Apostolico Alberto,Breslauer Dany

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-63246-8_14.pdf

Reference26 articles.

1. volume 12 of NATO ASI Series F;A. Apostolico,1985

2. A. Apostolico, D. Breslauer, and Z. Galil. Optimal Parallel Algorithms for Periods, Palindromes and Squares. In Proc. 19th International Colloquium on Automata, Languages, and Programming, number 623 in Lecture Notes in Computer Science, pages 296–307. Springer-Verlag, Berlin, Germany, 1992.

3. A. Apostolico and A. Ehrenfeucht. Efficient Detection of Quasiperiodicities in Strings. Theoret. Comput. Sci., 119:247–265, 1993.

4. A. Apostolico, M. Farach, and C.S. Iliopoulos. Optimal Superprimitivity Testing for Strings. Inform. Process. Lett., 39:17–20, 1991.

5. A. Ben-Amram, O. Berkman, C. Iliopolous, and K. Park. Computing the Covers of a String in Linear Tme. In Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, pages 501–510, 1994.

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

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

2. Approximating the Anticover of a String;String Processing and Information Retrieval;2020

3. Can We Recover the Cover?;Algorithmica;2019-03-22

4. An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers;Lecture Notes in Computer Science;2019

5. INFERRING STRINGS FROM COVER ARRAYS;Discrete Mathematics, Algorithms and Applications;2013-06