最新ニュース

関連論文

154 件
2026 (2 件)
  1. Finding Order-Preserving Subgraphs.
    Haruya Imamura, Yasuaki Kobayashi, Yota Otachi, Toshiki Saitoh, Keita Sato, Asahi Takaoka, Ryo Yoshinaka, Tom C. van der Zanden
    WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings, pp.157-171 (2026) , [peer-reviewed]
    Event Date: March 4-6, 2026
  2. Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries.
    Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
    The 51st International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM2026), Lecture Notes in Computer Science, Vol.16448, pp.16-30 (2026) , [peer-reviewed]
    Event Date: February 9-13, 2026 @ Jagiellonian University, Krakow, Poland
2025 (2 件)
  1. Subsequence Matching and LCS with Segment Number Constraints.
    Yuki Yonemoto, Takuya Mieno, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
    The 14th International Conference on Algorithms and Complexity (CIAC 2025), Lecture Notes in Computer Science, Vol.15680, pp.136-150 (2025) , [peer-reviewed]
    Event Date: June 10-12, 2025 @ Rome, Italy
  2. Pattern Matching on Run-Length Grammar-Compressed Strings in Linear Time.
    Yuto Iguchi, Ryo Yoshinaka, Ayumi Shinohara
    36th Annual Symposium on Combinatorial Pattern Matching, LIPIcs, Vol.331, pp.9:1-9:16 (2025) , [peer-reviewed]
    Event Date: June 17-19, 2025 @ Università degli studi di Milano, Milano, Italy
2024 (5 件)
  1. Serial and parallel algorithms for order-preserving pattern matching based on the duel-and-sweep paradigm.
    Davaajav Jargalsaikhan, Diptarama Hendrian, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara
    Acta Informatica, Vol.61, pp.415-444 (2024) , [peer-reviewed]
  2. Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
    Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
    ICALP2024, LIPIcs, Vol.297, pp.89:1-89:19 (2024) , [peer-reviewed]
    Event Date: July 8-12, 2024
  3. Linear time online algorithms for constructing linear-size suffix trie.
    Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga, Keisuke Goto, Mitsuru Funakoshi
    Theoretical Computer Science, Vol.1015, pp.114765 (2024) , [peer-reviewed]
  4. Algorithms for Galois Words: Detection, Factorization, and Rotation
    Diptarama Hendrian,, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
    The 35th Annual Symposium on Combinatorial Pattern Matching, LIPIcs, Vol.296, pp.18:1-18:16 (2024)
    Event Date: June 24-26, 2024 @ Fukuoka, Japan
  5. Query Learning of Minimal Deterministic Symbolic Finite Automata Separating Regular Languages
    Yoshito Kawasaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 50th International Conference on Current Trends in Theory and Practice of Computer Science, Lecture Notes in Computer Science, Vol.15519, pp.340-354 (2024) , [peer-reviewed]
2023 (4 件)
  1. Efficient Parameterized Pattern Matching in Sublinear Space.
    Haruki Ideguchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings, pp.271-283 (2023) , [peer-reviewed]
    Event Date: September 26-28, 2023 @ University of Pisa, Italy
  2. Identification of Substitutable Context-Free Languages over Infinite Alphabets from Positive Data
    Yutaro Numaya, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    International Conference on Grammatical Inference, Proceedings of Machine Learning Research , Vol.217, pp.23-34 (2023) , [peer-reviewed]
    Event Date: July 10-13, 2023 @ Rabato, Morocco
  3. Inferring Strings from Position Heaps in Linear Time.
    Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 17th International Conference and Workshops (WALCOM 2023), Lecture Notes in Computer Science, Vol.13973, pp.115-126 (2023) , [peer-reviewed]
    Event Date: March 22-24, 2023 @ Hsinchu, Taiwan
  4. ネックレス文字列上の極小単出現と極大反復出現の計算
    森竹 涼樹, 熊谷 滉士郎, ディプタラマ ヘンリアン, 吉仲 亮, 篠原 歩
    冬のLAシンポジウム, (2023)
    開催日: 2023年1月30日-2月1日 @ 京都大学数理解析研究所，京都
2022 (5 件)
  1. Computing the Parameterized Burrows-Wheeler Transform Online
    Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
    The 29th International Symposium on String Processing and Information Retrieval (SPIRE2022), Lecture Notes in Computer Science, Vol.13617, pp.70-85 (2022) , [peer-reviewed]
    Event Date: November 7-9, 2022 @ Concepción, Chile
  2. Parameterized DAWGs: Efficient constructions and bidirectional pattern searches.
    Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    Theoretical Computer Science, Vol.933, pp.21-42 (2022) , [peer-reviewed]
  3. Parallel Algorithm for Pattern Matching Problems Under Substring Consistent Equivalence Relations
    Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 33rd Annual Symposium on Combinatorial Pattern Matching (CPM2022), LIPIcs , Vol.223, pp.28:1-28:21 (2022) , [peer-reviewed]
    Event Date: June 26-28, 2022 @ Prague, Czech Republic
  4. Parallel algorithm for pattern matching under substring consistent equivalence relations
    ジャルガルサイハン ダワージャブ, ディプタラマ ヘンリアン, 吉仲 亮, 篠原 歩
    冬のLAシンポジウム, (2022)
    開催日: 2022年2月1-3日 @ オンライン
  5. パラメタ化コンパクト接尾辞グラフのオンライン構築手法
    市川慎太朗, ディプタラマ ヘンリアン, 吉仲 亮, 篠原 歩
    冬のLAシンポジウム, (2022)
    開催日: 2022年2月1-3日 @ オンライン
2021 (2 件)
  1. Query Learning Algorithm for Symbolic Weighted Finite Automata
    Kaito Suzuki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 15th International Conference on Grammatical Inference, Proceedings of Machine Learning Research, Vol.153, pp.202-216 (2021) , [peer-reviewed]
    Event Date: August 23-27, 2021 @ virtual
  2. A Hierarchy of Context-Free Languages Learnable from Positive Data and Membership Queries.
    Makoto Kanazawa, Ryo Yoshinaka
    The 15th International Conference on Grammatical Inference, Proceedings of Machine Learning Research, Vol.153, pp.18-31 (2021) , [peer-reviewed]
    Event Date: August 23-27, 2021 @ virtual
2020 (14 件)
  1. 覆面算を列挙するオートマトンの効率的な構築手法
    渡部 航也, ヘンリアン ディプタラマ, 吉仲 亮, 堀山貴史, 篠原 歩
    コンピュテーション研究会 (COMP研), 信学技報, Vol.120, pp.16-23 (2020)
    開催日: 2020年12月4-4日 @ オンライン
  2. Computing Covers Under Substring Consistent Equivalence Relations.
    Natsumi Kikuchi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 27th International Symposium on String Processing and Information Retrieval (SPIRE2020), Lecture Notes in Computer Science, Vol.12303, pp.131-146 (2020) , [peer-reviewed]
    Event Date: October 13-15, 2020 @ online
  3. Detecting $k$-(Sub-)Cadences and Equidistant Subsequence Occurrences.
    Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Ayumi Shinohara
    The 31st Annual Symposium on Combinatorial Pattern Matching (CPM2020), LIPIcs, Vol.161, pp.12:1-12:11 (2020) , [peer-reviewed]
    Event Date: June 17-19, 2020 @ online
  4. In-Place Bijective Burrows-Wheeler Transforms
    Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
    The 31st Annual Symposium on Combinatorial Pattern Matching (CPM2020), LIPIcs, Vol.161, pp.21:1-21:15 (2020) , [peer-reviewed]
    Event Date: June 17-19, 2020 @ online
  5. DAWGs for Parameterized Matching: Online Construction and Related Indexing Structures.
    Katsuhito Nakashima, Noriki Fujisato, Diptarama Hendrian, Yuto Nakashima, Ryo Yoshinaka, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda
    The 31st Annual Symposium on Combinatorial Pattern Matching (CPM2020), LIPIcs, Vol.161, pp.26:1-26:14 (2020) , [peer-reviewed]
    Event Date: June 17-19, 2020 @ online
  6. Fast and Linear-Time String Matching Algorithms Based on the Distances of $q$-Gram Occurrences.
    Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 18th International Symposium on Experimental Algorithms (SEA 2020), LIPIcs, Vol.160, pp.13:1-13:13 (2020) , [peer-reviewed]
    Event Date: June 16-18, 2020 @ online
  7. Efficient computation of longest single-arm-gapped palindromes in a string
    Shintaro Narisada, Diptarama Hendrian, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
    Theoretical Computer Science, Vol.812, pp.160-173 (2020) , [peer-reviewed]
  8. Linear-time online algorithm for inferring the shortest path graph from a walk label.
    Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    Theoretical Computer Science, Vol.812, pp.187-202 (2020) , [peer-reviewed]
  9. Grammar Compression with Probabilistic Context-Free Grammar
    Hiroaki Naganuma, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara, Naoki Kobayashi
    Data Compression Conference (DCC2020), pp.386 (2020) , [peer-reviewed]
    Event Date: March 24-27, 2020 @ online
  10. パラメタ化パターン照合のための索引グラフ構造
    中島 克仁, 藤里 法輝, ディプタラマ ヘンリアン, 中島 祐人, 吉仲 亮, 稲永 俊介, 坂内 英夫, 篠原 歩, 竹田 正幸
    冬のLAシンポジウム (冬のLA), (2020)
    開催日: 2020年2月5-7日 @ 京都大学数理解析研究所，京都
  11. 文字列の被覆配列を求める問題の一般化とその解法
    菊池 なつみ, ディプタラマ ヘンリアン, 吉仲 亮, 篠原 歩
    冬のLAシンポジウム (冬のLA), (2020)
    開催日: 2020年2月5-7日 @ 京都大学数理解析研究所，京都
  12. Parallel duel-and-sweep algorithm for the order-preserving pattern matching
    Davaajav Jargalsaikhan, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS, Vol.12011, pp.211-222 (2020) , [peer-reviewed]
    Event Date: January 20-23, 2020 @ Limassol, Cyprus
  13. Fully-Online Suffix Tree and Directed Acyclic Word Graph Construction for Multiple Texts.
    Takuya Takagi, Shunsuke Inenaga, Hiroki Arimura, Dany Breslauer, Diptarama Hendrian
    Algorithmica, Vol.82, pp.1346-1377 (2020) , [peer-reviewed]
  14. An Extension of Linear-size Suffix Tries for Parameterized Strings.
    Katsuhito Nakashima, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), Limassol, Cyprus, January 20-24, 2020., CEUR Workshop Proceedings, Vol.2568, pp.97-108 (2020) , [peer-reviewed]
    Event Date: January 20-24, 2020
