Author:
Bille Philip,Cording Patrick Hagge,Gørtz Inge Li
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Charikar, M., Lehman, E., Liu, D., Panigrahy, R., Prabhakaran, M., Sahai, A., Shelat, A.: The smallest grammar problem. IEEE Trans. Inf. Theory 51(7), 2554–2576 (2005)
2. Farach, M.: Optimal suffix tree construction with large alphabets. In: Proc. 38th FOCS, pp. 137–143 (1997)
3. Gärtner, T.: A survey of kernels for structured data. ACM SIGKDD Explorations Newsletter 5(1), 49–58 (2003)
4. Gąsieniec, L., Kolpakov, R., Potapov, I., Sant, P.: Real-time traversal in grammar-based compressed files. In: Proc. 15th DCC, p. 458 (2005)
5. Lecture Notes in Computer Science;K. Goto,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices;Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining;2016-08-13