Funder
European Research Council
Academy of Finland
Horizon 2020
Subject
General Computer Science,Theoretical Computer Science
Reference63 articles.
1. Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails;Equi,2021
2. Compressed suffix arrays and suffix trees with applications to text indexing and string matching;Grossi;SIAM J. Comput.,2005
3. Indexing compressed text;Ferragina;J. ACM,2005
4. New text indexing functionalities of the compressed suffix arrays;Sadakane;J. Algorithms,2003
5. Compressed full-text indexes;Navarro;ACM Comput. Surv.,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献