Author:
Crochemore Maxime,Iliopoulos Costas S.,Mohamed Manal,Sagot Marie-France
Subject
General Computer Science,Theoretical Computer Science
Reference11 articles.
1. M.I. Abouelhoda, S. Kurtz, E. Ohlebusch, The enhanced suffix array and its applications to genome analysis, in: Proc. Second Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, Vol. 2452, Springer, Berlin, 2002, pp. 449–463.
2. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J. Discrete Algorithms,2004
3. An algorithm for the organization of information;Adel'son-Vel'skii;Dokl. Akad. Nauk SSSR,1962
4. Finding maximal pairs with bounded gap;Brodal;J. Discrete Algorithms,2000
5. A fast merging algorithm;Brown;J. ACM,1979
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献