Skip to main content
SpringerLink
Log in

String Processing and Information Retrieval

16th International Symposium, SPIRE 2009 Saariselkä, Finland, August 25-27, 2009 Proceedings

  • Conference proceedings
  • © 2009

Overview

Editors:
  1. Jussi Karlgren

    1. Swedish Institute of Computer Science, Kista, Sweden

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jorma Tarhio

    1. Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Heikki Hyyrö

    1. Department of Computer Sciences, University of Tampere, Tampere, Finland

    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 5721)

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

Included in the following conference series:

Conference proceedings info: SPIRE 2009.

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 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 (34 papers)

  1. Front Matter

    Download chapter PDF

  2. Algorithms on Trees

    1. Range Quantile Queries: Another Virtue of Wavelet Trees

      • Travis Gagie, Simon J. Puglisi, Andrew Turpin
      Pages 1-6

    2. Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

      • Daiji Fukagawa, Tatsuya Akutsu, Atsuhiro Takasu
      Pages 7-17

    3. k2-Trees for Compact Web Graph Representation

      • Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
      Pages 18-30

    4. On-Line Construction of Parameterized Suffix Trees

      • Taehyung Lee, Joong Chae Na, Kunsoo Park
      Pages 31-38

  3. Compressed Indexes

    1. Succinct Text Indexing with Wildcards

      • Alan Tam, Edward Wu, Tak-Wah Lam, Siu-Ming Yiu
      Pages 39-50

    2. A Compressed Enhanced Suffix Array Supporting Fast String Matching

      • Enno Ohlebusch, Simon Gog
      Pages 51-62

    3. Compressed Suffix Arrays for Massive Data

      • Jouni Sirén
      Pages 63-74

    4. On Entropy-Compressed Text Indexing in External Memory

      • Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
      Pages 75-89

  4. Compression

    1. A Linear-Time Burrows-Wheeler Transform Using Induced Sorting

      • Daisuke Okanohara, Kunihiko Sadakane
      Pages 90-101

    2. Novel and Generalized Sort-Based Transform for Lossless Data Compression

      • Kazumasa Inagaki, Yoshihiro Tomizawa, Hidetoshi Yokoo
      Pages 102-113

    3. A Two-Level Structure for Compressing Aligned Bitexts

      • Joaquín Adiego, Nieves R. Brisaboa, Miguel A. Martínez-Prieto, Felipe Sánchez-Martínez
      Pages 114-121

    4. Directly Addressable Variable-Length Codes

      • Nieves R. Brisaboa, Susana Ladra, Gonzalo Navarro
      Pages 122-130

  5. Content Analysis

    1. Identifying the Intent of a User Query Using Support Vector Machines

      • Marcelo Mendoza, Juan Zamora
      Pages 131-142

    2. Syntactic Query Models for Restatement Retrieval

      • Niranjan Balasubramanian, James Allan
      Pages 143-155

    3. Use of Co-occurrences for Temporal Expressions Annotation

      • Olga Craveiro, Joaquim Macedo, Henrique Madeira
      Pages 156-164

    4. On-Demand Associative Cross-Language Information Retrieval

      • André Pinto Geraldo, Viviane P. Moreira, Marcos A. Gonçalves
      Pages 165-173

    5. A Comparison of Data-Driven Automatic Syllabification Methods

      • Connie R. Adsett, Yannick Marchand
      Pages 174-181

  6. Indexing

    1. Efficient Index for Retrieving Top-k Most Frequent Documents

      • Wing-Kai Hon, Rahul Shah, Shih-Bin Wu
      Pages 182-193

    2. Fast Single-Pass Construction of a Half-Inverted Index

      • Marjan Celikik, Hannah Bast
      Pages 194-205
Back to top

Other volumes

  1. String Processing and Information Retrieval

Keywords

About this book

This book constitutes the refereed proceedings of the 16th String Processing and Information Retrieval Symposium, SPIRE 2009 held in Saariselkä, Finland in August 2009. The 34 revised full papers were carefully reviewed and selected from 84 submissions. The papers are organized in topical sections on algorithms on trees, compressed indexes, compression, indexing, content analysis, string algorithms and bioinformatics, string algorithms and theory, and using and understanding usage.

Editors and Affiliations

  • Swedish Institute of Computer Science, Kista, Sweden

    Jussi Karlgren

  • Department of Computer Science and Engineering, Helsinki University of Technology, Espoo, Finland

    Jorma Tarhio

  • Department of Computer Sciences, University of Tampere, Tampere, Finland

    Heikki Hyyrö

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation