Skip to main content
SpringerLink
Log in

String Processing and Information Retrieval

17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Edgar Chavez

    1. School of Physics and Mathematics, Edificio "B", Universidad Michoacana, Morelia, Mich., Mexico

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Stefano Lonardi

    1. Dept. of Computer Science and Enginerring, University of California, Riverside, USA

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

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

Included in the following conference series:

Conference proceedings info: SPIRE 2010.

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

  1. Front Matter

    Download chapter PDF

  2. Crowdsourcing and Recommendation

    1. Querying the Web Graph

      • Marc Najork
      Pages 1-12

    2. Incremental Algorithms for Effective and Efficient Query Recommendation

      • Daniele Broccolo, Ophir Frieder, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri
      Pages 13-24

    3. Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis

      • Yoram Bachrach, Ralf Herbrich
      Pages 25-36

    4. On Tag Spell Checking

      • Franco Maria Nardini, Fabrizio Silvestri, Hossein Vahabi, Pedram Vahabi, Ophir Frieder
      Pages 37-42

  3. Indexes and Compressed Indexes

    1. Compressed Self-indices Supporting Conjunctive Queries on Document Collections

      • Diego Arroyuelo, Senén González, Mauricio Oyarzún
      Pages 43-54

    2. String Retrieval for Multi-pattern Queries

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

    3. Colored Range Queries and Document Retrieval

      • Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
      Pages 67-81

    4. Range Queries over Untangled Chains

      • Francisco Claude, J. Ian Munro, Patrick K. Nicholson
      Pages 82-93

  4. Theory

    1. Multiplication Algorithms for Monge Matrices

      • Luís M. S. Russo
      Pages 94-105

    2. Why Large Closest String Instances Are Easy to Solve in Practice

      • Christina Boucher, Kathleen Wilkie
      Pages 106-117

    3. A PTAS for the Square Tiling Problem

      • Amihood Amir, Alberto Apostolico, Gad M. Landau, Oren Sar Shalom
      Pages 118-126

    4. On the Hardness of Counting and Sampling Center Strings

      • Christina Boucher, Mohamed Omar
      Pages 127-134

  5. String Algorithms I

    1. Counting and Verifying Maximal Palindromes

      • Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
      Pages 135-146

    2. Identifying SNPs without a Reference Genome by Comparing Raw Reads

      • Pierre Peterlongo, Nicolas Schnel, Nadia Pisanti, Marie-France Sagot, Vincent Lacroix
      Pages 147-158

    3. Dynamic Z-Fast Tries

      • Djamal Belazzougui, Paolo Boldi, Sebastiano Vigna
      Pages 159-172

    4. Improved Fast Similarity Search in Dictionaries

      • Daniel Karch, Dennis Luxen, Peter Sanders
      Pages 173-178

  6. Compression

    1. Training Parse Trees for Efficient VF Coding

      • Takashi Uemura, Satoshi Yoshida, Takuya Kida, Tatsuya Asai, Seishi Okamoto
      Pages 179-184

    2. Algorithms for Finding a Minimum Repetition Representation of a String

      • Atsuyoshi Nakamura, Tomoya Saito, Ichigaku Takigawa, Hiroshi Mamitsuka, Mineichi Kudo
      Pages 185-190

    3. Faster Compressed Dictionary Matching

      • Wing-Kai Hon, Tsung-Han Ku, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
      Pages 191-200
Back to top

Other volumes

  1. String Processing and Information Retrieval

Keywords

About this book

This book constitutes the proceedings of the 17th International Symposium on String Processing and Information Retrieval, SPIRE 2010, held in Los Cabos, Mexico, in October 2010.


The 26 long and 13 short papers presented were carefully reviewed and selected from 109 submissions. The volume also contains 2 invited talks. The papers are structured in topical sections on crowdsourcing and recommendation; indexes and compressed indexes; theory; string algorithms; compressions; querying and search user experience; document analysis and comparison; compressed indexes; and string matching.

Editors and Affiliations

  • School of Physics and Mathematics, Edificio "B", Universidad Michoacana, Morelia, Mich., Mexico

    Edgar Chavez

  • Dept. of Computer Science and Enginerring, University of California, Riverside, USA

    Stefano Lonardi

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation