Takip et
Kunihiko Sadakane
Kunihiko Sadakane
Professor at Department of Mathematical Informatics, The University of Tokyo
mist.i.u-tokyo.ac.jp üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
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
68122015
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
15622016
Practical entropy-compressed rank/select dictionary
D Okanohara, K Sadakane
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007
3932007
Compressed suffix trees with full functionality
K Sadakane
Theory of Computing Systems 41 (4), 589-607, 2007
3752007
New text indexing functionalities of the compressed suffix arrays
K Sadakane
Journal of Algorithms 48 (2), 294-313, 2003
3232003
Succinct de Bruijn graphs
A Bowe, T Onodera, K Sadakane, T Shibuya
International workshop on algorithms in bioinformatics, 225-235, 2012
2582012
Fully functional static and dynamic succinct trees
G Navarro, K Sadakane
ACM Transactions on Algorithms (TALG) 10 (3), 1-39, 2014
2402014
Succinct representations of lcp information and improvements in the compressed suffix arrays
K Sadakane
SODA 2, 225-232, 2002
2132002
Biological sequence compression algorithms
T Matsumoto, K Sadakane, H Imai
Genome informatics 11, 43-52, 2000
2132000
Succinct data structures for flexible text retrieval systems
K Sadakane
Journal of discrete Algorithms 5 (1), 12-22, 2007
1982007
Compressed text databases with efficient query algorithms based on the compressed suffix array
K Sadakane
International symposium on algorithms and computation, 410-421, 2000
1942000
Fully-functional succinct trees
K Sadakane, G Navarro
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
1802010
Faster suffix sorting
NJ Larsson, K Sadakane
Univ., 1999
1751999
Squeezing succinct data structures into entropy bounds
K Sadakane, R Grossi
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006
1562006
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
1562003
Succinct trees in practice
D Arroyuelo, R Cánovas, G Navarro, K Sadakane
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and …, 2010
1372010
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
1272015
Compressed indexes for dynamic text collections
HL Chan, WK Hon, TW Lam, K Sadakane
ACM Transactions on Algorithms (TALG) 3 (2), 21-es, 2007
1112007
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
1091998
Faster suffix sorting
NJ Larsson, K Sadakane
Theoretical Computer Science 387 (3), 258-272, 2007
1052007
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20