Kunihiko Sadakane

Citata da

	Tutte	Dal 2019
Citazioni	14168	8856
Indice H	43	23
i10-index	92	44

2200

1100

550

1650

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202449 63 90 122 167 162 261 243 331 276 263 309 392 364 367 454 578 609 773 1038 1445 1627 1847 2125

Accesso pubblico

Visualizza tutto

10 articoli

1 articolo

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Wing-Kin Sung (宋永健)Professor of Chemical Pathology, Chinese University of Hong KongEmail verificata su cuhk.edu.hk
Tak-Wah LamUniversity of Hong KongEmail verificata su cs.hku.hk
Wing-Kai Hon (韓永楷)Professor of Computer Science, National Tsing Hua University, TaiwanEmail verificata su cs.nthu.edu.tw
Hirotaka OnoNagoya University, JapanEmail verificata su i.nagoya-u.ac.jp
Masafumi YamashitaKyushu UniversityEmail verificata su inf.kyushu-u.ac.jp
Gonzalo NavarroUniversity of ChileEmail verificata su dcc.uchile.cl
Srinivasa Rao SattiProfessor, NTNUEmail verificata su ntnu.no
Dinghua LiThe University of Hong KongEmail verificata su cs.hku.hk
Ruibang LuoComputer Science, University of Hong KongEmail verificata su cs.hku.hk
Takeshi TokuyamaKwansei Gakuin UniversityEmail verificata su kwansei.ac.jp
Sankardeep ChakrabortyThe University of TokyoEmail verificata su imsc.res.in
Siu-Ming YiuProfessor of Computer Science, The University of Hong KongEmail verificata su cs.hku.hk
Roberto GrossiProfessor of Computer Science, University of Pisa, ItalyEmail verificata su unipi.it
Daisuke OkanoharaPreferred Networks Inc.Email verificata su preferred.jp
Koji TsudaProfessor, GSFS, The University of TokyoEmail verificata su k.u-tokyo.ac.jp
Dominik KöpplFaculty for Engineering, University of YamanashiEmail verificata su tu-dortmund.de
Diego ArroyueloDepartment of Computer Science, Escuela de Ingeniería, Pontificia Universidad Católica de ChileEmail verificata su uc.cl
Seungbum JoEmail verificata su cnu.ac.kr
N. Jesper LarssonSenior Lecturer in Computer Science, MalmöEmail verificata su avadeaux.net
Hiroki ArimuraGraduate School of Information Science and Technology, Hokkaido University, ProfessorEmail verificata su ist.hokudai.ac.jp

Segui

Kunihiko Sadakane

Professor at Department of Mathematical Informatics, The University of Tokyo

Email verificata su mist.i.u-tokyo.ac.jp - Home page

Algorithms and Data Structures


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	6264	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	1441	2016
Practical entropy-compressed rank/select dictionary D Okanohara, K Sadakane 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007	390	2007
Fully functional static and dynamic succinct trees G Navarro, K Sadakane ACM Transactions on Algorithms (TALG) 10 (3), 1-39, 2014	388	2014
Compressed suffix trees with full functionality K Sadakane Theory of Computing Systems 41 (4), 589-607, 2007	370	2007
New text indexing functionalities of the compressed suffix arrays K Sadakane Journal of Algorithms 48 (2), 294-313, 2003	319	2003
Succinct de Bruijn graphs A Bowe, T Onodera, K Sadakane, T Shibuya International workshop on algorithms in bioinformatics, 225-235, 2012	250	2012
Succinct representations of lcp information and improvements in the compressed suffix arrays K Sadakane SODA 2, 225-232, 2002	214	2002
Biological sequence compression algorithms T Matsumoto, K Sadakane, H Imai Genome informatics 11, 43-52, 2000	213	2000
Compressed text databases with efficient query algorithms based on the compressed suffix array K Sadakane International symposium on algorithms and computation, 410-421, 2000	195	2000
Succinct data structures for flexible text retrieval systems K Sadakane Journal of discrete Algorithms 5 (1), 12-22, 2007	193	2007
Faster suffix sorting NJ Larsson, K Sadakane Univ., 1999	176	1999
Squeezing succinct data structures into entropy bounds K Sadakane, R Grossi Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006	157	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	124	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	114	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	105	2007
Ultra-succinct representation of ordered trees J Jansson, K Sadakane, WK Sung SODA 7, 575-584, 2007	96	2007

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori