Faculty Profiles - I Tomohiro

Papers - I Tomohiro

Division display >> ／ All the affair displays1 - 65 of about 65

Computing Longest (Common) Lyndon Subsequences Reviewed International journal

Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi

International Workshop on Combinatorial Algorithms (IWOCA) 2022 ( Springer-Verlag ) 13270 LNCS 128 - 142 2022.06

The "runs" theorem Reviewed International journal

Bannai H., I T., Inenaga S., Nakashima Y., Takeda M., Tsuruta K.

SIAM Journal on Computing 46 ( 5 ) 1501 - 1514 2017.01

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences Reviewed

Bannai H., Tomohiro I., Kociumaka T., Köppl D., Puglisi S.J.

Algorithmica 86 ( 3 ) 735 - 756 2024.03

Longest bordered and periodic subsequences Reviewed International journal

Bannai H., I T., Köppl D.

Information Processing Letters 182 2023.08

PalFM-Index: FM-Index for Palindrome Pattern Matching Reviewed International journal

Nagashita S., Tomohiro I.

Leibniz International Proceedings in Informatics, LIPIcs 259 2023.06

Substring Complexities on Run-Length Compressed Strings Reviewed International journal

Kawamoto A., I T.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 13617 LNCS 132 - 143 2022.11

Privacy-Preserving Feature Selection with Fully Homomorphic Encryption Reviewed International journal

Ono S., Takata J., Kataoka M., Tomohiro I., Shin K., Sakamoto H.

Algorithms 15 ( 7 ) 2022.07

Space-Efficient B Trees via Load-Balancing Reviewed International journal

Tomohiro I, Dominik Köppl

International Workshop on Combinatorial Algorithms (IWOCA) 2022 ( Springer-Verlag ) 13270 LNCS 327 - 340 2022.06

A Compression-Based Multiple Subword Segmentation for Neural Machine Translation Reviewed

Nonaka K., Yamanouchi K., I T., Okita T., Shimada K., Sakamoto H.

Electronics (Switzerland) 11 ( 7 ) 2022.04

Converting RLBWT to LZ77 in smaller space Reviewed International journal

Masaki Shigekuni, Tomohiro I

Data Compression Conference (DCC) 2022 ( IEEE Computer Society Press CPS Online ) 2022-March 242 - 251 2022.03

PHONI: Streamed Matching Statistics with Multi-Genome References Reviewed International journal

Boucher C., Gagie T., Tomohiro I., Koppl D., Langmead B., Manzini G., Navarro G., Pacheco A., Rossi M.

Data Compression Conference Proceedings 2021-March 193 - 202 2021.03

Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree Reviewed

I T., Irving R.W., Köppl D., Love L.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12944 LNCS 143 - 150 2021.01

Authorship：Lead author Language：English Publishing type：Research paper (international conference proceedings)

Given a text T of length n, the sparse suffix sorting problem asks for the lexicographic order of suffixes starting at m selectable text positions P. The suffix binary search tree [Irving and Love, JDA’03] is a dynamic data structure that can answer this problem dynamically in the sense that insertions and deletions of positions in P are allowed. While a standard binary search tree on strings needs to store two longest-common prefix (LCP) values per node for providing the same query bounds, each suffix binary search tree node only stores a single LCP value and a bit flag. Its tree topology induces the sorting of the m suffixes by an Euler tour in O(m) time. However, it has not been addressed how to compute the lengths of the longest common prefixes of two suffixes with neighboring ranks with this data structure. We show that we can compute these lengths again by an Euler tour in O(m) time.

<I Tomohiro>

Papers - I Tomohiro