Author:
Amir Amihood,Iliopoulos Costas S.,Radoszewski Jakub
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference10 articles.
1. Optimal superprimitivity testing for strings;Apostolico;Inf. Process. Lett.,1991
2. Partial words and a theorem of Fine and Wilf;Berstel;Theor. Comput. Sci.,1999
3. An on-line string superprimitivity test;Breslauer;Inf. Process. Lett.,1992
4. Efficient seeds computation revisited;Christou,2011
5. Algorithms on Strings;Crochemore,2007
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. String Covering: A Survey;Fundamenta Informaticae;2023-10-27
2. Resolution of the burrows-wheeler transform conjecture;Communications of the ACM;2022-05-20
3. Experimental evaluation of algorithms for computing quasiperiods;Theoretical Computer Science;2021-01
4. Resolution of the Burrows-Wheeler Transform Conjecture;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
5. How Much Different Are Two Words with Different Shortest Periods;IFIP Advances in Information and Communication Technology;2018