Search Results 1-20 of 92

  • 1 / 5
  • Frequent Multi-byte Characters String Mining Using Wavelet Tree-based Compress Suffix Array

    パーヌチーップ チョーットニティ , 高須 淳宏

    … To solve this problem, we applied wavelet tree-based compress suffix array instead of normal suffix array to reduce memory usage. … Then, we proposed a novel technique which utilizes the rank operation to improve the run-time by 45% compared to using only compress suffix array. …

    第78回全国大会講演論文集 2016(1), 411-412, 2016-03-10

    IPSJ 

  • Secure Partial Matching Query for String Attributes Using Encrypted Suffix Array  [in Japanese]

    篠塚 千愛 , 渡辺 知恵美 , 北川 博之

    コンピュータセキュリティシンポジウム2015論文集 2015(3), 979-986, 2015-10-14

    IPSJ 

  • Extracting Block Structure from Router Command Output Data  [in Japanese]

    木村 達明 , 渡邉 暁 , 渡辺 敬志郎 [他]

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 115(192), 35-40, 2015-08-25

  • Faster Protein Sequence Homology Searches for Large-scale Metagenomic Data

    鈴木 脩司 , Suzuki Shuji

    … We used three approaches: development of novel protein sequence homology search algorithms, acceleration of protein sequence homology search with graphics processing unit (GPU), and parallelization of protein sequence homology search using modern supercomputing environments.We propose a novel protein sequence homology search algorithm that finds similarities between a query and database sequences based on the suffix arrays of these sequences. …

    2015-03

    IR 

  • Development of a Full-Text Search Module for Audio and Video Lectures with the Use of a Spoken Term Detection System Utilizing the Suffix Array  [in Japanese]

    MORIMOTO Yosuke , AOKI Kumiko , KATSURADA Koichi , ISHIHARA Genki , MIURA Seiichi , IRIBE Yurie , NITTA Tsuneo

    … In this research a full-text search module of auto-recognized speech texts for audio and video lectures are developed with the use of a spoken term detection system using the suffix array. …

    IEICE technical report. Education technology 113(482), 187-192, 2014-03-08

  • A Method for Approximating Document Frequency in Top-k Document Retrieval

    Tokinori Suzuki , Atsushi Fujii

    … A new class of indexes derived from suffix array family have been studied in this decade. …

    IPSJ SIG Notes 2014-IFAT-113(2), 1-8, 2014-01-31

  • A Fast Parallel Algorithm for Indexing Human Genome Sequences

    LOH Woong-Kee , HAN Kyoung-Soo

    … A suffix tree is widely adopted for indexing genome sequences. … While supporting highly efficient search, the suffix tree has a few shortcomings such as very large size and very long construction time. … In this paper, we propose a very fast parallel algorithm to construct a disk-based suffix tree for human genome sequences. …

    IEICE Transactions on Information and Systems E97.D(5), 1345-1348, 2014

    J-STAGE 

  • Evaluation of Fast Spoken Term Detection System Using a Suffix Array  [in Japanese]

    KATSURADA Kouichi , KATSUURA Koudai , IRIBE Yurie , NITTA Tsuneo

    … 本論文ではコンパクトなデータ構造であるsuffix arrayを利用した高速で大規模メモリを要さない音声検索語検出システムを提案する.このシステムではsuffix arrayを木構造に見立て,ルートノードからDP(Dynamic Programming)マッチングを適用することによって,インデックスサイズの小さい高速音声検索語検出を実現している.また検索キーワードが長くなると検索時間が指 …

    The IEICE transactions on information and systems (Japanese edition) 96(10), 2540-2548, 2013-10

  • Lightweight parallel index construction for string matching  [in Japanese]

    林 伸也 , 田浦 健次朗

    先進的計算基盤システムシンポジウム論文集 (2013), 28-32, 2013-05-15

    IPSJ 

  • Spoken Term Detection for Suffix Array was Constructed Using Multiple Speech Recognition Results  [in Japanese]

    KATSUURA KOUDAI , KATSURADA KOUICHI , IRIBE YURIE , NITTA TSUNEO

    … This paper proposes a fast spoken term detection (STD) method using a suffix array. … Previously, we have proposed a STD method in which a suffix array is constructed from a recognition result obtained by using a single syllable-based language model. …

    IEICE technical report. Speech 112(369), 81-86, 2012-12-20

  • F-009 An Efficient Indexing Method for Go Game Records based on Suffix Array  [in Japanese]

    Kato Yudai , Shiramatsu Shun , Ozono Tadachika , Shintani Toramatsu

    情報科学技術フォーラム講演論文集 11(2), 277-278, 2012-09-04

    IPSJ 

  • Speed-up of homology search tool using suffix array and it's extension for epigenomic analysis  [in Japanese]

    SUZUKI SHUJI , ISHIDA TAKASHI , AKIYAMA YUTAKA

    … We developed the system for fast homology search using suffix array. … To accelerate search using suffix array, we store the results of searching patterns whose length is less than L_<hash> …

    IEICE technical report. Neurocomputing 112(108), 125-131, 2012-06-21

    References (17)

  • Speed-up of homology search tool using suffix array and it's extension for epigenomic analysis  [in Japanese]

    鈴木 脩司 , 石田 貴士 , 秋山 泰

    … 我々は以前に suffix array を用いた高速な相同性検索システムを提案したが,近年の次世代シークエンサーの進歩が目覚ましく,得られる配列データは増加しており,さらなる高速化が必要とされている.このため,本研究では従来システムの改良を試み,長さ L hash のすべての文字列の suffix array の検索結果を予め計算しておき,これを保存しておく.そして, …

    研究報告バイオ情報学(BIO) 2012-BIO-29(24), 1-7, 2012-06-21

  • Clustering Documents with Maximal Substrings

    Masada Tomonari , Takasu Atsuhiro , Shibata Yuichiro , Oguri Kiyoshi

    This paper provides experimental results showing that we can use maximal substrings as elementary building blocks of documents in place of the words extracted by a current state-of-the-art supervised …

    Lecture Notes in Business Information Processing (102), 19-34, 2012-05-20

    IR 

  • Entropy estimation with suffix arrays (Special issue : Theoretical computer science and discrete mathematics)

    Kunihiko SADAKANE

    … In this paper we give an algorithm for estimating the entropy of a string using the suffix array. … Our algorithm is based on a new combinatorial property of the longest common prefix array of a string. …

    Progress in informatics -(9), 19-23, 2012-03

  • Indexed Swap Matching for Short Patterns

    ZHAO Hua , LU Songfeng

    Let <i>T</i> be a text of length <i>n</i> and <i>P</i> be a pattern of length <i>m</i>, both strings over a fixed finite alphabet. The <i>Pattern …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 95(1), 362-366, 2012-01-01

    J-STAGE  References (16)

  • Extracting Transliteration Pairs from Classical Chinese Buddhist Literature  [in Japanese]

    Wang Yu-Chun , Tsai Richard Tzong-Han

    … To extract more possible transliterations without introducing too many false positives, we adopt a hybrid method consists of a machine-learning-based extraction method with phonological features of the transliteration characters and a suffix-array-based extraction method with filtering rules. …

    Proceedings of the Annual Conference of JSAI JSAI2012(0), 3M2IOS3b4-3M2IOS3b4, 2012

    J-STAGE 

  • A Partial Match Retrieval Method on P2P Networks using Skip Graph and Suffix Array  [in Japanese]

    BANNO Ryohei , SATO Haruhiko , OYAMA Satoshi , KURIHARA Masahito

    … In this paper, we propose a new partial match retrieval method which combines Skip Graph, a structured overlay network supporting range queries, and Suffix Array, a useful data structure in string manipulation. …

    Computer Software 29(3), 3_164-3_180, 2012

    J-STAGE 

  • Theoretical Basis of Keyword Division in the Fast STD Using Suffix Array  [in Japanese]

    Katsurada Kouichi , Iribe Yurie , Nitta Tsuneo

    … We have proposed a spoken term detection (STD) method using a suffix array, and have evaluated its search speed on a large speech database. … This method employs iterative lengthening search and keyword division for quicker search, as well as utilizing the suffix array as a data structure. …

    IEICE technical report. Speech 111(365), 91-96, 2011-12-19

  • Theoretical Basis of Keyword Division in the Fast STD Using Suffix Array  [in Japanese]

    KATSURADA Kouichi , IRIBE Yurie , NITTA Tsuneo

    … We have proposed a spoken term detection (STD) method using a suffix array, and have evaluated its search speed on a large speech database. … This method employs iterative lengthening search and keyword division for quicker search, as well as utilizing the suffix array as a data structure. …

    IEICE technical report. Natural language understanding and models of communication 111(364), 91-96, 2011-12-12

    References (7)

  • 1 / 5
Page Top