Kyushu University Academic Staff Educational and Research Activities Database
List of Papers
Masayuki Takeda Last modified date:2018.08.21

Professor / Mathematical Informatics / Department of Informatics / Faculty of Information Science and Electrical Engineering


Papers
1. Akihiro Nishi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, O(n log n)-time Text Compression by LZ-style Longest First Substitution, Prague Stringology Conference 2018 (PSC'18), 2018.08.
2. Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Right-to-left Online Construction of Parameterized Position Heaps, Prague Stringology Conference 2018 (PSC'18), 2018.08.
3. Kotaro Aoyama, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Online Elastic Degenerate String Matching., the 29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), https://doi.org/10.4230/LIPIcs.CPM.2018.9, 9:1-9:10, 2018.07.
4. Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Longest substring palindrome after edit., the 29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), https://doi.org/10.4230/LIPIcs.CPM.2018.12, 12:1-12:14, 2018.07.
5. Takafumi Inoue, Shunsuke Inenaga, Heikki Hyyrö, Hideo Bannai, Masayuki Takeda, Computing longest common square subsequences., the 29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), https://doi.org/10.4230/LIPIcs.CPM.2018.15, 15:1-15:13, 2018.07.
6. Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Longest Lyndon Substring After Edit., the 29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), https://doi.org/10.4230/LIPIcs.CPM.2018.19, 19:1-19:10, 2018.07.
7. Isamu Furuya, Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Lyndon Factorization of Grammar Compressed Texts Revisited., the 29th Annual Symposium on Combinatorial Pattern Matching (CPM'18), https://doi.org/10.4230/LIPIcs.CPM.2018.24, 24:1-24:10, 2018.07.
8. Yuta Fujishige, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda,, Almost linear time computation of maximal repetitions in run length encoded strings, The 28th International Symposium on Algorithms and Computation (ISAAC 2017), 33:1−33:12, 2017.12.
9. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, and Kazuya Tsuruta, The "Runs" Theorem, SIAM Journal on Computing, 46, 5, 1501-1514, 2017.09.
10. Tenma Nakamura, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Order preserving pattern matching on trees and DAGs, the 24th International Symposium on String Processing and Information Retrieval (SPIRE 2017), 271-277, 2017.09.
11. Kazuyuki Narisawa, Hideharu Hiratsuka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Efficient Computation of Substring Equivalence Classes with Suffix Arrays., Algorithmica, https://doi.org/10.1007/s00453-016-0178-z, 79, 1, 291-318, 2017.09.
12. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Inferring strings from Lyndon factorization, Theoretical Computer Science, 689, 147-156, 2017.08.
13. Yuto Nakashima, Takuya Takagi, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, On Reverse Engineering the Lyndon Tree, Prague Stringology Conference 2017 (PSC 2017), 108-117, 2017.08.
14. Yuka Tanimura, Takaaki Nishimoto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda, Small-space LCE data structure with constant-time queries, the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), 10:1−10:15, 2017.08.
15. Keita Kuboi, Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Faster STR-IC-LCS computation via RLE, Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 20:1-20:12, 2017.07.
16. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Tight bounds on the maximum number of shortest unique substrings, Proc. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 24:1-24:11, 2017.07.
17. Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda, Shortest Unique Palindromic Substring Queries in Optimal Time, the 28th International Workshop on Combinatorial Algorithms (IWOCA 2017), 2017.07.
18. Yoshiaki Matsuoka, Takahiro Aoki, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Generalized pattern matching and periodicity under substring consistent equivalence relations, Theoretical Computer Science, 656(B):225-233, 2016.12.
19. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Theoretical Computer Science, 656(B):215-224, 2016.12.
20. Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Finding gapped palindromes online, Proc. the 27th International Workshop on Combinatorial Algorithms (IWOCA 2016), LNCS 9843, 191-202, 2016.08.
21. Takaaki Nishimoto , Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Fully dynamic data structure for LCE queries in compressed space, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 72:1-72:15, 2016.08.
22. Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest Unique Substring Queries on Run-Length Encoded Strings, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 69:1-69:11, 2016.08.
23. Yuta Fujishige, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets, Proc. the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), 38:1-38:14, 2016.08.
24. Takaaki Nishimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Dynamic index and LZ factorization in compressed space, Proc. Prague Stringology Conference 2016 (PSC 2016), 153-171, 2016.08.
25. Hiroe Inoue, Yoshiaki Matsuoka, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Smallest and Largest Repetition Factorizations in O(n log n) time, Proc. Prague Stringology Conference 2016 (PSC 2016), 135-145, 2016.08.
26. Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Florin Manea, Factorizing a string into squares in linear time, Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 27:1-27:12, 2016.06.
27. Yuka Tanimura, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda, Deterministic sub-linear space LCE data structures with efficient construction,, Proc. the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), pp. 1:1-1:10, 2016.06.
28. Makoto Nishida, Tomohiro I, Shunsuke Inenaga,, Hideo Bannai, Masayuki Takeda, Inferring Strings from Full Abelian Periods, Proceedings of the 26th International Symposium on Algorithms and Computation (ISAAC 2015), 10.1007/978-3-662-48971-0_64, 768-779, 2015.12.
29. Nakashima, Yuto, Tomohiro, I, Inenaga, Shunsuke, Bannai, Hideo, Masayuki Takeda, Constructing LZ78 tries and position heaps in linear time for large alphabets, INFORMATION PROCESSING LETTERS, 10.1016/j.ipl.2015.04.002, 115, 9, 655-659, 2015.09.
30. Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, A faster algorithm for computing maximal α-gapped repeats in a string, Proc. the 22nd Symposium on String Processing and Information Retrieval (SPIRE 2015), 10.1007/978-3-319-23826-5_13, Lecture Notes in Computer Science 9309, 124-136, 2015.09.
31. Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga,, Hideo Bannai, Masayuki Takeda, Computing Left-Right Maximal Generic Words, Proc. the Prague Stringology Conference 2015 (PSC 2015), 5-16, 2015.08.
32. Yoshiaki Matsuoka, Tomohiro I, Shunsuke Inenaga,, Hideo Bannai, Masayuki Takeda, Semi-dynamic compact index for short patterns and succinct van Emde Boas tree, Proceedings of the 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 10.1007/978-3-319-18173-8_29, 355-366, 2015.06.
33. Keisuke Goto, Hideo Bannai, Shunske Inenaga, Masayuki Takeda, LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding, Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM 2015), 10.1007/978-3-319-19929-0_19, Lecture Notes in Computer Science 9133, 219-230, 2015.06.
34. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Compressed automata for dictionary matching, THEORETICAL COMPUTER SCIENCE, 10.1016/j.tcs.2015.01.019, 578, 30-41, 2015.05.
35. Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, An opportunistic text indexing structure based on run length encoding, Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015), 10.1007/978-3-319-18173-8_29, 390-402, 2015.05.
36. 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.02.
37. Hideo Bannai, Tomohiro I, Shunsuke Inenaga, Yuto Nakashima, Masayuki Takeda, Kazuya Tsuruta, A new characterization of maximal repetitions by Lyndon trees, The 26th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA'15), 562-571, 2015.01.
38. Shohei Matsuda, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing Abelian Covers and Abelian Runs, The Prague Stringology Conference 2014 (PSC 2014), 43-51, 2014.09.
39. Yuto Nakashima, Takashi Okabe, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring Strings from Lyndon factorization, the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), 565-576, 2014.08.
40. Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing palindromic factorizations and palindromic covers on-line,, the 25th Annual Symposium on Combinatorial Pattern Matching (CPM 2014), 150-161, 2014.06.
41. Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Faster compact on-line Lempel-Ziv factorization.
, Proc. 31st Symposium on Theoretical Aspects of Computer Science (STACS'14), 675-686, 2014.03.
42. Kazuya Tsuruta, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Shortest unique substrings queries in optimal time.
, Proc. 40th Intern. Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM'14), 503-513, 2014.01.
43. Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Inferring strings from suffix trees and links on a binary alphabet, Discrete Applied Mathematics, 163, Part3, 316-325, 2014.01.
44. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Proc. 20th edition of the Symp. on String Processing and Information Retrieval (SPIRE'13), 174-185, 2013.10.
45. Shiho Sugimoto, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing reversed Lempel-Ziv factorization online.
, Proc. Prague Stringology Conference 2013 (PSC'13), 107-118, 2013.09.
46. Tomohiro I, Wataru Matsubara,, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara, Detecting regularities on grammar-compressed strings.
, In Proc. 38th Intern. Symp. on Mathemetical Foundations of Computer Science (MFCS'13), 571-582, 2013.08.
47. Tomohiro I, Takaaki Nishimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Compressed Automata for Dictionary Matching.
, Proc. 18th International Conference on Implementation and Application of Automata (CIAA'13), 319-330, 2013.07.
48. Tomohiro I, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Efficient Lyndon factorization of grammar compressed text.
, Proc. the 24rd Annual Symposium on Combinatorial Pattern Matching (CPM'13), 153-164, 2013.06.
49. Hideo Bannai, Pawel Gawrychowski, Shunsuke Inenaga, Masayuki Takeda, Converting SLP to LZ78 in almost linear time.
, Proc. the 24rd Annual Symposium on Combinatorial Pattern Matching (CPM'13), 38-49, 2013.06.
50. Tomohiro I, Shunsuke Inenaga, Masayuki Takeda, Palindrome pattern matching, Theoretical Computer Science, 483, 162-170, 2013.04.
51. Yuya Tamakoshi, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, From Run Length Encoding to LZ78 and Back Again, Proc. Data Compression Conference 2013 (DCC'13), 143-152, 2013.03.
52. Toshiya Tanaka, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Computing convolution on grammar-compressed text, Proc. Data Compression Conference 2013 (DCC 2013), 451-460, 2013.03.
53. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Fast q-gram mining on SLP compressed strings, Journal of Discrete Algorithms, 8, 89-99, 2013.01.
54. Shota Yasutake, Kohei Hatano, Eiji Takimoto, Masayuki Takeda, Online Rank Aggregation, Journal of Machine Learning Research - Proceedings , Track 25, 539-553, 2012.11.
55. Yoko Anan, Kohei Hatano, Hideo Bannai, Masayuki Takeda, Polyphonic music classification on symbolic data using dissimilarity functions, 13th International Society for Music Information Retrieval Conference 2012 (ISMIR'12), 229-234, 2012.10.
56. Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Efficient LZ78 factorization of grammar compressed text, Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), 86-98, 2012.10.
57. Yuto Nakashima, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, The position heap of a trie, Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), 360-371, 2012.10.
58. Masayuki Takeda, Kazuhito Hagio, Eager XPath Evaluation over XML Streams, Proc. 19th edition of the Symposium on String Processing and Information Retrieval (SPIRE'12), 245-250, 2012.10.
59. Tomohiro I, Yuki Enokuma, Hideo Bannai, 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), 435-450, 2012.09.
60. Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda, Speeding-up q-gram mining on grammar-based compressed texts, Proc. the 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), 220-231, 2012.07.
61. Shirou Maruyama, Hiroshi Sakamoto, Masayuki Takeda, An Online Algorithm for Lightweight Grammar-Based Compression, Algorithms, (Special issue on Data Compression, Communication and Processing). , 5, 2, 214-235, 2012.04.
62. 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, 2012.01.
63. Shota Yasutake, Kohei Hatano, Eiji Takimoto, and Masayuki Takeda, Online Rank Aggregation, Proc. NIPS 2011 Workshop on Computational Trade-offs in Statistical Learning , 2011.12.
64. 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, 2011.12.
65. 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, 2011.10.
66. 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, 2011.10.
67. Shin-ichi Yoshida, Kohei Hatano, Eiji Takimoto and Masayuki Takeda, Adaptive Online Prediction Using Weighted Windows, IEICE Trans. on Information and Systems (Special issue on Information-Based Induction Sciences and Machine Learning). , E94-D, 10, 1917-1923, 2011.10.
68. Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. , Computing Longest Common Substring/Subsequence of Non-linear Texts.

, Prague Stringology Conference 2011 (PSC'11), 2011.08.
69. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda. , Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
, Prague Stringology Conference 2011 (PSC'11) , 2011.08.
70. Kazuhito Hagio, Takashi Ohgami, Hideo Bannai and Masayuki Takeda. , Efficient Eager XPath Filtering over XML Streams.
, Prague Stringology Conference 2011 (PSC'11) , 2011.08.
71. Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Masayuki Takeda, Online Prediction over Permutahedron, 14th Korea-Japan Joint Workshop on Algorithms and Computation (WAAC 2011), 2011.07.
72. Tomohiro I, Shunsuke Inenaga and Masayuki Takeda, Palindrome Pattern Matching

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

, Proc. the 22nd Annual Symposium on Combinatorial Pattern Matching (CPM'11) , 2011.06.
74. Tomohiro I, Shunsuke Inenaga, Hideo Bannai and Masayuki Takeda., Counting and Verifying Maximal Palindromes, Proc. 17th International Symposium on String Processing and Information Retrieval (SPIRE 2010), pp. 135-146, 2010.11.
75. 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) , 2010.06.
76. S. Maruyama, Y. Tanaka, H. Sakamoto, and M. Takeda. , Context-Sensitive Grammar Transform: Compression and Pattern Matching.
, IEICE Trans. on Information and Systems , 93-D, 2, 219-226, 2010.06.
77. 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. , 2010.04.
78. 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.
, 2009.04.
79. 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. , 2009.04.
80. 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, 2009.04.
81. 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), November 2008, 2008.11.
82. 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), October 2008, 2008.10.
83. 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), , July 2008, 2008.07.
84. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. , Reachability on Suffix Tree Graphs, Int. J. Found. Comput. Sci.19(1):147-162, 2008. , 147-162,, 2008.02.
85. 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, 2007.10.
86. 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., October 2007., 2007.10.
87. 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), To appear, 2007.07.
88. 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), , CD, 2007.04.
89. 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, 2007.03.
90. Shunsuke Inenaga and Masayuki Takeda., Sparse Directed Acyclic Word Graphs.
, Proc. 13th International Symposium on String Processing and Information Retrieval (SPIRE'06), , LNCS 4209, pp. 61-73, Springer-Verlag,, 2006.10.
91. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda., A New Family of String Classifiers based on Local Relatedness.
, Proc. 9th International Conference on Discovery Science (DS'06), LNAI 4265, pp. 114-124, Springer-Verlag,, 2006.10.
92. 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, 2006.08.
93. Shunsuke Inenaga and Masayuki Takeda, On-line Linear-time Construction of Word Suffix Trees., Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM'06), LNCS 4009, pp. 60-71, Springer-Verlag, 2006.07.
94. 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,, CD, 2006.05.
95. 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), 3772, 388-398, Lecture Notes in Computer Science 3772, pp. 388-398, 2005.11.
96. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, and Masayuki Takeda, Practical Algorithms for Pattern Based Linear Regression., Proc. of the 8th International Conference on Discovery Science (DS 2005), 3735, 44-56, Lecture Notes in Artificial Intelligence 3735, pp. 44-56, 2005.10.
97. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, Fully Incremental LCS Computation., Proc. of the 15th International Symposium on Fundamentals of Computation Theory (FCT2005),, 3623, 563-574, Lecture Notes in Computer Science 3623, pp. 563-574,, 2005.08.
98. Hisashi Tsuji, Akira Ishino, Masayuki Takeda., A Bit-parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's., Proc. 12th International Symposium on String Processing and Information Retrieval (SPIRE 2005), 3772, 388-398, Vol.3772 of Lecture Notes in Computer Science, pp.388--398,, 2005.01.
99. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda., Fully Compressed Pattern Matching Algorithm for Simple Collage Systems., International Journal of Fundations of Computer Science, 10.1142/S0129054105003728, 16, 6, 1155-1166, Vol.16, No.6, pp.1155--1166
(special issue for Prague Stringology Conference), 2005.01.
100. 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,, 10.1016/dam.2004.04.012, 146, 2, 156-179, 146(2):156-179, (special issue for CPM'01)., 2005.01.
101. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars., Proc. of the 8th International Conference on Developments in Language Theory (DLT2004), 3340, 225-236, pp. 225-236, 2004.12.
102. Heikki Hyyro, Jun Takaba, Ayumi Shinohara, Masayuki Takeda, On Bit-Parallel Processing of Multi-byte Text., Proc. The First Asia Information Retrieval Symposium (AIRS 2004),, 3411, 289-300, Lecture Notes in Computer Science 3411, pp. 289-300,, 2004.10.
103. 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, Proc. The 7th International Conference on Discovery Science (DS 2004),, 3245, 32-46, Lecture Notes in Artificial Intelligence 3245, pp. 32-46,, 2004.10.
104. Hideo Bannai, Heikki Hyyro, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, and Satoru Miyano., Finding Optimal Pairs of Patterns, Proc. the 4th International Workshop on Algorithms in Bioinformatics (WABI 2004),, 3240, 450-462, LNBI 3240, pp. 450-462,, 2004.09.
105. Shunsuke Inenaga, Ayumi Shinohara, and Masayuki Takeda, A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems., Proc. The Prague Stringology Conference'04 (PSC'04),, 10.1142/S0129054105003728, 16, 6, 1155-1166, Czech Technical University Press, pp. 98-113,, 2004.09.
106. 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, (special issue for SPIRE'02)., 2004.03.
107. 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, 10.1109/TCBB.2004.36, 1, 4, 159-170, 1(4):159-170, (special section on the Workshop on Algorithms in Bioinformatics),, 2004.01.
108. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, and Ayumi Shinohara, Ternary Directed Acyclic Word Graphs, Theoretical Computer Science, 10.1016/j.tcs.2004.07.008, 328, 1-2, 97-111, 328(1-2):97-111, (special issue for CIAA'03)., 2004.01.
109. 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.01.
110. Tomohiko Sugimachi, Akira Ishino, Masayuki Takeda, Fumihiro Matsuo, A Method of Extracting Related Words Using Standardized Mutual Information, Proc. The 6th International Conference on Discovery Science (DS 2003), 2843, 478-485, Lecture Notes in Computer Science 2857, pp. 478-485, Springer-Verlag, 2003.10.
111. Hisashi Tsuji, Akira Ishino, Masayuki Takeda, and Fumihiro Matsuo., On space economical implementation of suffix trees., Proc. International Symposium on Information Science and Electrical Engineering 2003, pp.203--206, 2003.01.
112. Toshiyuki Kochi, Akira Ishino, Masayuki Takeda, and Fumihiro Matsuo., An unsupervised approach to syntactic ambiguity resolution using statistical information., Proc. International Symposium on Information Science and Electrical Engineering 2003, pp.613--616, 2003.01.
113. 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, 10.1016/S0304-3975(02)00184-6, 292, 2, 497-524, 292(2):497-524, 2003.01.
114. Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, and Ichiro Nanri, Discovering characteristic expressions from literary works, Theoretical Computer Science, 10.1016/S0304-3975(02)00185-8, 292, 2, 525-546, 292(2):525-546, 2003.01.
115. Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara and Masayuki Takeda, Uniform characterization of polynomial-query learnabilities, Theoretical Computer Science, 10.1016/S0304-3975(02)00177-9, 292, 2, 377-385, 292(2):377-385, 2003.01.
116. Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, and Setsuo Arikawa, A practical algorithm to find the best subsequences patterns, Theoretical Computer Science, 10.1016/S0304-3975(02)00182-2, 292, 2, 465-479, 292(2):465-479, 2003.01.
117. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, and Setsuo Arikawa, A note on Randomized Algorithm for String Matching with Mismatches, Proc. The Prague Stringology Conference '02 (PSC'02), pp. 9-17, Czech Technical University, 2002.09.