2019 (8 件)
  1. 同一qグラムの出現位置間の距離を考慮した厳密文字列照合アルゴリズム
    小林 賢, ヘンリアン ディプタラマ, 吉仲 亮, 篠原 歩
    コンピュテーション研究会 (COMP研), (2019)
    開催日: 2019年12月13日 @ 群馬大学 伊香保研修所
  2. 密度固定のネックレス文字列に関する考察 Ａ
    菊池 なつみ, Hendrian Diptarama, 吉仲 亮, 篠原 歩
    2019年度電気関係学会東北支部連合大会 (TSJC 2019), (2019)
    開催日: 2019年8月22日 @ 秋田大学 手形キャンパス，秋田市
  3. An Improvement of the Franek-Jennings-Smyth Pattern Matching Algorithm.
    Satoshi Kobayashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
    Prague Stringology Conference 2019, Prague, Czech Republic, August 26-28, 2019., pp.56-68 (2019) , [peer-reviewed]
    Event Date: August 26-28, 2019
  4. パラメタ化文字列に対する線形サイズ接尾辞トライ
    中島 克仁, ヘンリアン ディプタラマ, 吉仲 亮, 篠原 歩
    第173回アルゴリズム研究会 (IPSJ-SIGAL-173), (2019)
    開催日: 2019年5月10日 @ 熊本大学
  5. Permuted Pattern Matching Algorithms on Multi-Track Strings.
    Diptarama Hendrian, Yohei Ueki, Kazuyuki Narisawa, Ryo Yoshinaka, Ayumi Shinohara
    Algorithms, Vol.12, pp.73 (2019) , [peer-reviewed]
  6. Query Learning Algorithm for Residual Symbolic Finite Automata.
    Kaizaburo Chubachi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    GandALF, EPTCS, Vol.305, pp.140-153 (2019) , [peer-reviewed]
  7. Distributional learning of conjunctive grammars and contextual binary feature grammars.
    Ryo Yoshinaka
    J. Comput. Syst. Sci., Vol.104, pp.359-374 (2019) , [peer-reviewed]
  8. Efficient dynamic dictionary matching with DAWGs and AC-automata.
    Diptarama Hendrian, Shunsuke Inenaga, Ryo Yoshinaka, Ayumi Shinohara
    Theor. Comput. Sci., Vol.792, pp.161-172 (2019) , [peer-reviewed]
2018 (4 件)
  1. Linear-Time Online Algorithm Inferring the Shortest Path from a Walk
    Shintaro Narisada, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    The 25th International Symposium on String Processing and Information Retrieval (SPIRE2018), LNCS, Vol.11147, pp.311-324 (2018) , [peer-reviewed]
    Event Date: October 9-11, 2018 @ Lima, Peru
  2. Enumeration of Cryptarithms Using Deterministic Finite Automata.
    Yuki Nozaki, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara
    Implementation and Application of Automata - 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018, Proceedings, Lecture Notes in Computer Science, Vol.10977, pp.286-298 (2018) , [peer-reviewed]
    Event Date: August 2-2, 2018
  3. New Variants of Pattern Matching with Constants and Variables.
    Yuki Igarashi, Diptarama, Ryo Yoshinaka, Ayumi Shinohara
    SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings, Lecture Notes in Computer Science, Vol.10706, pp.611-623 (2018) , [peer-reviewed]
    Event Date: February 2-2, 2018
  4. Duel and Sweep Algorithm for Order-Preserving Pattern Matching.
    Davaajav Jargalsaikhan, Diptarama, Yohei Ueki, Ryo Yoshinaka, Ayumi Shinohara
    SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings, Lecture Notes in Computer Science, Vol.10706, pp.624-635 (2018) , [peer-reviewed]
    Event Date: February 2-2, 2018
2017 (4 件)
  1. 決定性有限オートマトンを用いた覆面算の数え上げ
    野崎 裕樹, 吉仲 亮, 篠原 歩
    第22回ゲームプログラミングワークショップ, 第22回ゲームプログラミングワークショップ2017論文集, pp.236-243 (2017)
    開催日: 2017年11月10-12日 @ 箱根セミナーハウス，箱根町，神奈川
  2. Position Heaps for Parameterized Strings.
    Diptarama, Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara
    28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, Warsaw, Poland, July 4-6, 2017, LIPIcs, Vol.78, pp.8:1-8:13 (2017) , [peer-reviewed]
    Event Date: July 4-6, 2017
  3. The Strong, Weak, and Very Weak Finite Context and Kernel Properties.
    Makoto Kanazawa, Ryo Yoshinaka
    Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings, pp.77-88 (2017) , [peer-reviewed]
    Event Date: March 6-9, 2017
  4. Computing Longest Single-arm-gapped Palindromes in a String.
    Shintaro Narisada, Diptarama, Kazuyuki Narisawa, Shunsuke Inenaga, Ayumi Shinohara
    SOFSEM 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings, pp.375-386 (2017) , [peer-reviewed]
    Event Date: January 16-20, 2017
2016 (5 件)
  1. AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching.
    Diptarama, Ryo Yoshinaka, Ayumi Shinohara
    String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings, Lecture Notes in Computer Science, Vol.9954, pp.110-121 (2016) , [peer-reviewed]
    Event Date: October 18-20, 2016
  2. Fast Full Permuted Pattern Matching Algorithms on Multi-track Strings.
    Diptarama, Ryo Yoshinaka, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2016, Prague, Czech Republic, August 29-31, 2016, pp.7-21 (2016) , [peer-reviewed]
    Event Date: August 29-31, 2016
  3. Generalization of Efficient Implementation of Compression by Substring Enumeration.
    Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara
    2016 Data Compression Conference, DCC 2016, Snowbird, UT, USA, March 30 - April 1, 2016, pp.630 (2016) , [peer-reviewed]
    Event Date: April 1-1, 2016
  4. Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations.
    Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
    Discret. Appl. Math., Vol.212, pp.61-80 (2016) , [peer-reviewed]
  5. KMP Based Pattern Matching Algorithms for Multi-Track Strings.
    Diptarama, Yohei Ueki, Kazuyuki Narisawa, Ayumi Shinohara
    Proceedings of Student Research Forum Papers and Posters at SOFSEM 2016 co-located with 42nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2016), Harrachov, Czech Republic, January 23-28, 2016., CEUR Workshop Proceedings, Vol.1548, pp.100-107 (2016) , [peer-reviewed]
    Event Date: January 23-28, 2016
2015 (5 件)
  1. 部分文字列数え上げ圧縮法の効率的な実現の一般化～多値化とフェーズの導入～
    佐久間俊平, 成澤和志, 篠原歩
    電子情報通信学会コンピュテーション研究会，COMP, 信学技報, Vol.115, pp.13-20 (2015)
    開催日: 2015年9月1日 @ 信州大学
  2. Learning Conjunctive Grammars and Contextual Binary Feature Grammars.
    Ryo Yoshinaka
    Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, Lecture Notes in Computer Science, Vol.8977, pp.623-635 (2015) , [peer-reviewed]
    Event Date: March 2-6, 2015
  3. 接尾辞係数表現による順序保存符号nグラム出現頻度の効率的な計算
    佐藤雄介, 成澤和志, 篠原歩
    冬のLAシンポジウム, (2015)
    開催日: 2015年1月30-30日 @ 京都大学数理解析研究所
  4. Position Heaps for Permuted Pattern Matching on Multi-Track String.
    Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara
    SOFSEM2015, Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, pp.41-53 (2015) , [peer-reviewed]
    Event Date: January 24-29, 2015 @ Pec pod Sněžkou, Czech Republic
  5. Detecting regularities on grammar-compressed strings.
    Tomohiro I, Wataru Matsubara, Kouji Shimohira, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Kazuyuki Narisawa, Ayumi Shinohara
    Inf. Comput., Vol.240, pp.74-89 (2015) , [peer-reviewed]
2014 (4 件)
  1. マルチトラック文字列上の順列パターン照合のための省メモリな索引構造
    桂敬史, 大友雄平, 成澤和志, 篠原歩
    電子情報通信学会コンピュテーション研究会，COMP, (2014)
    開催日: 2014年9月2-2日 @ 豊橋技術科学大学
  2. Efficient Algorithm and Coding for Higher-Order Compression.
    Kazuya Yaguchi, Naoki Kobayashi, Ayumi Shinohara
    Data Compression Conference, DCC 2014, Snowbird, UT, USA, 26-28 March, 2014, pp.434 (2014) , [peer-reviewed]
    Event Date: March 26-28, 2014
  3. A comparison of collapsed Bayesian methods for probabilistic finite automata.
    Chihiro Shibata, Ryo Yoshinaka
    Mach. Learn., Vol.96, pp.155-188 (2014) , [peer-reviewed]
  4. Bounded Occurrence Edit Distance: A New Metric for String Similarity Joins with Edit Distance Constraints.
    Tomoki Komatsu, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara
    SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, pp.363-374 (2014) , [peer-reviewed]
    Event Date: January 26-29, 2014
2013 (6 件)
  1. 接頭辞集合に対する決定性有限オートマトンの最小無矛盾問題について
    上埜かおり, 下薗真一, 成澤和志, 篠原歩
    電子情報通信学会コンピュテーション研究会，COMP2013-57, pp.115--122, (2013)
    開催日: 2013年12月21-21日 @ 沖縄産業支援センター
  2. On Morphisms Generating Run-Rich Strings.
    Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, September 2-4, 2013, pp.35-47 (2013) , [peer-reviewed]
    Event Date: September 2-4, 2013
  3. オンライン文字列辞典の試作
    大井雄介, 成澤和志, 篠原歩
    夏のLAシンポジウム, (2013)
    開催日: 2013年7月17-17日 @ 休暇村 志賀島
  4. 文字列に含まれる連の最大指数和の解析～n=57までの厳密値と新たな下界2.03696の発見
    草野一彦, 奥田遼介, 成澤和志, 篠原歩
    電子情報通信学会コンピュテーション研究会，COMP, (2013)
    開催日: 2013年4月24-24日 @ 神戸大学
  5. マルチトラックデータ上の近似順列パターン照合と索引構造
    大田裕之, 桂敬史, 成澤和志, 篠原歩
    電子情報通信学会コンピュテーション研究会，COMP, (2013)
    開催日: 2013年4月24-24日 @ 神戸大学
  6. Permuted Pattern Matching on Multi-track Strings.
    Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara, Hideo Bannai, Shunsuke Inenaga
    SOFSEM 2013: Theory and Practice of Computer Science, 39th International Conference on Current Trends in Theory and Practice of Computer Science, Špindlerův Mlýn, Czech Republic, January 26-31, 2013. Proceedings, Lecture Notes in Computer Science, Vol.7741, pp.280-291 (2013) , [peer-reviewed]
    Event Date: January 26-31, 2013
2012 (5 件)
  1. 圧縮文字列に対する省メモリなパターンマッチアルゴリズム
    相原高雄, 篠原歩, 成澤和志
    電子情報通信学会コンピュテーション研究会，COMP, (2012)
    開催日: 2012年10月31-31日 @ 東北大学
  2. Computing Maximum Number of Runs in Strings.
    Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara
    String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings, pp.318-329 (2012) , [peer-reviewed]
    Event Date: October 21-25, 2012
  3. マルチトラック文字列の順列パターン照合と索引構造
    桂敬史, 成澤和志, 篠原歩, 坂内英夫, 稲永俊介
    電子情報通信学会コンピュテーション研究会，COMP, (2012)
    開催日: 2012年9月3-3日 @ 法政大学
  4. Functional programs as compressed data.
    Naoki Kobayashi, Kazutaka Matsuda, Ayumi Shinohara, Kazuya Yaguchi
    High. Order Symb. Comput., Vol.25, pp.39-84 (2012) , [peer-reviewed]
  5. Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars.
    Ryo Yoshinaka
    Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings, Lecture Notes in Computer Science, Vol.7183, pp.538-550 (2012) , [peer-reviewed]
    Event Date: March 5-9, 2012
2011 (6 件)
  1. 覆面算を解析するためのオートマトン理論的アプローチ
    遠藤洋, 成澤和志, 篠原歩
    第16回ゲームプログラミングワークショップ, (2011)
    開催日: 2011年11月5-5日 @ 箱根セミナーハウス
  2. Distributional Learning of Simple Context-Free Tree Grammars.
    Anna Kasprzik, Ryo Yoshinaka
    Algorithmic Learning Theory - 22nd International Conference, ALT 2011, Espoo, Finland, October 5-7, 2011. Proceedings, Lecture Notes in Computer Science, Vol.6925, pp.398-412 (2011) , [peer-reviewed]
    Event Date: October 5-7, 2011
  3. Notes on Sequence Binary Decision Diagrams: Relationship to Acyclic Automata and Complexities of Binary Set Operations.
    Shuhei Denzumi, Ryo Yoshinaka, Hiroki Arimura, Shin-ichi Minato
    Proceedings of the Prague Stringology Conference 2011, Prague, Czech Republic, August 29-31, 2011, pp.147-161 (2011) , [peer-reviewed]
    Event Date: August 29-31, 2011
  4. マルチトラック文字列に対するパターン発見について
    桂敬史, 成澤和志, 篠原歩
    夏のLAシンポジウム, (2011)
    開催日: 2011年7月19-19日 @ ザヴィラ浜名湖
  5. Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices.
    Ryo Yoshinaka
    Developments in Language Theory - 15th International Conference, DLT 2011, Milan, Italy, July 19-22, 2011. Proceedings, Lecture Notes in Computer Science, Vol.6795, pp.429-440 (2011) , [peer-reviewed]
    Event Date: July 19-22, 2011
  6. Well-Nestedness Properly Subsumes Strict Derivational Minimalism.
    Makoto Kanazawa, Jens Michaelis, Sylvain Salvati, Ryo Yoshinaka
    Logical Aspects of Computational Linguistics - 6th International Conference, LACL 2011, Montpellier, France, June 29 - July 1, 2011. Proceedings, pp.112-128 (2011) , [peer-reviewed]
    Event Date: July 1-1, 2011
2010 (6 件)
  1. 信頼区間上限の不確実性サンプリングへの応用
    斎藤淳哉, 篠原　歩
    https://www.gakkai-web.net/gakkai/fit/program/dvd/index.html， A-024, 講演論文集第1分冊，pp. 209-214, (2010)
    開催日: 2010年9月3-20日
  2. 非可逆圧縮を用いた類似性指標と画像検索への応用
    坂内恒介, 成澤和志, Felix Brodkorb, 篠原　歩
    https://www.gakkai-web.net/gakkai/fit/program/dvd/index.html， A-025, 講演論文集第1分冊，pp. 215-221, (2010)
    開催日: 2010年9月3-20日
  3. Inferring Strings from Runs.
    Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30 - September 1, 2010, pp.150-160 (2010) , [peer-reviewed]
    Event Date: September 1-1, 2010
  4. 移調を許した圧縮文字列照合アルゴリズム
    松原　渉, 篠原　歩
    電子情報通信学会 コンピュテーション研究会，COMP, (2010)
    開催日: 2010年4月22-22日 @ 立命館大学
  5. 文字列に含まれる繰り返し構造の頻度について
    草野　一彦, 篠原　歩
    http://www.ipsj.or.jp/10jigyo/taikai/72kai/index.html, 講演論文集第1分冊, pp. 409-410, (2010)
    開催日: 2010年3月9-9日 @ 東京大学
  6. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    Chic. J. Theor. Comput. Sci., Vol.2010 (2010) , [peer-reviewed]
