MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph D Li, CM Liu, R Luo, K Sadakane, TW Lam Bioinformatics 31 (10), 1674-1676, 2015 | 5726 | 2015 |
MEGAHIT v1. 0: a fast and scalable metagenome assembler driven by advanced methodologies and community practices D Li, R Luo, CM Liu, CM Leung, HF Ting, K Sadakane, H Yamashita, ... Methods 102, 3-11, 2016 | 1333 | 2016 |
Practical entropy-compressed rank/select dictionary D Okanohara, K Sadakane 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007 | 386 | 2007 |
Fully functional static and dynamic succinct trees G Navarro, K Sadakane ACM Transactions on Algorithms (TALG) 10 (3), 1-39, 2014 | 382 | 2014 |
Compressed suffix trees with full functionality K Sadakane Theory of Computing Systems 41 (4), 589-607, 2007 | 365 | 2007 |
New text indexing functionalities of the compressed suffix arrays K Sadakane Journal of Algorithms 48 (2), 294-313, 2003 | 316 | 2003 |
Succinct de Bruijn graphs A Bowe, T Onodera, K Sadakane, T Shibuya International workshop on algorithms in bioinformatics, 225-235, 2012 | 244 | 2012 |
Biological sequence compression algorithms T Matsumoto, K Sadakane, H Imai Genome informatics 11, 43-52, 2000 | 215 | 2000 |
Succinct representations of lcp information and improvements in the compressed suffix arrays K Sadakane SODA 2, 225-232, 2002 | 211 | 2002 |
Compressed text databases with efficient query algorithms based on the compressed suffix array K Sadakane International symposium on algorithms and computation, 410-421, 2000 | 194 | 2000 |
Succinct data structures for flexible text retrieval systems K Sadakane Journal of discrete Algorithms 5 (1), 12-22, 2007 | 191 | 2007 |
Faster suffix sorting NJ Larsson, K Sadakane Univ., 1999 | 177 | 1999 |
Squeezing succinct data structures into entropy bounds K Sadakane, R Grossi Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 156 | 2006 |
Breaking a time-and-space barrier in constructing full-text indices WK Hon, K Sadakane, WK Sung 44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003 | 155 | 2003 |
Succinct trees in practice D Arroyuelo, R Cánovas, G Navarro, K Sadakane 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and …, 2010 | 133 | 2010 |
Random access to grammar-compressed strings and trees P Bille, GM Landau, R Raman, K Sadakane, SR Satti, O Weimann SIAM Journal on Computing 44 (3), 513-539, 2015 | 121 | 2015 |
Compressed indexes for dynamic text collections HL Chan, WK Hon, TW Lam, K Sadakane ACM Transactions on Algorithms (TALG) 3 (2), 21-es, 2007 | 113 | 2007 |
A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation K Sadakane Proceedings DCC'98 Data Compression Conference (Cat. No. 98TB100225), 129-138, 1998 | 109 | 1998 |
Faster suffix sorting NJ Larsson, K Sadakane Theoretical Computer Science 387 (3), 258-272, 2007 | 104 | 2007 |
Ultra-succinct representation of ordered trees J Jansson, K Sadakane, WK Sung SODA 7, 575-584, 2007 | 96 | 2007 |