The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shunsuke Inenaga: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
    On-Line Construction of Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:169-180 [Conf]
  2. Shunsuke Inenaga, Masayuki Takeda
    On-Line Linear-Time Construction of Word Suffix Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:60-71 [Conf]
  3. Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara, Hiromasa Hoshino, Setsuo Arikawa
    The Minimum DAWG for All Suffixes of a String and Its Applications. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:153-167 [Conf]
  4. Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:123-132 [Conf]
  5. Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masayuki Takeda
    Practical Algorithms for Pattern Based Linear Regression. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2005, pp:44-56 [Conf]
  6. Yasuto Higa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    A New Family of String Classifiers Based on Local Relatedness. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2006, pp:114-124 [Conf]
  7. Masahiro Hirao, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    A Practical Algorithm to Find the Best Episode Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2001, pp:435-440 [Conf]
  8. Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Discovering Best Variable-Length-Don't-Care Patterns. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2002, pp:86-97 [Conf]
  9. Shunsuke Inenaga, Hideo Bannai, Heikki Hyyrö, Ayumi Shinohara, Masayuki Takeda, Kenta Nakai, Satoru Miyano
    Finding Optimal Pairs of Cooperative and Competing Patterns with Bounded Distance. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:32-46 [Conf]
  10. Masayuki Takeda, Shunsuke Inenaga, Hideo Bannai, Ayumi Shinohara, Setsuo Arikawa
    Discovering Most Classificatory Patterns for Very Expressive Pattern Classes. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2003, pp:486-493 [Conf]
  11. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:225-236 [Conf]
  12. Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Masahiro Hirao, Hiromasa Hoshino, Shunsuke Inenaga
    Finding Best Patterns Practically. [Citation Graph (0, 0)][DBLP]
    Progress in Discovery Science, 2002, pp:307-317 [Conf]
  13. Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Fully Incremental LCS Computation. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:563-574 [Conf]
  14. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    Inferring Strings from Graphs and Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:208-217 [Conf]
  15. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa
    Space-Economical Construction of Index Structures for All Suffixes of a String. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:341-352 [Conf]
  16. Stanislav Angelov, Shunsuke Inenaga
    Composite Pattern Discovery for PCR Application. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:167-178 [Conf]
  17. Shunsuke Inenaga, Takashi Funamoto, Masayuki Takeda, Ayumi Shinohara
    Linear-Time Off-Line Text Compression by Longest-First Substitution. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:137-152 [Conf]
  18. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    On-Line Construction of Symmetric Compact Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2001, pp:96-110 [Conf]
  19. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Compact Directed Acyclic Word Graphs for a Sliding Window. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:310-324 [Conf]
  20. Shunsuke Inenaga, Masayuki Takeda
    Sparse Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:61-73 [Conf]
  21. Yasuto Higa, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
    Reachability on suffix tree graphs. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:212-225 [Conf]
  22. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    A Fully Compressed Pattern Matching Algorithm for Simple Collage Systems. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:98-113 [Conf]
  23. Shunsuke Inenaga, Masayuki Takeda
    Sparse compact directed acyclic word graphs. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:197-211 [Conf]
  24. Shunsuke Inenaga, Teemu Kivioja, Veli Mäkinen
    Finding Missing Patterns. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:463-474 [Conf]
  25. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
    Ternary Directed Acyclic Word Graphs. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:120-130 [Conf]
  26. Shunsuke Inenaga, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa, Giancarlo Mauri, Giulio Pavesi
    On-line construction of compact directed acyclic word graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:2, pp:156-179 [Journal]
  27. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda
    A fully compressed pattern matching algorithm for simple collage systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1155-1166 [Journal]
  28. Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Satoru Miyano
    Efficiently Finding Regulatory Elements Using Correlation with Gene Expression. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2004, v:2, n:2, pp:273-288 [Journal]
  29. Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa
    Compact directed acyclic word graphs for a sliding window. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2004, v:2, n:1, pp:33-51 [Journal]
  30. Kensuke Baba, Ayumi Shinohara, Masayuki Takeda, Shunsuke Inenaga, Setsuo Arikawa
    A Note on Randomized Algorithm for String Matching with Mismatches. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:2-12 [Journal]
  31. Shunsuke Inenaga
    Bidirectional Construction of Suffix Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:52-0 [Journal]
  32. Satoru Miyamoto, Shunsuke Inenaga, Masayuki Takeda, Ayumi Shinohara
    Ternary directed acyclic word graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:328, n:1-2, pp:97-111 [Journal]
  33. Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
    Efficient Computation of Substring Equivalence Classes with Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:340-351 [Conf]

  34. Verifying a Parameterized Border Array in O(n1.5) Time. [Citation Graph (, )][DBLP]


  35. String Kernels Based on Variable-Length-Don't-Care Patterns. [Citation Graph (, )][DBLP]


  36. An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services. [Citation Graph (, )][DBLP]


  37. Modeling Costs of Access Control with Various Key Management Systems. [Citation Graph (, )][DBLP]


  38. Computing Longest Common Substring and All Palindromes from Compressed Strings. [Citation Graph (, )][DBLP]


  39. Dynamic Edit Distance Table under a General Weighted Cost Function. [Citation Graph (, )][DBLP]


  40. Finding Characteristic Substrings from Compressed Texts. [Citation Graph (, )][DBLP]


  41. Parameterized Suffix Arrays for Binary Strings. [Citation Graph (, )][DBLP]


  42. Counting Parameterized Border Arrays for a Binary Alphabet. [Citation Graph (, )][DBLP]


  43. Lightweight Parameterized Suffix Array Construction. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002