情報処理学会創立40周年記念論文賞
M. Takeda, Y. Shibata, T. Matsumoto, T. Kida, A. Shinohara, S. Fukamachi, T. Shinohara, and S. Arikawa:
Speeding up string pattern matching by text compression:
The dawn of a new era,
情報処理学会論文誌,
42(3), pp. 370-384, 2001.
Satoshi Yoshida and Takuya Kida:
A Variable-length-to-fixed-length Coding Method Using a Re-Pair Algorithm,
IPSJ Transactions on Databases,
Vol.6, No.4, pp.17-23, September, 2013.
Satoshi Yoshida, Takashi Uemura, Takuya Kida, Tatsuya Asai, and Seishi Okamoto:
Improving Parse Trees for Efficient Variable-to-Fixed Length Codes,
Journal of Information Processing,
Vol.20, No.1, pp.238-249, January, 2012.
Takashi Uemura, Daisuke Ikeda, Takuya Kida, and Hiroki Arimura:
Unsupervised Spam Detection by Document Probability Estimation with Maximal Overlap Method,
人工知能学会論文誌,
Vol. 26, No. 1, pp.297-306, January, 2011.
H.Sakamoto, S.Maruyama, T.Kida, S.Shimozono:
A space-saving approximation algorithm for grammar-based compression,
IEICE Trans. on Information and Systems,
E92, D(2), pp.158-165, February, 2009.
喜田拓也:
Arc-annotation 付きテキストに対するパターン照合アルゴリズム,
FIT情報科学技術レターズ,
vol.4, pp. 25-28, 2005年9月.
T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa:
Collage system: A unifying framework for compressed pattern matching,
Theoretical Computer Science,
298, pp. 253-272, Elsevier Science, Apr. 2003.
M. Takeda, Y. Shibata, T. Matsumoto, T. Kida, A. Shinohara, S. Fukamachi, T. Shinohara, and S. Arikawa:
Speeding up string pattern matching by text compression:
The dawn of a new era,
情報処理学会論文誌,
42(3), pp. 370-384, 情報処理学会, Mar. 2001.(情報処理学会 創立40周年記念論文賞 受賞)
T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa:
Multiple Pattern Matching in LZW Compressed Text,
Journal of Discrete Algorithms,
1(1), pp. 133-158, Hermes Science Publishing, Dec. 2000.
Jumpei Fujikawa, Takuya Kida, Takashi Katoh:
Extracting refrained phrases from music signals using a frequent episode pattern mining algorithm,
In Proc. of IEEE International Conference on Granular Computing (GrC2011),
pp.199-202, November, 2011.
Satoshi Yoshida and Takuya Kida:
On Performance of Compressed Pattern Matching on VF Codes,
In Proc. Data Compression Conference 2011,
p.486, Snowbird, Utah, March, 2011.
Takashi Uemura, Takuya Kida , Satoshi Yoshida, Tatsuya Asai and Seishi Okamoto:
Training Parse Trees for Efficient VF Coding,
Proc. of the 17th Symposium on String Processing and Information Retrieval(SPIRE2010),
Lecture Notes in Computer Science 6393, pp.179-184, October, 2010.
Satoshi Yoshida and Takuya Kida:
An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree,
Proc. Data Compression Conference 2010,
pp.219-228, Snowbird, Utah, March 2010.
Takuya Kida:
Suffix Tree Based VF-Coding for Compressed Pattern Matching,
In Proc. Data Compression Conference 2009,
p.449, March, 2009.
Hideyuki Ohtani, Takuya Kida, Takeaki Uno, Hiroki Arimura:
Efficient Serial Episode Mining with Minimal Occurrences,
Proc. of The 3rd International Conference on Ubiquitous Information Management and Communication (ICUIMC 2009),
pp.471-479, January, 2009.
Takuya Kida, Tomoya Saito, and Hiroki Arimura:
Flexible Framework for Time-Series Pattern Matching over Multi-Dimension Data Stream,
Proc. the First International Workshop on Algorithms for Large-Scale Information Processing in Knowledge Discovery (ALSIP2008),
pp.5-16, April, 2008.
Tomoya Saito, Takuya Kida, Hiroki Arimura:
An Efficient Algorithm for Complex Pattern Matching over Continuous Data Streams Based on Bit-Parallel Method,
Proceedings of The Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07),
pp.13-18, April, 2007.
Takuya Kida:
Faster Pattern Matching Algorithm for Arc-Annotated Sequences,
Proceedings of Dagstuhl Workshop on Federation over the Web,
LNAI3847, pp.25-39, 2006.
H. Sakamoto, T. Kida, and S. Shimozono:
A Space-Saving Linear-Time Algorithm for Grammar-Based Compression,
The Eleventh Symposium on String Processing and Information Retrieval (SPIRE2004),
Lecture Notes in Computer Science 3246,
pp. 218-229, Springer-Verlag, Oct. 2004.
T. Kida and H. Arimura:
Pattern Matching with Taxonomic Information,
Asia Information Retrieval Symposium (AIRS2004),
pp. 265-268, Oct. 2004.
M. Takeda, S. Miyamoto, T. Kida, A. Shinohara,
S. Fukamachi, T. Shinohara, and S. Arikawa:
Processing Text Files as Is:
Pattern Matching over Compressed Texts, Multi-Byte Character Texts, and Semi-Structured Texts,
Proc. 9th International Symposium on
String Processing and Information Retrieval (SPIRE2002),
Lecture Notes in Computer Science 2476,
pp. 170-186, Springer-Verlag, Sep. 2002.
T. Kida, T. Matsumoto, M. Takeda, A. Shinohara, and S. Arikawa:
Multiple pattern matching algorithms on collage system,
Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001),
Lecture Notes in Computer Science 2089,
pp. 193-206, Springer-Verlag, Jul. 2001.
G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa:
Faster Approximate String Matching Over Compressed Text,
Proc. Data Compression Conference (DCC2001),
pp. 459-468, IEEE Computer Society, Mar. 2001.
T. Matsumoto, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa:
Bit-parallel approach to approximate string matching in compressed texts,
Proc. 7th International Symposium on
String Processing and Information Retrieval (SPIRE2000),
pp. 221-228, IEEE Computer Society, Sep. 2000.
Y. Shibata, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa:
Speeding up pattern matching by text compression,
Proc. 4th Italian Conference on Algorithms and Complexity (CIAC2000),
Lecture Notes in Computer Science 1767,
pp. 306-315, Springer-Verlag, Mar. 2000.
K. Tamari, M. Yamasaki, T. Kida, M. Takeda, T. Fukuda, and I. Nanri:
Discovering poetic allusion in anthologies of classical Japanese poems,
Proc. 2nd International Conference on Discovery Science (DS'99),
Lecture Notes in Artificial Intelligence 1721,
pp. 128-138, Springer-Verlag, Dec. 1999.
T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa:
A unifying framework for compressed pattern matching,
Proc. 6th International Symposium on
String Processing and Information Retrieval (SPIRE'99),
pp. 89-96, IEEE Computer Society, Sep. 1999.
T. Kida, M. Takeda, A. Shinohara, and S. Arikawa:
Shift-And approach to pattern matching in LZW compressed text,
Proc. 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99),
Lecture Notes in Computer Science 1645,
pp. 1-13, Springer-Verlag, Jul. 1999.
T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa:
Multiple pattern matching in LZW compressed text,
Proc. Data Compression Conference (DCC'98),
pp. 103-112, IEEE Computer Society, Mar. 1998.
Satoshi Yoshida and Takuya Kida:
On Performance of VF Codes,
The 5th International Symposium on Global COE Program of Center for Next-Generation Information Technology Based on Knowledge Discovery and Knowledge Federation (GCOE-NGIT 2012),
Hokkaido University, Sapporo, January, 2012.
Satoshi Yoshida and Takuya Kida:
A Combination of Variable-length-to-Fixed-length Coding with Arithmetic Coding for Efficient Compression and Pattern Matching,
In 5th Workshop on Compression, Text, and Algorithms,
Los Cabos, Mexico, October, 2010.
Takuya Kida:
Compressed Pattern Matching Accelerates Keyword Search,
In Proc. of 2008 Interenational Workshop on Multi-Media Signal Processing (IWMMSP 2008),
pp.27-32, June, 2008.
Takuya Kida:
Compressed Pattern Matching Accelerates Keyword Search,
Interenational Workshop on Multi-Media Signal Processing (IWMMSP 2008),
Hokkaido University, January, 2008.
Takuya Kida:
Pattern Matching on Compressed Text,
International Symposium for the 55th Anniversary of CNU Chungnam National University,
Chungnam National University, Daejeon, Korea, October 24, 2007.
Takuya Kida, Takashi Uemura, and Hiroki Arimura:
Online Construction of Truncated Suffix Tree with Word Count Limitation,
Proceedings of DMSS2006,
pp.104-108, September, 2006.
Takuya Kida, Takashi Uemura, and Hiroki Arimura:
Application of Truncated Suffix Trees to Finding Sentences from the Internet,
Proceedings of Core-to-Core Workshop,
p.18, July, 2006.