Online Algorithms on Antipowers and Antiperiods-Reference-Cited by-同舟云学术

Online Algorithms on Antipowers and Antiperiods

Published:2019 Issue: Volume: Page:175-188
ISSN:0302-9743
Container-title:String Processing and Information Retrieval
language:
Short-container-title:

Author:

Alzamel Mai,Conte Alessio,Greco Daniele,Guerrini Veronica,Iliopoulos Costas,Pisanti Nadia,Prezza Nicola,Punzi Giulia,Rosone Giovanna

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-32686-9_13

Reference29 articles.

1. Alamro, H., Badkobeh, G., Belazzougui, D., Iliopoulos, C.S., Puglisi, S.J.: Computing the Antiperiod(s) of a string. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs (2019, to appear)

2. Alzamel, M., et al.: Quasi-linear-time algorithm for longest common circular factor. In: 30th Annual Symposium on Combinatorial Pattern Matching (CPM). LIPIcs (2019, to appear)

3. Lecture Notes in Computer Science;LAK Ayad,2018

4. Badkobeh, G., Fici, G., Puglisi, S.J.: Algorithms for anti-powers in strings. Inf. Process. Lett. 137, 57–60 (2018)

5. Bae, S.W., Lee, I.: On finding a longest common palindromic subsequence. Theor. Comput. Sci. 710, 29–34 (2018)

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

1. Finding the Cyclic Covers of a String;WALCOM: Algorithms and Computation;2023

2. Local Maximal Equality-Free Periodicities;IFIP Advances in Information and Communication Technology;2023

3. Faster Online Computation of the Succinct Longest Previous Factor Array;Lecture Notes in Computer Science;2020

4. Efficient Enumeration of Distinct Factors Using Package Representations;String Processing and Information Retrieval;2020