2009 (12 件)
  1. Bit-parallel Algorithms for Computing all the Runs in a String.
    Kazunori Hirashima, Hideo Bannai, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31 - September 2, 2009, pp.203-213 (2009) , [peer-reviewed]
    Event Date: September 2-2, 2009
  2. 繰り返し構造からの文字列推測の困難さ
    松原 渉, 篠原 歩
    http://www.nishizeki.ecei.tohoku.ac.jp/LA.7, (2009)
    開催日: 2009年7月22-20日
  3. ネックレス文字列中の繰り返し構造について
    草野　一彦, 篠原　歩
    http://www.nishizeki.ecei.tohoku.ac.jp/LA.8, (2009)
    開催日: 2009年7月22-20日
  4. Cell BEを用いた文字列の編集距離計算の高速化,
    須藤 郁弥, 篠原 歩
    ACSIS2009 - 先進的計算基盤システムシンポジウム, 2009年5月28日, (2009)
    開催日: 2009年5月28-28日 @ 広島国際会議場
  5. A Series of Run-Rich Strings.
    Wataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara
    Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings, pp.578-587 (2009) , [peer-reviewed]
    Event Date: April 2-8, 2009
  6. 平衡直線的プログラムで圧縮された文字列の非反復性検証アルゴリズム
    松原 渉, 稲永 俊介, 篠原 歩
    電子通信情報学会 コンピュテーション研究会, COMP, (2009)
    開催日: 2009年3月2-2日
  7. 連を多く含む文字列発見のための探索的手法,
    松原 渉, 草野 一彦, 坂内 英夫, 石野 明, 篠原 歩
    http://www.lab2.kuis.kyoto-u.ac.jp/LA2008/winter-program.html, pp. 13.1-13.10, (2009)
    開催日: 2009年2月1-1日
  8. 文字列の繰り返し構造の平均解析,
    草野 一彦, 松原 渉, 石野 明, 篠原 歩
    http://www.lab2.kuis.kyoto-u.ac.jp/LA.11, (2009)
    開催日: 2009年2月1-1日
  9. Linear-Time Text Compression by Longest-First Substitution.
    Ryosuke Nakamura, Shunsuke Inenaga, Hideo Bannai, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
    Algorithms, Vol.2, pp.1429-1448 (2009) , [peer-reviewed]
  10. Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program.
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    CATS, CRPIT, Vol.94, pp.19-28 (2009) , [peer-reviewed]
  11. Development of an Interactive Augmented Environment and Its Application to Autonomous Learning for Quadruped Robots.
    Hayato Kobayashi, Tsugutoyo Osaki, Tetsuro Okuyama, Joshua Gramm, Akira Ishino, Ayumi Shinohara
    IEICE Trans. Inf. Syst., Vol.92-D, pp.1752-1761 (2009) , [peer-reviewed]
  12. Average Value of Sum of Exponents of Runs in a String.
    Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Int. J. Found. Comput. Sci., Vol.20, pp.1135-1146 (2009) , [peer-reviewed]
