|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2022-12-06 11:25 |
Ehime |
Ehime Univ. Media Hall |
Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) COMP2022-25 |
(To be available after the conference date) [more] |
COMP2022-25 pp.21-28 |
COMP |
2014-12-05 13:00 |
Kumamoto |
Sojo University |
[Invited Talk]
A new characterization of maximal repetitions by Lyndon trees Hideo Bannai (Kyushu Univ.), Tomohiro I (TU Dortmund), Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta (Kyushu Univ.) COMP2014-35 |
A run is a maximal periodic sub-interval of a string, that is at least as long as twice its smallest period. Runs are im... [more] |
COMP2014-35 p.21 |
COMP |
2012-09-03 09:30 |
Tokyo |
Hosei University |
Permuted Pattern Matching and Indexing Structure for Multi-Track Strings Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.) COMP2012-26 |
We propose a new variant of pattern matching on a multi-set of
strings, or multi-tracks, called permuted-matching,
tha... [more] |
COMP2012-26 pp.1-8 |
COMP |
2011-05-11 13:00 |
Nagano |
Shinshu Univ. |
A String Pattern Matching Algorithm for Non-Linear Collage Systems Junichi Yamamoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-12 |
A non-linear text is a directed graph where each vertex is labeled with a string.
In this paper, we propose a \emph{non... [more] |
COMP2011-12 pp.1-7 |
COMP |
2011-05-11 13:35 |
Nagano |
Shinshu Univ. |
Algorithms for Computing Longest Common Substring/Subsequence on Non-Linear Texts Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2011-13 |
A non-linear text is a directed graph where each vertex is labeled with a string.
In this paper, we define Longest comm... [more] |
COMP2011-13 pp.9-16 |
COMP |
2010-09-29 13:30 |
Niigata |
Nagaoka Univ. of Tech. |
Counting and Verifying Maximal Palindromes Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2010-27 |
A palindrome is a symmetric string that reads the same forward and backward. Let $\pals(w)$ denote the set of maximal pa... [more] |
COMP2010-27 pp.25-30 |
COMP |
2009-03-02 09:45 |
Tokyo |
Tokyo Institute of Technology |
An Algorithm to Test Square-Freeness of BSLP-Compressed Strings Wataru Matsubara (Tohoku Univ.), Shunsuke Inenaga (Kyushu Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2008-55 |
Balanced Straight line programs(BSLPs) is one of the most powerful and general compression schemes. An BSLP is a context... [more] |
COMP2008-55 pp.9-16 |
COMP |
2008-03-10 15:15 |
Kanagawa |
|
Polynomial time algorithms for computing longest common substring and all palindromes from compressed strings Wataru Matsubara (Tohoku Univ.), Shunsuke Inenaga (Kyushu Univ.), Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto (Tohoku Univ.) COMP2007-63 |
\emph{Straight line programs} (\emph{SLPs}) is one of the most powerful and general compression schemes. An SLP is a con... [more] |
COMP2007-63 pp.55-62 |
COMP |
2007-04-26 16:25 |
Kyoto |
Katsura Campus, Kyoto University |
Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They
used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|