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

Access provided by Autonomous University of Puebla

Download book PDF

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.

Buy print copy

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

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.

Similar content being viewed by others

Keywords

Table of contents (42 papers)

  1. Compression

    1. Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval

      • Shanika Kuruppu, Simon J. Puglisi, Justin Zobel
      Pages 201-206
      Download chapter PDF

  2. Querying and Search User Experience

    1. Standard Deviation as a Query Hardness Estimator

      • Joaquín Pérez-Iglesias, Lourdes Araujo
      Pages 207-212
      Download chapter PDF

    2. Using Related Queries to Improve Web Search Results Ranking

      • Georges Dupret, Ricardo Zilleruelo-Ramos, Sumio Fujita
      Pages 213-224
      Download chapter PDF

    3. Evaluation of Query Performance Prediction Methods by Range

      • Joaquín Pérez-Iglesias, Lourdes Araujo
      Pages 225-236
      Download chapter PDF

    4. Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy

      • Alexandre P. Francisco, Ricardo Baeza-Yates, Arlindo L. Oliveira
      Pages 237-242
      Download chapter PDF

  3. String Algorithms II

    1. Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems

      • Effat Farhana, Jannatul Ferdous, Tanaeem Moosa, M. Sohel Rahman
      Pages 243-249
      Download chapter PDF

    2. Restricted LCS

      • Zvi Gotthilf, Danny Hermelin, Gad M. Landau, Moshe Lewenstein
      Pages 250-257
      Download chapter PDF

    3. Extracting Powers and Periods in a String from Its Runs Structure

      • Maxime Crochemore, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
      Pages 258-269
      Download chapter PDF

    4. On Shortest Common Superstring and Swap Permutations

      • Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa
      Pages 270-278
      Download chapter PDF

  4. Document Analysis and Comparison

    1. A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles

      • Wladmir C. Brandão, Edleno S. Moura, Altigran S. Silva, Nivio Ziviani
      Pages 279-289
      Download chapter PDF

    2. Temporal Analysis of Document Collections: Framework and Applications

      • Omar Alonso, Michael Gertz, Ricardo Baeza-Yates
      Pages 290-296
      Download chapter PDF

    3. Text Comparison Using Soft Cardinality

      • Sergio Jimenez, Fabio Gonzalez, Alexander Gelbukh
      Pages 297-302
      Download chapter PDF

    4. Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval

      • Felipe Bravo-Marquez, Gaston L’Huillier, Sebastián A. Ríos, Juan D. Velásquez
      Pages 303-308
      Download chapter PDF

  5. Compressed Indexes

    1. Dual-Sorted Inverted Lists

      • Gonzalo Navarro, Simon J. Puglisi
      Pages 309-321
      Download chapter PDF

    2. CST++

      • Enno Ohlebusch, Johannes Fischer, Simon Gog
      Pages 322-333
      Download chapter PDF

    3. Succinct Representations of Dynamic Strings

      • Meng He, J. Ian Munro
      Pages 334-346
      Download chapter PDF

    4. Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes

      • Enno Ohlebusch, Simon Gog, Adrian Kügel
      Pages 347-358
      Download chapter PDF

    5. The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching

      • Maxime Crochemore, German Tischler
      Pages 359-364
      Download chapter PDF

  6. String Matching

    1. Parameterized Searching with Mismatches for Run-Length Encoded Strings

      • Alberto Apostolico, Péter L. Erdős, Alpár Jüttner
      Pages 365-371
      Download chapter PDF

    2. Fast Bit-Parallel Matching for Network and Regular Expressions

      • Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
      Pages 372-384
      Download chapter PDF
Back to top

Other volumes

  1. String Processing and Information Retrieval

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