DSCalgo
Department of Data Science Algorithm Design and Analysis, M&D Data Science Center, Institute of Biomedical Engineering, Institute of Science Tokyo
We are a small group of theoretical computer scientists, working on methods for efficient processing of large scale data that appear in modern biomedical domain, most prominently, sequence data.
Some of our research topics are: pattern matching, text compression, efficient processing of compressed data, and combinatorics on words.
We are located on the 5th floor of Building 22 in Surugadai Campus at 2-3-10 Kanda Surugadai, Chiyoda-Ku, Tokyo 101-0062.
We welcome prospective students with preferably a strong background in computer science and algorithms. See information on our graduate school.
Latest News
View allLatest Publications
View allJournalBijective BWT Based Compression Schemes
Golnaz Badkobeh, Hideo Bannai, Tomohiro I, Dominik Köppl — Theory Comput. Syst., 2026
Cite (BibTeX)
@article{DBLP:journals/mst/BadkobehBIK26, author = {Golnaz Badkobeh and Hideo Bannai and Tomohiro I and Dominik K{\"{o}}ppl}, title = {Bijective {BWT} Based Compression Schemes}, journal = {Theory Comput. Syst.}, volume = {70}, number = {3}, pages = {42}, year = {2026}, url = {https://doi.org/10.1007/s00224-025-10235-w}, doi = {10.1007/S00224-025-10235-W}, timestamp = {Tue, 28 Jul 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BadkobehBIK26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalComputing NP-hard Repetitiveness Measures via MAX-SAT
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto, Bernardo Subercaseaux — ACM Trans. Algorithms, 2026
Cite (BibTeX)
@article{DBLP:journals/talg/BannaiGIKKNS26, author = {Hideo Bannai and Keisuke Goto and Masakazu Ishihata and Shunsuke Kanda and Dominik K{\"{o}}ppl and Takaaki Nishimoto and Bernardo Subercaseaux}, title = {Computing NP-hard Repetitiveness Measures via {MAX-SAT}}, journal = {{ACM} Trans. Algorithms}, volume = {22}, number = {2}, pages = {15:1--15:25}, year = {2026}, url = {https://doi.org/10.1145/3777895}, doi = {10.1145/3777895}, timestamp = {Mon, 22 Jun 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BannaiGIKKNS26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }PreprintFast and Optimal Differentially Private Frequent-Substring Mining
Peaker Guo, Rayne Holland, Hao Wu
Cite (BibTeX)
@article{DBLP:journals/corr/abs-2603-09166, author = {Peaker Guo and Rayne Holland and Hao Wu}, title = {Fast and Optimal Differentially Private Frequent-Substring Mining}, journal = {CoRR}, volume = {abs/2603.09166}, year = {2026}, url = {https://doi.org/10.48550/arXiv.2603.09166}, doi = {10.48550/ARXIV.2603.09166}, eprinttype = {arXiv}, eprint = {2603.09166}, timestamp = {Thu, 09 Apr 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2603-09166.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }JournalGrammar index by induced suffix sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda — Theor. Comput. Sci., 2026
Cite (BibTeX)
@article{DBLP:journals/tcs/AkagiKNIBT26, author = {Tooru Akagi and Dominik K{\"{o}}ppl and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {Grammar index by induced suffix sorting}, journal = {Theor. Comput. Sci.}, volume = {1082}, pages = {116080}, year = {2026}, url = {https://doi.org/10.1016/j.tcs.2026.116080}, doi = {10.1016/J.TCS.2026.116080}, timestamp = {Thu, 02 Jul 2026 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/AkagiKNIBT26.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }