Skip to main content
SpringerLink
Log in

String Processing and Information Retrieval

18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Roberto Grossi

    1. Università di Pisa, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Fabrizio Sebastiani

    1. Consiglio Nazionale delle Ricerche, Area della Ricerca di Pisa, Istituto di Scienza e Tecnologia dell’Informazione “Alessandro Faedo”, Pisa, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Fabrizio Silvestri

    1. Consiglio Nazionale delle Ricerche, Area della Ricerca di Pisa, Istituto di Scienza e Tecnologia dell’Informazione “Alessandro Faedo”, Pisa, Italy

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results

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

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

Included in the following conference series:

Conference proceedings info: SPIRE 2011.

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

  1. Front Matter

    Download chapter PDF

  2. Constructing Strings at the Nano Scale via Staged Self-assembly

    • Erik D. Demaine
    Pages 1-1

  3. Discounted Cumulative Gain and User Decision Models

    • Georges Dupret
    Pages 2-13

  4. Cross-Lingual Text Fragment Alignment Using Divergence from Randomness

    • Sirvan Yahyaei, Marco Bonzanini, Thomas Roelleke
    Pages 14-25

  5. Enhancing Document Snippets Using Temporal Information

    • Omar Alonso, Michael Gertz, Ricardo Baeza-Yates
    Pages 26-31

  6. Spaced Seeds Design Using Perfect Rulers

    • Lavinia Egidi, Giovanni Manzini
    Pages 32-43

  7. Weighted Shortest Common Supersequence

    • Amihood Amir, Zvi Gotthilf, B. Riva Shalom
    Pages 44-54

  8. Approximate Regular Expression Matching with Multi-strings

    • Djamal Belazzougui, Mathieu Raffinot
    Pages 55-66

  9. Persistency in Suffix Trees with Applications to String Interval Problems

    • Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat
    Pages 67-80

  10. Approximate Point Set Pattern Matching with L p -Norm

    • Hung-Lung Wang, Kuan-Yu Chen
    Pages 81-86

  11. Detecting Health Events on the Social Web to Enable Epidemic Intelligence

    • Marco Fisichella, Avaré Stewart, Alfredo Cuzzocrea, Kerstin Denecke
    Pages 87-103

  12. A Learned Approach for Ranking News in Real-Time Using the Blogosphere

    • Richard McCreadie, Craig Macdonald, Iadh Ounis
    Pages 104-116

  13. Attribute Retrieval from Relational Web Tables

    • Arlind Kopliku, Karen Pinel-Sauvagnat, Mohand Boughanem
    Pages 117-128

  14. Query-Sets + + : A Scalable Approach for Modeling Web Sites

    • Barbara Poblete, Myra Spiliopoulou, Marcelo Mendoza
    Pages 129-134

  15. Indexing with Gaps

    • Moshe Lewenstein
    Pages 135-143

  16. Fast Computation of a String Duplication History under No-Breakpoint-Reuse

    • Broňa Brejová, Gad M. Landau, Tomáš Vinař
    Pages 144-155

  17. Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem

    • Dany Breslauer, Giuseppe F. Italiano
    Pages 156-167

  18. Approximations and Partial Solutions for the Consensus Sequence Problem

    • Amihood Amir, Haim Paryenty, Liam Roditty
    Pages 168-173

  19. Fixed Block Compression Boosting in FM-Indexes

    • Juha Kärkkäinen, Simon J. Puglisi
    Pages 174-184

  20. Space Efficient Wavelet Tree Construction

    • Francisco Claude, Patrick K. Nicholson, Diego Seco
    Pages 185-196
Back to top

Other volumes

  1. String Processing and Information Retrieval

Keywords

About this book

This book constitutes the proceedings of the 18th International Symposium on String Processing and Information Retrieval, SPIRE 2011, held in Pisa, Italy, in October 2011. The 30 long and 10 short papers together with 1 keynote presented were carefully reviewed and selected from 102 submissions. The papers are structured in topical sections on introduction to web retrieval, sequence learning, computational geography, space-efficient data structures, algorithmic analysis of biological data, compression, text and algorithms.

Editors and Affiliations

  • Università di Pisa, Italy

    Roberto Grossi

  • Consiglio Nazionale delle Ricerche, Area della Ricerca di Pisa, Istituto di Scienza e Tecnologia dell’Informazione “Alessandro Faedo”, Pisa, Italy

    Fabrizio Sebastiani, Fabrizio Silvestri

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation