Author:
Yamamoto Takanori,Bannai Hideo,Inenaga Shunsuke,Takeda Masayuki
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Baeza-Yates, R.A.: Searching subsequences. Theoretical Computer Science 78(2), 363–376 (1991)
2. Baturo, P., Rytter, W.: Compressed string-matching in standard sturmian words. Theoretical Computer Science 410(30–32), 2804–2810 (2009)
3. Lecture Notes in Computer Science;P. Cégielski,2006
4. Lecture Notes in Computer Science;F. Claude,2009
5. Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: Proc. STACS 2009, pp. 529–540 (2009)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献