Search Results - "Inenaga, S"

  • Showing 1 - 16 results of 16
Refine Results
  1. 1

    Polypeptide N-acetylgalactosaminyltransferase 6 expression in pancreatic cancer is an independent prognostic factor indicating better overall survival by Li, Z, Yamada, S, Inenaga, S, Imamura, T, Wu, Y, Wang, K-Y, Shimajiri, S, Nakano, R, Izumi, H, Kohno, K, Sasaguri, Y

    Published in British journal of cancer (07-06-2011)
    “…Background: The family of polypeptide N -acetylgalactosaminyltransferases (GalNAc-Ts) is responsible for the altered glycosylation in cancer. The purpose of…”
    Get full text
    Journal Article
  2. 2

    Computing Convolution on Grammar-Compressed Text by Tanaka, T., Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.

    Published in 2013 Data Compression Conference (01-03-2013)
    “…The convolution between a text string S of length N and a pattern string P of length m can be computed in O(N log m) time by FFT. It is known that various…”
    Get full text
    Conference Proceeding
  3. 3

    From Run Length Encoding to LZ78 and Back Again by Tamakoshi, Y., Tomohiro, I., Inenaga, S., Bannai, H., Takeda, M.

    Published in 2013 Data Compression Conference (01-03-2013)
    “…In this paper, we present efficient algorithms for interconversion between Lempel-Ziv 78 (LZ78) encoding and run length encoding (RLE). We show how, given an…”
    Get full text
    Conference Proceeding
  4. 4

    Bidirectional construction of suffix trees by Inenaga, S

    Published in Computing reviews (01-01-2004)
    “…A linear-time algorithm is presented in this paper for the bidirectional construction of suffix trees, which are the most basic index structures used in string…”
    Get full text
    Journal Article
  5. 5

    On-line construction of compact directed acyclic word graphs by Inenaga, Shunsuke, Hoshino, Hiromasa, Shinohara, Ayumi, Takeda, Masayuki, Arikawa, Setsuo, Mauri, Giancarlo, Pavesi, Giulio

    Published in Discrete Applied Mathematics (01-03-2005)
    “…Many different index structures, providing efficient solutions to problems related to pattern matching, have been introduced so far. Examples of these…”
    Get full text
    Journal Article Conference Proceeding
  6. 6

    Ternary directed acyclic word graphs by Miyamoto, Satoru, Inenaga, Shunsuke, Takeda, Masayuki, Shinohara, Ayumi

    Published in Theoretical computer science (29-11-2004)
    “…Given a set S of strings, a DFA accepting S offers a very time-efficient solution to the pattern matching problem over S. The key is how to implement such a…”
    Get full text
    Journal Article Conference Proceeding
  7. 7

    On-line construction of symmetric compact directed acyclic word graphs by Inenaga, S., Hoshino, H., Shinohara, A., Takeda, M., Arikawa, S.

    “…The Compact Directed Acyclic Word Graph (CDAWG) is a space-eflcient data structure that supports indices of a string. The Symmetric Directed Acyclic Word Graph…”
    Get full text
    Conference Proceeding
  8. 8

    Efficiently finding regulatory elements using correlation with gene expression by Bannai, Hideo, Inenaga, Shunsuke, Shinohara, Ayumi, Takeda, Masayuki, Miyano, Satoru

    “…We present an efficient algorithm for detecting putative regulatory elements in the upstream DNA sequences of genes, using gene expression information obtained…”
    Get more information
    Journal Article
  9. 9

    A Preliminary Evaluation for User Interfaces According to User Computer Skill and Computer Specifications by Inenaga, S., Sugita, K., Oka, T., Yokota, M.

    “…Recently, immense multimedia information is exchanged on the Internet, where 3DCG, video, image, sound, and text are involved in various circumstances with…”
    Get full text
    Conference Proceeding
  10. 10

    Curious properties of soliton induced by Marangoni instability in shallow Belousov-Zhabotinsky reaction by Kai, Shoichi, Ariyoshi, Takayuki, Inenaga, Seiji, Miike, Hidetoshi

    Published in Physica. D (15-06-1995)
    “…The detailed properties of a soliton-like wave in shallow fluid layers with the Belousov-Zhabotinsky (BZ) chemical reaction were investigated. The quite…”
    Get full text
    Journal Article
  11. 11

    Performance Evaluation of User Interfaces According to User Computer Skill and Computer Specifications by Inenaga, S., Sugita, K., Oka, T., Yokota, M.

    “…Recently, immense multimedia information is exchanged on the Internet, where 3DCG, video, image, sound, and text are involved in various circumstances with…”
    Get full text
    Conference Proceeding
  12. 12

    An Evaluation System for Different Types of User Interfaces According to User Computer Skill and Computer Specifications by Inenaga, S., Sugita, K., Oka, T., Yokota, M.

    “…Recently, immense multimedia information is exchanged on the Internet, where 3DCG, video, image, sound, and text are involved in various circumstances with…”
    Get full text
    Conference Proceeding
  13. 13

    Multimedia Contents for Userinterface Switching Function by Inenaga, S, Sugita, K, Oka, T, Yokota, M

    “…Recently, immense multimedia information is exchanged on the Internet, where 3DCG, video, image, sound, and text are involved in various circumstances with…”
    Get full text
    Conference Proceeding
  14. 14

    Towards modeling stored-value electronic money systems by Inenaga, S., Oyama, K., Yasuura, H.

    “…This paper presents mathematical and general models of electronic money systems. The goal of the paper is to propose a first framework in which various kinds…”
    Get full text
    Conference Proceeding
  15. 15

    Anonymous authentication systems based on private information retrieval by Nakamura, T., Inenaga, S., Ikeda, D., Baba, K., Yasuura, H.

    “…This paper focuses on authentication with three types of entities: a user who sends an authentication request, an authentication-server who receives and…”
    Get full text
    Conference Proceeding
  16. 16

    Simple Linear-Time Off-Line Text Compression by Longest-First Substitution by Nakamura, R., Bannai, H., Inenaga, S., Takeda, M.

    Published in 2007 Data Compression Conference (DCC'07) (01-03-2007)
    “…We consider grammar based text compression with longest-first substitution, where non-overlapping occurrences of a longest repeating substring of the input…”
    Get full text
    Conference Proceeding