Publications: Masayuki Takeda

Journal Articles

  1. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta.
    The "Runs" Theorem.
    SIAM Journal of Computing, 46(5):1501-1514, September 2017.

  2. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Inferring strings from Lyndon factorization.
    Theoretical Computer Science, 689:147-156, August 2017.

  3. Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
    Algorithmica, 79(2):291-318, 2017.

  4. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Taked.
    Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
    Theoretical Computer Science, 656(B):215-224, December 2016.

  5. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Generalized pattern matching and periodicity under substring consistent equivalence relations.
    Theoretical Computer Science, 656(B):225-233, December 2016.

  6. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.
    Information Processing Letters, 115:655-659, 2015.

  7. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara.
    Detecting regularities on grammar-compressed strings.
    Information and Computation, 240:74-89, 2015.

  8. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Compressed automata for dictionary matching.
    Theoretical Computer Science, 578:30-41, 2015.

  9. 末廣大貴，畑埜晃平, 坂内英夫, 瀧本英二, 竹田正幸.
    SVMによる2部ランキング学習を用いたコンピュータ将棋における評価関数の学習.
    電子情報通信学会論文誌, 97(3):593-600, March 2014.

  10. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Inferring strings from suffix trees and links on a binary alphabet.
    Discrete Applied Mathematics, 163:316-325, January 2014.

  11. Shota Yasutake, Kohei Hatano, Eiji Takimoto, Masayuki Takeda.
    Online Rank Aggregation.
    Journal of Machine Learning Research - Proceedings Track 25:539-553, 2013.

  12. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda.
    Palindrome pattern matching.
    Theoretical Computer Science, 483:162-170, 2013.

  13. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Fast q-gram Mining on SLP Compressed Strings.
    Journal of Discrete Algorithms, 18:89-99, 2013.

  14. Shirou Maruyama, Hiroshi Sakamoto, and Masayuki Takeda.
    An Online Algorithm for Lightweight Grammar-Based Compression.
    Algorithms, 5(2):214-235, 2012 (Special issue on Data Compression, Communication and Processing).

  15. Shin-ichi Yoshida, Kohei Hatano, Eiji Takimoto and Masayuki Takeda.
    Adaptive Online Prediction Using Weighted Windows.
    IEICE Trans. on Information and Systems E94-D(10):1917-1923, 2011 (Special issue on Information-Based Induction Sciences and Machine Learning).

  16. Shirou Maruyama, Yohei Tanaka, Hiroshi Sakamoto, and Masayuki Takeda.
    Context-Sensitive Grammar Transform: Compression and Pattern Matching.
    IEICE Trans. on Information and Systems 93-D(2):219-226, 2010.

  17. Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara.
    Linear-Time Text Compression by Longest-First Substitution.
    Algorithms 2(4):1429-1448, 2009.

  18. T. Matsumoto, K. Hagio, and M. Takeda.
    A Run-Time Efficient Implementation of Compressed Pattern Matching Automata.
    Int. J. Found. Comput. Sci. 20(4):717-733, 2009.

  19. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda.
    Reachability on Suffix Tree Graphs.
    Int. J. Found. Comput. Sci.19(1):147-162, 2008.

  20. 大谷 壽一, 竹田 正幸, 今田 結城, 澤田 康文.
    医薬品の取り違えミスを防止するための薬名類似度の定量的指標の構築.
    薬学雑誌126(5):349-356, 2006. (PDF)

  21. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda.
    A fully compressed pattern matching algorithm for simple collage systems.
    Int. J. Found. Comput. Sci.16(6):1155-1166, 2005.

  22. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi.
    On-Line Construction of Compact Directed Acyclic Word Graphs.
    Discrete Applied Mathematics, 146(2):156-179, 2005 (special issue for CPM'01).

  23. Hideo Bannai, Heikki Hyyro, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano.
    An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.
    IEEE/ACM Transactions on Computational Biology and Bioinformatics (special section on the Workshop on Algorithms in Bioinformatics), 1(4):159-170, (2004).

  24. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara.
    Ternary Directed Acyclic Word Graphs.
    Theoretical Computer Science328(1-2):97-111, 2004 (special issue for CIAA'03).

  25. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano.
    Efficiently finding regulatory elements using correlation with gene expression.
    Journal of Bioinformatics and Computational Biology, 2(2):273-288, 2004.

  26. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    Compact Directed Acyclic Word Graphs for a Sliding Window.
    Journal of Discrete Algorithms, 2(1):33-51, March 2004 (special issue for SPIRE'02).

  27. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa.
    A note on randomized algorithm for string matching with mismatches,
    Nordic Journal of Computing, 10:2-10, April 2003.

  28. Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Collage system: A unifying framework for compressed pattern matching,
    Theoretical Computer Science, 298(1):253-272, April 2003. ( Abstract + References )

  29. Masayuki Takeda, Tomoko Fukuda, Ichiro Nanri, Mayumi Yamasaki, and Koichi Tamari.
    Discovering instances of poetic allusion from anthologies of classical Japanese poems,
    Theoretical Computer Science , 292(2):497-524, January 2003. ( Abstract + References )

  30. Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, and Ichiro Nanri.
    Discovering characteristic expressions in literary works,
    Theoretical Computer Science , 292(2):525-546, January 2003. ( Abstract + References )

  31. Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara and Masayuki Takeda.
    Uniform characterization of polynomial-query learnabilities,
    Theoretical Computer Science, 292(2):377-385, January 2003. ( Abstract + References )

  32. Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    A practical algorithm to find the best subsequences patterns,
    Theoretical Computer Science , 292(2):465-479, January 2003. ( Abstract + References )

  33. 平尾 昌啓, 篠原 歩, 竹田 正幸, 有川 節夫.
    平衡直線的プログラムに対するパターン照合アルゴリズム.
    電子情報通信学会和文論文誌, J84-A(6):722-730, June 2001. (PDF)

  34. Masayuki Takeda, Yusuke Shibata, Tetsuya Matsumoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, and Setsuo Arikawa.
    Speeding up string pattern matching by text compression: The dawn of a new era,
    Trans. Information Processing Society of Japan, 42(3):370-384, March 2001. (PDF)
    IPSJ 40th Anniversary Award Paper.

  35. 竹田正幸，福田智子，南里一郎，山崎真由美，玉利公一.
    和歌データからの類似歌発見.
    統計数理，48(2):289-310, December 2000. (PDF)

  36. Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, and Setsuo Arikawa.
    Multiple Pattern Matching in LZW Compressed Text.
    Journal of Discrete Algorithms , 1(1):133-158, November 2000. (PDF)

  37. Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda.
    An Improved Pattern Matching Algorithm for Strings in terms of Straight-line Programs,
    Journal of Discrete Algorithms , 1(1):187-204, November 2000. (PDF)

  38. Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Pattern Matching in Text Compressed by Using Antidictionaries.
    Journal of Discrete Algorithms , 1(1):257-269, November 2000. (PDF)

  39. Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, and Ichiro Nanri.
    Discovering characteristic patterns from collections of classical Japanese poems.
    New Generation Computing , 18(1):61-73, November 1999.

  40. 竹田正幸，福田智子，南里一郎，山崎真由美.
    和歌データベースにおける特徴パターンの発見.
    情報処理学会論文誌, 40(3):783-795, March 1999.

  41. 宮崎正路，深町修一，竹田正幸，篠原武.
    圧縮テキストに対するパターン照合機械の高速化.
    情報処理学会論文誌, 39(9):2638-2648, September 1998.

  42. 竹田正幸，須田淳一郎，楠本典孝，松尾文碩.
    英文科学技術抄録文における名詞の決定.
    情報処理学会論文誌, 36(8):1826-1837, August 1995.

  43. Noriyoshi Uratani and Masayuki Takeda.
    A fast string-searching algorithm for multiple patterns.
    Information Processing & Mangement, 29(6):775-791, November 1993.

  44. 竹田正幸，松尾文碩.
    英文科学技術抄録文における動詞の決定.
    情報処理学会論文誌, 34(9):1931-1936, September 1993.

  45. Masayuki Takeda.
    A fast matching algorithm for patterns with pictures.
    Bulletin of Informatics and Cybernetics, 25(3-4):137-153, March 1993.

  46. Masayuki Takeda.
    An efficient multiple string replacing algorithm using pattern with pictures.
    Advances in Software Science and Technology 2:131-151, December 1990.


Editing

  1. Alberto Apostolico and Masayuki Takeda,
    Combinatorial Pattern Matching 2002,
    Lecture Notes in Computer Science 2373 , Springer-Verlag, July 2002.

  2. Vincent Corruble, Masayuki Takeda, and Einoshin Suzuki
    Discovery Science 2007,
    Lecture Notes in Artificial Intelligence 4755 , Springer-Verlag, September 2007.


Report

  1. Masayuki Takeda, Tomoko Fukuda, and Ichiro Nanri.
    Mining from Literary Texts: Pattern Discovery and Similarity Computation,
    Progress in Discovery Science (Final Report of the Japanese Discovery Science Project),
    LNAI 2281 , Springer-Verlag, March 2002.

  2. Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, and Shunsuke Inenaga.
    Finding Best Patterns Practically,
    Progress in Discovery Science (Final Report of the Japanese Discovery Science Project),
    Lecture Notes in Artificial Intelligence 2281 , Springer-Verlag, pp. 307-317, March 2002.


Conference Papers

  1. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda and Florin Manea.
    Factorizing a String into Squares in Linear Time.
    In Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 27:1--27:12, Tel Aviv, Israel, June 27-29, 2016.

  2. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Finding Gapped Palindromes Online.
    In Proceedings of the 27th International Workshop on Combinatorial Algorithms (IWOCA'16), 191--202, Helsinki, Finland, August 17-19, 2016.

  3. Yuta Fujishige, Yuki Tsujimaru, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets.
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), 38:1--38:14, August 22-26, 2016.

  4. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Shortest Unique Substring Queries on Run-Length Encoded Strings.
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), 69:1--69:11, August 22-26, 2016.

  5. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Fully Dynamic Data Structure for LCE Queries in Compressed Space.
    In Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS'16), 72:1--72:15, August 22-26, 2016.

  6. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Dynamic Index and LZ Factorization in Compressed Space.
    In Proceedings of the Prague Stringology Conference 2016 (PSC'16), 158--170, Prague, Czech Republic, August 29-31, 2016.

  7. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Computing Smallest and Largest Repetition Factorizations in O(n log n) Time.
    In Proceedings of the Prague Stringology Conference 2016 (PSC'16), 135--145, Prague, Czech Republic, August 29-31, 2016.

  8. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Semi-dynamic compact index for short patterns and succinct van Emde Boas tree.
    In Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM'15), 355-366, 2015.

  9. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding.
    In Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM'15), 219-230, 2015.

  10. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    An Opportunistic Text Indexing Structure Based on Run Length Encoding.
    In Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), 390-402, Paris, May 20-22, 2015.

  11. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta.
    A new characterization of maximal repetitions by Lyndon trees.
    In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)562-571, San Diego, January 4-6, 2015.

  12. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Inferring Strings from Lyndon Factorization.
    In Proc. 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), 565-576, Budapest, August 25-29, 2014.

  13. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda.
    Computing Abelian Covers and Abelian Runs.
    In Stringology 2014 43-51, 2014.
  14. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Computing palindromic factorizations and palindromic covers on-line.
    In Proc. 25th Ann. Symp. on Combinatorial Pattern Matching (CPM'14), 150-161, 2014.

  15. Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda.
    Faster compact on-line Lempel-Ziv factorization.
    In Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS'14), 675-686, 2014.

  16. Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Shortest unique substrings queries in optimal time.
    In Proc. 40th Intern. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM'14), 503-513, 2014.

  17. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Faster Lyndon factorization algorithms for SLP and LZ78 compressed text. In Proc. 20th edition of the Symp. on String Processing and Information Retrieval (SPIRE'13), 174-185, 2013.

  18. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Computing reversed Lempel-Ziv factorization online.
    In Proc. Prague Stringology Conference 2013 (PSC'13), 107-118, 2013.

  19. Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, and Ayumi Shinohara.
    Detecting regularities on grammar-compressed strings.
    In Proc. 38th Intern. Symp. on Mathemetical Foundations of Computer Science (MFCS'13), 571-582, 2013.

  20. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Compressed Automata for Dictionary Matching.
    In Proc. 18th International Conference on Implementation and Application of Automata (CIAA'13), 319-330, 2013.

  21. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Efficient Lyndon factorization of grammar compressed text.
    In Proc. the 24th Annual Symposium on Combinatorial Pattern Matching (CPM'13) , 153-164, 2013.

  22. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga and Masayuki Takeda.
    Converting SLP to LZ78 in almost linear time.
    In Proc. the 24th Annual Symposium on Combinatorial Pattern Matching (CPM'13) , 38-49, 2013.

  23. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Computing convolution on grammar-compressed text.
    Proc. Data Compression Conference 2013 (DCC'13), March 2013.

  24. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    From Run Length Encoding to LZ78 and Back Again.
    Proc. Data Compression Conference 2013 (DCC'13), March 2013.

  25. Kazuhito Hagio, Takashi Ohgami, Hideo Bannai and Masayuki Takeda.
    Eager XPath Evaluation over XML Streams.
    Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), pp.245-250, October 2012.

  26. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    The position heap of a trie.
    Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), pp.360-371, October 2012.

  27. Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Efficient LZ78 factorization of grammar compressed text.
    Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), pp.86-98, October 2012.

  28. Yoko Anan, Kohei Hatano, Hideo Bannai and Masayuki Takeda.
    Polyphonic music classification on symbolic data using dissimilarity functions.
    13th International Society for Music Information Retrieval Conference 2012 (ISMIR'12), pp.229-234, October 2012.

  29. Tomohiro I, Yuki Enokuma, Hideo Bannai and Masayuki Takeda.
    General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
    Proc. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD'12), pp.435-450, September 2012.

  30. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Speeding-up q-gram mining on grammar-based compressed texts.
    Proc. the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), pp. 220-231, July 2012.

  31. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Computing q-gram Non-overlapping Frequencies on SLP Compressed Texts.
    Proc. 38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'12), pp. 301-312, January 2012.

  32. Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, and Masayuki Takeda.
    Online Linear Optimization over Permutations.
    Proc. 22nd International Symposium on Algorithms and Computation (ISAAC'11), pp. 534-543, December 2011.

  33. Shota Yasutake, Kohei Hatano, Eiji Takimoto, and Masayuki Takeda.
    Online Rank Aggregation.
    Proc. NIPS 2011 Workshop on Computational Trade-offs in Statistical Learning , December 2011.

  34. Yoko Anan, Kohei Hatano, Hideo Bannai and Masayuki Takeda.
    Music Genre Classification using Similarity Functions.
    Proc. 12th International Society for Music Information Retrieval Conference 2011 (ISMIR'11), pp. 693-698, October 2011.

  35. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Fast q-gram Mining on SLP Compressed Strings.
    Proc. 18th edition of the Symposium on String Processing and Information Retrieval (SPIRE'11), pp. 278-289, October 2011.

  36. Kazuhito Hagio, Takashi Ohgami, Hideo Bannai and Masayuki Takeda.
    Efficient Eager XPath Filtering over XML Streams.
    In Proc. Prague Stringology Conference 2011 (PSC'11), pp. 30-44, August 2011. (PDF )

  37. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
    In Proc. Prague Stringology Conference 2011 (PSC'11), pp. 121-131, August 2011.

  38. Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Computing Longest Common Substring/Subsequence of Non-linear Texts.
    In Proc. Prague Stringology Conference 2011 (PSC'11), pp. 197-208, August 2011.

  39. Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Masayuki Takeda.
    Online Prediction over Permutahedron.
    Proc. 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), 2011.

  40. Shirou Maruyama, Masayuki Takeda, Masaya Nakahara and Hiroshi Sakamoto.
    An Online Algorithm for Lightweight Grammar-Based Compression.
    Proc. 1st International Conference on Data Compression, Communication and Processing (CCP'11), pp. 19-28, 2011.

  41. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda.
    Palindrome Pattern Matching.
    In Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11), pp. 232-245, 2011.

  42. Takanori Yamamoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda.
    Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts.
    In Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11), pp. 309-322, 2011.

  43. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Counting and Verifying Maximal Palindromes.
    Proc. 17th edition of the Symposium on String Processing and Information Retrieval (SPIRE'10), pp. 135-146, 2010.

  44. Kazuaki Kashihara, Kohei Hatano, Hideo Bannai, Masayuki Takeda.
    Sparse Substring Pattern Set Discovery Using Linear Programming Boosting.
    Proc. 13th International Conference on Discovery Science (DS'10), pp. 132-143, 2010.

  45. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Verifying a Parameterized Border Array in O(n^{1.5}) Time.
    Proc. the 21st Annual Symposium on Combinatorial Pattern Matching (CPM'10), pp. 238-250, 2010.

  46. Tatsuya Asai, Shin-ichiro Tago, Hiroya Inakoshi, Seishi Okamoto and Masayuki Takeda.
    Chimera: Stream-oriented XML Filtering/Querying Engine.
    Proc. Database Systems for Advanced Applications (DASFAA'10), April 2010.

  47. Tomohiro I, Satoshi Deguchi, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda.
    Lightweight Parameterized Suffix Array Construction.
    Proc. 20th International Workshop on Combinatorial Algorithms (IWOCA'09), pp. 312-323, June-July 2009.

  48. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda.
    Counting Parameterized Border Arrays for a Binary Alphabet.
    Proc. 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), pp. 422-433, April 2009 (LNCS 5457), 2009.

  49. Shirou Maruyama, Yohei Tanaka, Hiroshi Sakamoto, and Masayuki Takeda.
    Context-Sensitive Grammar Transform: Compression and Pattern Matching,
    Proc. 15th International Symposium on String Processing and Information Retrieval (SPIRE 2008), pp. 27-38, November 2008.

  50. Jun-ichi Moribe, Kohei Hatano, Eiji Takimoto, and Masayuki Takeda.
    Smooth Boosting for Margin-Based Ranking.
    Proc. the 19th International Conference on Algorithmic Learning Theory (ALT'08), pp. 227-239, October 2008.

  51. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda.
    String Kernels Based on Variable-Length-Don't-Care Patterns.
    Proc. the 11th International Conference on Discovery Science (DS'08), pp. 308-318, October 2008.

  52. Satoshi Deguchi, Fumihito Higashijima, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda.
    Parameterized Suffix Arrays for Binary Strings.
    In Proc. Prague Stringology Conference 2008 (PSC'08), pp. 84-94, September 2008.

  53. Tetsuya Matsumoto, Kazuhito Hagio, and Masayuki Takeda.
    A Run-Time Efficient Implementation of Compressed Pattern Matching Automata,
    Proc. 13th International Conference on Implementation and Application of Automata (CIAA 2008), pp. 201-211, July 2008.

  54. Kosuke Ishibashi, Kohei Hatano, and Masayuki Takeda.
    Online Learning of Maximum p-Norm Margin Classifiers with Bias,
    Proc. 21st Annual Conference on Learning Theory (COLT 2008), pp. 69-80, July 2008.

  55. Kosuke Ishibashi, Kohei Hatano, and Masayuki Takeda.
    Online Learning of Approximate Maximum Margin Classifiers with Biases,
    Proc. the 2nd International Workshop on Data Mining and Statistical Science (DMSS 2007), October 2007.

  56. Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, and Masayuki Takeda.
    Unsupervised Spam Detection Based on String Alienness Measures.
    Proc. the 10th International Conference on Discovery Science (DS'07), pp. 161-172, September 2007. (PDF )

  57. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays.
    Proc. the 18th Annual Symposium on Combinatorial Pattern Matching (CPM'07), pp. 340-351, July 2007. (PDF )

  58. Shuichi Mitarai, Akira Ishino, and Masayuki Takeda.
    Light-weight acceleration for streaming XML document filtering.
    Proc. the Third IEEE International Workshop on Databases for Next-Generation Researchers (SWOD'07), April 2007.(PDF )

  59. Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda.
    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution.
    Data Compression Conference'07 (DCC'07), pp. 123-132, IEEE Computer Society, March 2007.(PDF )

  60. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda.
    A New Family of String Classifiers based on Local Relatedness.
    In Proc. 9th International Conference on Discovery Science (DS'06), LNAI 4265, pp. 114-124, Springer-Verlag, October 2006.(PDF (c)Springer-Verlag)

  61. Shunsuke Inenaga and Masayuki Takeda.
    Sparse Directed Acyclic Word Graphs.
    In Proc. 13th International Symposium on String Processing and Information Retrieval (SPIRE'06), LNCS 4209, pp. 61-73, Springer-Verlag, October 2006.(PDF (c)Springer-Verlag)

  62. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, and Masayuki Takeda.
    Reachability on Suffix Tree Graphs.
    In Proc. Prague Stringology Conference 2006, pp. 212-225, Czech Technical University, August 2006.(PDF )

  63. Shunsuke Inenaga and Masayuki Takeda.
    Sparse Compact Directed Acyclic Word Graphs.
    In Proc. Prague Stringology Conference 2006, pp. 195-211, Czech Technical University, August 2006.(PDF )

  64. Shunsuke Inenaga and Masayuki Takeda.
    On-line Linear-time Construction of Word Suffix Trees.
    In Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM'06), LNCS 4009, pp. 60-71, Springer-Verlag, July 2006.(PDF (c)Springer-Verlag)

  65. Kazuyuki Narisawa, Yasuhiro Yamada, Daisuke Ikeda, and Masayuki Takeda.
    Detecting Blog Spams using the Vocabulary Size of All Substrings in Their Copies.
    Proceedings of the 3rd Annual Workshop on Weblogging Ecosystem, May 2006.

  66. Hisashi Tsuji, Akira Ishino, and Masayuki Takeda.
    A Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's.
    In Proc. of the 12th International Conference on String Processing and Information Retrieval (SPIRE 2005), Lecture Notes in Computer Science 3772, pp. 388-398, Novemver 2005. (PDF (c)Springer-Verlag)

  67. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda.
    Practical Algorithms for Pattern Based Linear Regression.
    In Proc. of the 8th International Conference on Discovery Science (DS 2005), Lecture Notes in Artificial Intelligence 3735, pp. 44-56, October 2005. (PDF (c)Springer-Verlag)

  68. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda.
    Fully Incremental LCS Computation.
    In Proc. of the 15th International Symposium on Fundamentals of Computation Theory (FCT2005), Lecture Notes in Computer Science 3623, pp. 563-574, August 2005. (PDF (c)Springer-Verlag)

  69. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda.
    An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
    In Proc. of the 8th International Conference on Developments in Language Theory (DLT2004), pp. 225-236, December 2004. (PDF (c)Springer-Verlag)

  70. Heikki Hyyro, Jun Takaba, Ayumi Shinohara, Masayuki Takeda.
    On Bit-Parallel Processing of Multi-byte Text.
    In Proc. The First Asia Information Retrieval Symposium (AIRS 2004), Lecture Notes in Computer Science 3411, pp. 289-300, October 2004.

  71. Shunsuke Inenaga, Hideo Bannai, Heikki Hyrro, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano.
    Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
    In Proc. The 7th International Conference on Discovery Science (DS 2004), Lecture Notes in Artificial Intelligence 3245, pp. 32-46, 2004. October 2004. (PDF (c)Springer-Verlag)

  72. Hideo Bannai, Heikki Hyyro, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano.
    Finding Optimal Pairs of Patterns.
    In Proc. the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004), LNBI 3240, pp. 450-462, September 2004.

  73. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda.
    A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems.
    In Proc. The Prague Stringology Conference'04 (PSC'04), Czech Technical University Press, pp. 98-113, September 2004.

  74. Toshiyuki Kochi, Akira Ishino, Masayuki Takeda, and Fumihiro Matsuo.
    An unsupervised approach to syntactic ambiguity resolution using statistical information.
    In Proc. International Symposium on Information Science and Electrical Engineering 2003, pp. 613-616, November 2003.

  75. Hisashi Tsuji, Akira Ishino, Masayuki Takeda, and Fumihiro Matsuo.
    On space economical implementation of suffix trees.
    In Proc. International Symposium on Information Science and Electrical Engineering 2003, pp. 203-206, November 2003.

  76. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, and Setsuo Arikawa.
    Discovering Most Classificatory Patterns for Very Expressive Pattern Classes,
    In Proc. The 6th International Conference on Discovery Science ( DS 2003), Lecture Notes in Computer Science 2843, pp. 486-493, October 2003. (PDF (c)Springer-Verlag)

  77. Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, and Fumihiro Matsuo.
    A Method of Extracting Related Words Using Standardized Mutual Information.
    In Proc. The 6th International Conference on Discovery Science (DS 2003), Lecture Notes in Computer Science 2843, pp. 478-485, October 2003.

  78. Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, and Ayumi Shinohara.
    Linear-time off-line text compression by longest-first substitution.
    In Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE 2003), Lecture Notes in Computer Science 2857, pp. 137-152, October 2003. (PDF (c)Springer-Verlag)

  79. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda.
    Inferring Strings from Graphs and Arrays.
    In Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS2003), Lecture Notes in Computer Science 2747, pp. 208-217, August 2003. (PDF (c)Springer-Verlag)

  80. Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, and Masayuki Takeda.
    On the length of the minimum solution of word equations in one variable.
    In Proc. 28th International Symposium on Mathematical Foundations of Computer Science (MFCS2003), Lecture Notes in Computer Science 2747, pp. 189-197, August 2003.

  81. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara.
    Ternary Directed Acyclic Word Graphs.
    In Proc. Eighth International Conference on Implementation and Application of Automata (CIAA2003), Lecture Notes in Computer Science 2759, pp. 120-130, Springer-Verlag, July 2003. (PDF (c)Springer-Verlag)

  82. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano.
    A string pattern regression algorithm and its application to pattern discovery in long introns.
    In Genome Informatics Vol. 13, pp.3-11, (GIW2002), Universal Academy Press, Inc., December 2002.

  83. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    Discovering best variable-length-don't-care patterns.
    In Proc. 5th International Conference on Discovery Science (DS2002),
    Lecture Notes in Computer Science 2534, pp.86-97, Springer-Verlag, November 2002. (PDF (c)Springer-Verlag)

  84. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa.
    A note on Randomized Algorithm for String Matching with Mismatches.
    In Proc. The Prague Stringology Conference '02 (PSC'02)
    pp. 9-17, Czech Technical University, September 2002. (pdf)

  85. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    Compact Directed Acyclic Word Graphs for a Sliding Window.
    In Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE2002),
    Lecture Notes in Computer Science 2476 , pp. 310-324, Springer-Verlag, September 2002. (PDF (c)Springer-Verlag)

  86. Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, and Setsuo Arikawa.
    Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-Byte Character Texts, and Semi-Structured Texts.
    In Proc. 9th International Symposium on String Processing and Information Retrieval (SPIRE2002),
    Lecture Notes in Computer Science 2476 , pp. 170-186, Springer-Verlag, September 2002. (PDF (c)Springer-Verlag)

  87. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, and Setsuo Arikawa.
    Space-Economical Construction of Index Structures for All-Suffixes of a String.
    In Proc. 27th. Inter. Symp. on Mathematical Foundation of Computer Science (MFCS2002),
    Lecture Notes in Computer Science 2420 , pp. 341-352, Springer-Verlag, August 2002. (PDF (c)Springer-Verlag)

  88. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, and Setsuo Arikawa.
    The Minimum DAWG for All Suffixes of a String and Its Applications,
    In Proc. 13th Ann. Symp. on Combinatorial Pattern Matching (CPM2002), Lecture Notes in Computer Science 2373 , pp. 151-165, Springer-Verlag, July 2002. (PDF (c)Springer-Verlag)

  89. Keisuke Iida, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano.
    Extension and Speed up of Knowledge Discovery System BONSAI,
    In Pacific Symposium on Biocomputing 2002, p. 100, January, 2002. (PDF)

  90. Hideo Bannai, Keisuke Iida, Ayumi Shinohara, Masayuki Takeda, and Satoru Miyano.
    More Speed and More Pattern Variations for Knowledge Discovery System BONSAI.
    In Genome Informatics Vol. 12 (GIW2001), pp. 454--455, Universal Academy Press, Inc., December, 2001. (PDF)

  91. Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, and Ayumi Shinohara.
    Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
    In Proc. 12th Annual International Symposium on Algorithms and Computation (ISAAC'01), Lecture Notes in Computer Science 2223, pp.719-730, Springer-Verlag, December 2001. (PDF (c)Springer-Verlag)

  92. Koichiro Yamamoto, Masayuki Takeda, Ayumi Shinohara, Tomoko Fukuda, and Ichiro Nanri.
    Discovering repetitive expressions and affinities from anthologies of classical Japanese poems.
    In Proc. 4th International Conference on Discovery Science (DS2001), Lecture Notes in Artificial Intelligence 2226, pp. 416-428, Springer-Verlag, November 2001. (PDF)

  93. Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    A practical algorithm to find the best episode patterns.
    In Proc. 4th International Conference on Discovery Science (DS2001), Lecture Notes in Artificial Intelligence 2226 , pp. 435-440, Springer-Verlag, November 2001. (PDF)

  94. Takashi Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, and Fumihiro Matsuo.
    Musical SequenceComparison for Melodic and Rhythmic Similarities,
    In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE2001), IEEE Computer Society, pp. 111-122, November 2001. (PDF)

  95. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,
    On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs,
    In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE2001), IEEE Computer Society, pp. 96-110, November 2001. (ps)

  96. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa,
    Construction of the CDAWG for a Trie,
    In Proc. Prague Stringology Club Workshop (PSCW 2001), Prague, Czech Republic, pp. 37-48, September 2001. (PDF)

  97. Masayuki Takeda.
    String resemblance system: A unifying framework for string similarity with applications to literature and music.
    In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001), Lecture Notes in Computer Science 2089 , pp. 147-151, Springer-Verlag, July 2001. (PDF (c)Springer-Verlag)

  98. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, and Giulio Pavesi.
    On-Line Construction of Compact Directed Acyclic Word Graphs,
    In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001), Lecture Notes in Computer Science 2089 , pp. 169-180, Springer-Verlag, July 2001. (PDF (c)Springer-Verlag)

  99. Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Multiple pattern matching algorithms on collage system,
    In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM2001), Lecture Notes in Computer Science 2089 , pp. 193-206, Springer-Verlag, July 2001. (PDF (c)Springer-Verlag)

  100. Gonzalo. Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Faster Approximate String Matching Over Compressed Text,
    In Proc. Data Compression Conference (DCC2001), IEEE Computer Society, pp. 459-468, March 2001.

  101. Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    Compressed Pattern Matching for SEQUITUR.
    In Proc. Data Compression Conference (DCC2001), IEEE Computer Society, pp. 469-478, March 2001.

  102. Ayumi Shinohara, Keisuke Iida, Masayuki Takeda, Osamu Maruyama, Satoru Miyano, and Satoru Kuhara.
    Finding Sparse Gene Networks",
    In Genome Informatics Vol. 11 (GIW2000), pp. 249--250 Universal Academy Press, Inc., December, 2000. (PDF)

  103. Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, and Ichiro Nanri.
    Discovering characteristic expressions from literary works: A new text analysis method beyond N-gram statistics and KWIC,
    In Proc. 3rd International Conference on Discovery Science (DS2000), Lecture Notes in Artificial Intelligence 1967 , pp. 112-126, Springer-Verlag, December 2000. (PDF (c)Springer-Verlag)

  104. Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    A practical algorithm to find best subsequence patterns.
    In Proc. 3rd International Conference on Discovery Science (DS2000), Lecture Notes in Artificial Intelligence 1967 , pp. 141-154, Springer-Verlag, December 2000. (PDF (c)Springer-Verlag)

  105. Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Bit-parallel approach to approximate string matching in compressed texts.
    In Proc. 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pp. 221-228, IEEE Computer Society, September 2000.

  106. Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa.
    Online construction of subsequence automata for multiple text,
    In Proc. 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pp. 146-152. IEEE Computer Society, September 2000.

  107. Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa
    Fully compressed pattern matching algorithm for balanced straight-line programs,
    In Proc. 7th International Symposium on String Processing and Information Retrieval (SPIRE2000), pp. 132-138. IEEE Computer Society, September 2000.

  108. Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    A Boyer-Moore type algorithm for compressed pattern matching,
    In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM2000), Lecture Notes in Computer Science 1848 , pp. 181-194, Springer-Verlag, June 2000. (PDF (c)Springer-Verlag)

  109. Yusuke Shibata, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Speeding up pattern matching by text compression.
    In Proc. 4th Italian Conference on Algorithms and Complexity (CIAC2000), Lecture Notes in Computer Science 1767 , pp. 306-316, Springer-Verlag, March 2000. (PDF (c)Springer-Verlag)

  110. Tomohiro Moriyama, Ayumi Shinohara, Masayuki Takeda, Osamu Maruyama, Takashi Goto, Satoru Miyano, and Satoru Kuhara,
    A System to Find Genetic Networks using Weigted Network Model,
    In Genome Informatics Vol. 10 (GIW1999) , pp. 186-195, Universal Academy Press, Inc., December 1999. (PDF)

  111. Koichi Tamari, Mayumi Yamasaki, Takuya Kida, Masayuki Takeda, Tomoko Fukuda, and Ichiro Nanri.
    Discovering poetic allusion in anthologies of classical Japanese poems.
    In Proc. 2nd International Conference on Discovery Science (DS'99), Lecture Notes in Artificial Intelligence 1721, pp. 128-138, Springer-Verlag, December 1999. (PDF (c)Springer-Verlag)

  112. Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    A unifying framework for compressed pattern matching.
    In Proc. 6th International Symposium on String Processing and Information Retrieval (SPIRE'99), pp. 89-96, IEEE Computer Society, September 1999.

  113. Takuya Kida, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Shift-And approach to pattern matching in LZW compressed text.
    In Proc. 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), Lecture Notes in Computer Science 1645 , pp. 1-13, Springer-Verlag, July 1999. (PDF (c)Springer-Verlag)

  114. Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa.
    Pattern matching in text compressed by using antidictionaries.
    In Proc. 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99), Lecture Notes in Computer Science 1645 , pp. 37-49, Springer-Verlag, July 1999. (PDF (c)Springer-Verlag)

  115. Kiyoshi Noda, Ayumi Shinohara, Masayuki Takeda, Satoshi Matsumoto, Satoru Miyano, Satoru Kuhara.
    Simulation Results on Finidng Genetic Networks using Weighted Network Model.
    In the 4th Hamamatsu International Symposium on Biology, p. 9, January 1999.

  116. Kiyoshi Noda, Ayumi Shinohara, Masayuki Takeda, Satoshi Matsumoto, Satoru Miyano, Satoru Kuhara.
    Simulation Results on Finidng Genetic Networks by Weighted Network Model.
    In Pacific Symposium on Biocomputing 1999, p. 84, January 1999.

  117. Kiyoshi Noda, Ayumi Shinohara, Masayuki Takeda, Satoshi Matsumoto, Satoru Miyano, and Satoru Kuhara.
    Finding Genetic Network from Experiments by Weigted Network Model.
    In Genome Informatics Vol. 9 (GIW1998), pp. 141-150, Universal Academy Press, Inc., December 1998. (PDF)

  118. Mayumi Yamasaki, Masayuki Takeda, Tomoko Fukuda, and Ichiro Nanri.
    Discovering characteristic patterns from collections of classical Japanese poems.
    In Proc. 1st International Conference on Discovery Science (DS'98), Lecture Notes in Artificial Intelligence 1532, pp. 129-140, Springer-Verlag, December 1998. (PDF (c)Springer-Verlag)

  119. Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara, and Masayuki Takeda,
    Uniform Characterizations of Polynomial-query Learnabilities,
    In Proc. the 1st international conference on Discovery Science (DS'98), Lecture Notes in Artificial Intelligence 1532, pp. 84-92, Springer-Verlag, December 1998. (PDF (c)Springer-Verlag)

  120. Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, and Setsuo Arikawa.
    Multiple pattern matching in LZW compressed text.
    In Proc. Data Compression Conference (DCC'98), pp. 103-111, IEEE Computer Society, March 1998.

  121. Masamichi Miyazaki, Ayumi Shinohara, and Masayuki Takeda.
    An improved pattern matching algorithm for strings in terms of straight-line programs.
    In Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM'97), Lecture Notes in Computer Science 1264, pp. 1-11, Springer-Verlag, June 1997.

  122. Makoto Nishimura, Yoshiki Himukashi, Makoto Shibata, Masayuki Takeda, and Fumihiro Matsuo.
    Determination of verb phrase in scientific and technical documents,
    In Proc. Natural Language Processing Pacific Rim Symposium (NLPRS'95), pp. 95-100, December 1995.

  123. Yoshiki Himukashi, Makoto Nishimura, Makoto Shibata, Masayuki Takeda, and Fumihiro Matsuo.
    Identification of noun phrase in scientific and techincal documents.
    In Proc. Natural Language Processing Pacific Rim Symposium (NLPRS'95), pp. 492-497, December 1995.

  124. Masayuki Takeda and Fumihiro Matsuo.
    An approach to understanding of scientific and technical documents.
    In Proc. 47th FID Conference and Congress of International Federation for Information and Documentation, pp. 249-253, October 1994.

  125. Masayuki Takeda, Noritaka Kusumoto, Junichiro Suda, and Fumihiro Matsuo.
    Determination of sentence structure for understanding of scientific and technical documents.
    In Proc. Natural Language Processing Pacific Rim Symposium (NLPRS'93), pp. 411-416, December 1993.

Letters

  1. 萩尾 一仁，御手洗 秀一，石野 明，竹田 正幸.
    漸増的なパストライ構築に基づく高速・軽量XML文書フィルタリング,
    DBSJ Letters 6(2):5-8, September 2007. (PDF)

  2. 御手洗 秀一，石野 明，竹田 正幸.
    パストライを用いた高速軽量なXML文書フィルタリンググ,
    DBSJ Letters 6(1):81-84, June 2007. (PDF)

  3. 石野 明, 竹田 正幸.
    パスプルーニングによる決定性有限オートマトンを用いたXQuery処理の提案,
    DBSJ Letters 4(4):17-20, 2006. (PDF)