K
Kunihiko Sadakane
Researcher at University of Tokyo
Publications - 189
Citations - 13039
Kunihiko Sadakane is an academic researcher from University of Tokyo. The author has contributed to research in topics: Time complexity & Compressed suffix array. The author has an hindex of 41, co-authored 180 publications receiving 9314 citations. Previous affiliations of Kunihiko Sadakane include National Institute of Informatics & National University of Singapore.
Papers
More filters
Journal ArticleDOI
MEGAHIT: An ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
TL;DR: MEGAHIT is a NGS de novo assembler for assembling large and complex metagenomics data in a time- and cost-efficient manner and generated a three-time larger assembly, with longer contig N50 and average contig length.
Posted Content
MEGAHIT: An ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph
TL;DR: MEGAHIT as mentioned in this paper is a NGS de novo assembler for assembling large and complex metagenomics data in a time and cost-efficient manner, which avoids preprocessing like partitioning and normalization, which might compromise on result integrity.
Journal ArticleDOI
MEGAHIT v1.0: A fast and scalable metagenome assembler driven by advanced methodologies and community practices
Dinghua Li,Ruibang Luo,Chi-Man Liu,Chi-Ming Leung,Hing-Fung Ting,Kunihiko Sadakane,Hiroshi Yamashita,Tak-Wah Lam +7 more
TL;DR: The details of the core algorithms in MEG AHIT v0.1 are described, and the new modules to upgrade MEGAHIT to version v1.0 are shown, which gives better assembly quality, runs faster and uses less memory.
Journal ArticleDOI
Compressed Suffix Trees with Full Functionality
TL;DR: The data structure proposed in this paper is the first one that has linear size and supports all operations efficiently and can be executed on compressed suffix trees with a slight slowdown of a factor of polylog(n).
Posted Content
Practical Entropy-Compressed Rank/Select Dictionary
TL;DR: Wang et al. as mentioned in this paper proposed four data structures, i.e., recrank, vcode, sdarray and sdarray, each of which is small if the number of elements in the input set is small.