Kunihiko Sadakane

Citeras av

	Alla	Sedan 2019
Citat	14242	8923
h-index	43	23
i10-index	92	44

2200

1100

550

1650

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202449 63 90 122 167 162 261 243 331 276 263 309 386 364 365 454 578 615 773 1038 1447 1624 1848 2192

Offentlig åtkomst

Visa alla

10 artiklar

1 artikel

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

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

Följ

Kunihiko Sadakane

Professor at Department of Mathematical Informatics, The University of Tokyo

Verifierad e-postadress på mist.i.u-tokyo.ac.jp - Startsida

Algorithms and Data Structures


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
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	6317	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	1458	2016
Practical entropy-compressed rank/select dictionary D Okanohara, K Sadakane 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007	391	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	252	2012
Succinct representations of lcp information and improvements in the compressed suffix arrays K Sadakane SODA 2, 225-232, 2002	213	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	192	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	134	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

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ

Citeras av

Medförfattare