2008 (5 件)
  1. New Lower Bounds for the Maximum Number of Runs in a String.
    Wataru Matsubara, Kazuhiko Kusano, Akira Ishino, Hideo Bannai, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008, pp.140-145 (2008) , [peer-reviewed]
    Event Date: September 1-3, 2008
  2. Average Value of Sum of Exponents of Runs in Strings.
    Kazuhiko Kusano, Wataru Matsubara, Akira Ishino, Ayumi Shinohara
    Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, September 1-3, 2008, pp.185-192 (2008) , [peer-reviewed]
    Event Date: September 1-3, 2008
  3. 圧縮文字列における最長共通部分文字列および回文を求める多項式時間アルゴリズム
    松原　渉, 稲永　俊介, 石野　明, 篠原　歩, 中村　智将, 橋本　和夫
    コンピュテーション研究会，電子情報通信学会技術研究報告, Vol 107, No. 537, (COP, (2008)
    開催日: 2008年3月1-1日
  4. Computing Longest Common Substring and All Palindromes from Compressed Strings.
    Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto
    SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp.364-375 (2008) , [peer-reviewed]
    Event Date: January 19-25, 2008
  5. An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program.
    Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara
    Structure-Based Compression of Complex Massive Data, Dagstuhl Seminar Proceedings, Vol.08261 (2008) , [peer-reviewed]
2007 (1 件)
  1. 無限n-ボナッチ文字列の繰り返し構造について
    佐々木　崇人, 大崎　嗣豊, 石野　明, 篠原 歩
    コンピュテーション研究会, 信学技報, Vol.107 (2007)
    開催日: 2007年4月20-20日
2005 (5 件)
  1. Fully Incremental LCS Computation.
    Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, Lecture Notes in Computer Science, Vol.3623, pp.563-574 (2005) , [peer-reviewed]
    Event Date: August 17-20, 2005
  2. New Bit-Parallel Indel-Distance Algorithm.
    Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
    Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings, Lecture Notes in Computer Science, Vol.3503, pp.380-390 (2005) , [peer-reviewed]
    Event Date: May 10-13, 2005
  3. A fully compressed pattern matching algorithm for simple collage systems.
    Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Int. J. Found. Comput. Sci., Vol.16, pp.1155-1166 (2005) , [peer-reviewed]
  4. Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.
    Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara
    SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, Lecture Notes in Computer Science, Vol.3381, pp.380-384 (2005) , [peer-reviewed]
    Event Date: January 22-28, 2005
  5. The size of subsequence automaton.
    Zdenek Tronícek, Ayumi Shinohara
    Theor. Comput. Sci., Vol.341, pp.379-384 (2005) , [peer-reviewed]
2004 (7 件)
  1. An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars.
    Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Developments in Language Theory, 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, 2004, Proceedings, Lecture Notes in Computer Science, Vol.3340, pp.225-236 (2004) , [peer-reviewed]
    Event Date: December 13-17, 2004
  2. On Bit-Parallel Processing of Multi-byte Text.
    Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Masayuki Takeda
    Information Retrieval Technology, Asia Information Retrieval Symposium, AIRS 2004, Beijing, China, October 18-20, 2004, Revised Selected Papers, Lecture Notes in Computer Science, Vol.3411, pp.289-300 (2004) , [peer-reviewed]
    Event Date: October 18-20, 2004
  3. String Pattern Discovery.
    Ayumi Shinohara
    Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2-5, 2004, Proceedings, Lecture Notes in Computer Science, Vol.3244, pp.1-13 (2004) , [peer-reviewed]
    Event Date: October 2-5, 2004
  4. Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance.
    Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    Discovery Science, 7th International Conference, DS 2004, Padova, Italy, October 2-5, 2004, Proceedings, Lecture Notes in Computer Science, Vol.3245, pp.32-46 (2004) , [peer-reviewed]
    Event Date: October 2-5, 2004
  5. Finding Optimal Pairs of Patterns.
    Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    Algorithms in Bioinformatics, 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004, Proceedings, Lecture Notes in Computer Science, Vol.3240, pp.450-462 (2004) , [peer-reviewed]
    Event Date: September 17-21, 2004
  6. Efficiently Finding Regulatory Elements Using Correlation with Gene Expression.
    Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
    J. Bioinform. Comput. Biol., Vol.2, pp.273-288 (2004) , [peer-reviewed]
  7. Compact directed acyclic word graphs for a sliding window.
    Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    J. Discrete Algorithms, Vol.2, pp.33-51 (2004) , [peer-reviewed]
2003 (6 件)
  1. Linear-Time Off-Line Text Compression by Longest-First Substitution.
    Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
    String Processing and Information Retrieval, 10th International Symposium, SPIRE 2003, Manaus, Brazil, October 8-10, 2003, Proceedings, Lecture Notes in Computer Science, Vol.2857, pp.137-152 (2003) , [peer-reviewed]
    Event Date: October 8-10, 2003
  2. １変数文字列方程式の最小解の長さの上限
    馬場　謙介, 鶴田　聡士, 篠原 歩, 竹田　正幸
    電子情報通信学会 コンピュテーション研究会, (2003)
    開催日: 2003年10月1-1日
  3. Inferring Strings from Graphs and Arrays.
    Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings, Lecture Notes in Computer Science, Vol.2747, pp.208-217 (2003) , [peer-reviewed]
    Event Date: August 25-29, 2003
  4. Discovering Most Classificatory Patterns for Very Expressive Pattern Classes.
    Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
    Discovery Science, Lecture Notes in Computer Science, Vol.2843, pp.486-493 (2003) , [peer-reviewed]
  5. A Note on Randomized Algorithm for String Matching with Mismatches.
    Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
    Nord. J. Comput., Vol.10, pp.2-12 (2003) , [peer-reviewed]
  6. Collage system: a unifying framework for compressed pattern matching.
    Takuya Kida, Tetsuya Matsumoto, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Theor. Comput. Sci., Vol.298, pp.253-272 (2003) , [peer-reviewed]
2002 (5 件)
  1. Discovering Best Variable-Length-Don't-Care Patterns.
    Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Discovery Science, 5th International Conference, DS 2002, Lübeck, Germany, November 24-26, 2002, Proceedings, Lecture Notes in Computer Science, Vol.2534, pp.86-97 (2002) , [peer-reviewed]
    Event Date: November 24-26, 2002
  2. The Minimum DAWG for All Suffixes of a String and Its Applications.
    Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
    Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, Lecture Notes in Computer Science, Vol.2373, pp.153-167 (2002) , [peer-reviewed]
    Event Date: July 3-5, 2002
  3. Finding Best Patterns Practically.
    Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
    Progress in Discovery Science, Lecture Notes in Computer Science, Vol.2281, pp.307-317 (2002) , [peer-reviewed]
  4. Space-Economical Construction of Index Structures for All Suffixes of a String.
    Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
    Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, Lecture Notes in Computer Science, Vol.2420, pp.341-352 (2002) , [peer-reviewed]
    Event Date: August 26-30, 2002
  5. Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts.
    Masayuki Takeda, Satoru Miyamoto, Takuya Kida, Ayumi Shinohara, Shuichi Fukamachi, Takeshi Shinohara, Setsuo Arikawa
    String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings, Lecture Notes in Computer Science, Vol.2476, pp.170-186 (2002) , [peer-reviewed]
    Event Date: September 11-13, 2002
2001 (7 件)
  1. Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works.
    Hideaki Hori, Shinichi Shimozono, Masayuki Takeda, Ayumi Shinohara
    Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, Lecture Notes in Computer Science, Vol.2223, pp.719-730 (2001) , [peer-reviewed]
    Event Date: December 19-21, 2001
  2. A Practical Algorithm to Find the Best Episode Patterns.
    Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Discovery Science, 4th International Conference, DS 2001, Washington, DC, USA, November 25-28, 2001, Proceedings, Lecture Notes in Computer Science, Vol.2226, pp.435-440 (2001) , [peer-reviewed]
    Event Date: November 25-28, 2001
  3. On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs.
    Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Eighth International Symposium on String Processing and Information Retrieval, SPIRE 2001, Laguna de San Rafael, Chile, November 13-15, 2001, pp.96-110 (2001) , [peer-reviewed]
    Event Date: November 13-15, 2001
  4. Musical Sequence Comparison for Melodic and Rhythmic Similarities.
    T. Kadota, Masahiro Hirao, Akira Ishino, Masayuki Takeda, Ayumi Shinohara, Fumihiro Matsuo
    Eighth International Symposium on String Processing and Information Retrieval, SPIRE 2001, Laguna de San Rafael, Chile, November 13-15, 2001, pp.111-122 (2001) , [peer-reviewed]
    Event Date: November 13-15, 2001
  5. Compressed Pattern Matching for SEQUITUR.
    Shuichi Mitarai, Masahiro Hirao, Tetsuya Matsumoto, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Data Compression Conference (DCC2001), pp.469- (2001) , [peer-reviewed]
    Event Date: March 27-29, 2001 @ Snowbird, Utah, USA
  6. Faster Approximate String Matching over Compressed Text.
    Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Data Compression Conference (DCC2001), pp.459-468 (2001) , [peer-reviewed]
    Event Date: March 27-29, 2001 @ Snowbird, Utah, USA
  7. Multiple Pattern Matching Algorithms on Collage System.
    Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Combinatorial Pattern Matching, 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings, Lecture Notes in Computer Science, Vol.2089, pp.193-206 (2001) , [peer-reviewed]
    Event Date: July 1-4, 2001
2000 (5 件)
  1. Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
    Tetsuya Matsumoto, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    International Symposium on String Processing and Information Retrieval (SPIRE 2000), pp.221-228 (2000) , [peer-reviewed]
    Event Date: September 27-29, 2000 @ A Coruña, Spain
  2. Fully Compressed Pattern Matching Algorithm for Balanced Straight-Line Programs.
    Masahiro Hirao, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    International Symposium on String Processing and Information Retrieval (SPIRE2000), pp.132-138 (2000) , [peer-reviewed]
    Event Date: September 27-29, 2000 @ A Coruña, Spain
  3. Online Construction of Subsequence Automata for Multiple Texts.
    Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    International Symposium on String Processing and Information Retrieval (SPIRE2000), pp.146-152 (2000) , [peer-reviewed]
    Event Date: September 27-29, 2000 @ A Coruña, Spain
  4. A Boyer-Moore Type Algorithm for Compressed Pattern Matching.
    Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Combinatorial Pattern Matching (CPM2000), Lecture Notes in Computer Science, Vol.1848, pp.181-194 (2000) , [peer-reviewed]
    Event Date: June 21-23, 2000 @ Montreal, Canada
  5. Speeding Up Pattern Matching by Text Compression.
    Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
    CIAC, Lecture Notes in Computer Science, Vol.1767, pp.306-315 (2000) , [peer-reviewed]
    Event Date: March 1-3, 2000
1999 (5 件)
  1. A Unifying Framework for Compressed Pattern Matching.
    Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, SPIRE/CRIWG 1999, Cancun, Mexico, September 21-24, 1999, pp.89-96 (1999) , [peer-reviewed]
    Event Date: September 21-24, 1999
  2. 圧縮テキストに対する文字列照合のための統一的枠組み
    喜田　拓也, 竹田　正幸, 篠原　歩, 有川　節夫
    情報処理学会第５９回全国大会, (1999)
    開催日: 1999年9月1-1日
  3. データ圧縮による文字列照合の高速化
    柴田　裕介, 喜田　拓也, 竹田　正幸, 篠原　歩, 有川　節夫
    情報処理学会第５９回全国大会(1), pp. 175-176, (1999)
    開催日: 1999年9月1-1日
  4. Pattern Matching in Text Compressed by Using Antidictionaries.
    Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Combinatorial Pattern Matching (CPM99), pp.37-49 (1999) , [peer-reviewed]
    Event Date: July 22-24, 1999 @ Warwick, England
  5. Shift-And Approach to Pattern Matching in LZW Compressed Text.
    Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa
    Combinatorial Pattern Matching (CPM99), pp.1-13 (1999) , [peer-reviewed]
    Event Date: July 22-24, 1999 @ Warwick, England
1998 (2 件)
  1. LZW compressed text matching
    喜田拓也, 竹田　正幸, 篠原　歩, 有川　節夫
    情報処理学会第57回全国大会講演論文集(1), (1998)
    開催日: 1998年10月1-1日
  2. Multiple Pattern Matching in LZW Compressed Text.
    Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Masamichi Miyazaki, Setsuo Arikawa
    Data Compression Conference, DCC 1998, pp.103-112 (1998) , [peer-reviewed]
    Event Date: March 30-April 1, 1998 @ Snowbird, Utah, USA
1997 (3 件)
  1. An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs.
    Masamichi Miyazaki, Ayumi Shinohara, Masayuki Takeda
    Combinatorial Pattern Matching, 8th Annual Symposium (CPM 97), pp.1-11 (1997) , [peer-reviewed]
    Event Date: June 30-July 2, 1997 @ Aarhus, Denmark
  2. Learning Pattern Languages Using Queries.
    Satoshi Matsumoto, Ayumi Shinohara
    Computational Learning Theory, Third European Conference, EuroCOLT '97, Jerusalem, Israel, March 17-19, 1997, Proceedings, pp.185-197 (1997) , [peer-reviewed]
    Event Date: March 17-19, 1997 @ Jerusalem, Israel
  3. An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
    Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Nord. J. Comput., Vol.4, pp.172-186 (1997) , [peer-reviewed]
1995 (2 件)
  1. Pattern-Matching for Strings with Short Descriptions.
    Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Combinatorial Pattern Matching (CPM 95), Lecture Notes in Computer Science, Vol.937, pp.205-214 (1995) , [peer-reviewed]
    Event Date: July 5-7, 1995
  2. Pattern-Matching for Strings with Short Descriptions
    Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
    Electron. Colloquium Comput. Complex., Vol.TR95 (1995) , [peer-reviewed]
1993 (1 件)
  1. BONSAI: 決定木とインデックス化による文字列からの機械発見システム
    宮野　悟, 篠原　歩, 有川　節夫, 下薗　真一, 篠原　武, 久原　哲
    9--122, (1993)
    開催日: 1993年7月11-11日
1991 (1 件)
  1. More About Learning Elementary Formal Systems.
    Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara
    Nonmonotonic and Inductive Logic, Lecture Notes in Computer Science, Vol.659, pp.107-117 (1991) , [peer-reviewed]
    Event Date: December 2-6, 1991 @ Reinhardsbrunn Castle, Germany