• Refine your search:
  • 
    Keyword:
    
    • Data Structures and Algorithms cs.DS (4)
    • FOS Computer and information sciences (4)
    • Computer Science (2)
  • 
    Creator / Publisher:
    
    • Nishimoto, Takaaki (6)
    • Bannai, Hideo (4)
    • Inenaga, Shunsuke (4)
    • Takeda, Masayuki (4)
    • I, Tomohiro (2)
    • Tabei, Yasuo (2)
    • Tanimura, Yuka (2)
    • Kanda, Shunsuke (1)
    • Takabatake, Yoshimasa (1)
  • 
    Year
  • 
    Medium
  • 
    Type
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Hits 1 – 6 of 6 1 An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ... Nishimoto, Takaaki; Kanda, Shunsuke; Tabei, Yasuo. - : arXiv, 2022 BASE Show details 2 Small-space encoding LCE data structure with constant-time queries ... Tanimura, Yuka; Nishimoto, Takaaki; Bannai, Hideo. - : arXiv, 2017 BASE Show details 3 Small-Space LCE Data Structure with Constant-Time Queries ... Tanimura, Yuka; Nishimoto, Takaaki; Bannai, Hideo. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017 BASE Show details 4 A compressed dynamic self-index for highly repetitive text collections ... Nishimoto, Takaaki; Takabatake, Yoshimasa; Tabei, Yasuo. - : arXiv, 2017 Abstract: We present a novel compressed dynamic self-index for highly repetitive text collections. Signature encoding is a compressed dynamic self-index for highly repetitive texts and has a large disadvantage that the pattern search for short patterns is slow. We improve this disadvantage for faster pattern search by leveraging an idea behind truncated suffix tree and present the first compressed dynamic self-index named TST-index that supports not only fast pattern search but also dynamic update operation of index for highly repetitive texts. Experiments using a benchmark dataset of highly repetitive texts show that the pattern search of TST-index is significantly improved. ... Keyword: Data Structures and Algorithms cs.DS; FOS Computer and information sciences URL: https://arxiv.org/abs/1711.02855 https://dx.doi.org/10.48550/arxiv.1711.02855 BASE Hide details 5 Fully Dynamic Data Structure for LCE Queries in Compressed Space ... Nishimoto, Takaaki; I, Tomohiro; Inenaga, Shunsuke. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016 BASE Show details 6 Fully dynamic data structure for LCE queries in compressed space ... Nishimoto, Takaaki; I, Tomohiro; Inenaga, Shunsuke. - : arXiv, 2016 BASE Show details

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 0 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 6 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0