Finding Maximal Quasiperiodicities in Strings-Reference-Cited by-同舟云学术

Finding Maximal Quasiperiodicities in Strings

Published:2000 Issue: Volume: Page:397-411
ISSN:0302-9743
Container-title:Combinatorial Pattern Matching
language:
Short-container-title:

Author:

Brodal Gerth St/øting,Pedersen Christian N. S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45123-4_33

Reference28 articles.

1. G. M. Adel’son-Vel’skii and Y. M. Landis. An algorithm for the organization of information. Doklady Akademii Nauk SSSR, 146:263–266, 1962. English translation in Soviet Math. Dokl., 3:1259–1262.

2. A. V. Aho, J. E. Hopcraft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.

3. Lect Notes Comput Sci;A. Apostolico,1997

4. A. Apostolico and A. Ehrenfeucht. Efficient detection of quasiperiodicities in strings. Theoretical Computer Science, 119:247–265, 1993.

5. A. Apostolico, M. Farach, and C. S. Iliopoulos. Optimal superprimitivity testing for strings. Information Processing Letters, 39:17–20, 1991.

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

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

2. Computing Covers Under Substring Consistent Equivalence Relations;String Processing and Information Retrieval;2020

3. Crochemore’s Partitioning on Weighted Strings and Applications;Algorithmica;2017-01-27

4. On Quasiperiodic Morphisms;Lecture Notes in Computer Science;2013

5. Fast Algorithm for Partial Covers in Words;Combinatorial Pattern Matching;2013