Skip to main content
SpringerLink
Log in

String Processing and Information Retrieval

23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings

  • Conference proceedings
  • © 2016

Overview

Editors:
  1. Shunsuke Inenaga

    1. Kyushu University , Fukuoka, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kunihiko Sadakane

    1. Mathematical Informatics, University of Tokyo , Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Tetsuya Sakai

    1. Computer Science, Waseda University , Tokyo, Japan

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 9954)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SPIRE 2016.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (25 papers)

  1. Front Matter

    Pages I-XVI
    Download chapter PDF

  2. RLZAP: Relative Lempel-Ziv with Adaptive Pointers

    • Anthony J. Cox, Andrea Farruggia, Travis Gagie, Simon J. Puglisi, Jouni Sirén
    Pages 1-14

  3. A Linear-Space Algorithm for the Substring Constrained Alignment Problem

    • Yoshifumi Sakai
    Pages 15-21

  4. Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

    • Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski et al.
    Pages 22-34

  5. The Smallest Grammar Problem Revisited

    • Danny Hucke, Markus Lohrey, Carl Philipp Reh
    Pages 35-49

  6. Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes

    • Antonio Fariña, Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Alberto Ordóñez
    Pages 50-60

  7. Parallel Lookups in String Indexes

    • Anders Roy Christiansen, Martín Farach-Colton
    Pages 61-67

  8. Fast Classification of Protein Structures by an Alignment-Free Kernel

    • Taku Onodera, Tetsuo Shibuya
    Pages 68-79

  9. XBWT Tricks

    • Giovanni Manzini
    Pages 80-92

  10. Maximal Unbordered Factors of Random Strings

    • Patrick Hagge Cording, Mathias Bæk Tejs Knudsen
    Pages 93-96

  11. Fragmented BWT: An Extended BWT for Full-Text Indexing

    • Masaru Ito, Hiroshi Inoue, Kenjiro Taura
    Pages 97-109

  12. AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching

    • Diptarama, Ryo Yoshinaka, Ayumi Shinohara
    Pages 110-121

  13. Parallel Computation for the All-Pairs Suffix-Prefix Problem

    • Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles
    Pages 122-132

  14. Dynamic and Approximate Pattern Matching in 2D

    • Raphaël Clifford, Allyx Fontaine, Tatiana Starikovskaya, Hjalte Wedel Vildhøj
    Pages 133-144

  15. Fully Dynamic de Bruijn Graphs

    • Djamal Belazzougui, Travis Gagie, Veli Mäkinen, Marco Previtali
    Pages 145-152

  16. Bookmarks in Grammar-Compressed Strings

    • Patrick Hagge Cording, Pawel Gawrychowski, Oren Weimann
    Pages 153-159

  17. Analyzing Relative Lempel-Ziv Reference Construction

    • Travis Gagie, Simon J. Puglisi, Daniel Valenzuela
    Pages 160-165

  18. Inverse Range Selection Queries

    • M. OÄŸuzhan Külekci
    Pages 166-177

  19. Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array

    • German Tischler
    Pages 178-190

  20. Efficient Representation of Multidimensional Data over Hierarchical Domains

    • Nieves R. Brisaboa, Ana Cerdeira-Pena, Narciso López-López, Gonzalo Navarro, Miguel R. Penabad, Fernando Silva-Coira
    Pages 191-203
Back to top

Other volumes

  1. String Processing and Information Retrieval

Keywords

About this book

This book constitutes the refereed proceedings of the 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016, held in Beppu, Japan, in October 2016. The 25 full papers presented were carefully reviewed and selected from 46 submissions. The focus of the papers is on fundamental studies of string processes and information retrieval and its applications for example to areas such as bioinformatics, Web mining and others.

Editors and Affiliations

  • Kyushu University , Fukuoka, Japan

    Shunsuke Inenaga

  • Mathematical Informatics, University of Tokyo , Tokyo, Japan

    Kunihiko Sadakane

  • Computer Science, Waseda University , Tokyo, Japan

    Tetsuya Sakai

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation