Skip to main content
SpringerLink
Log in

String Processing and Information Retrieval

14th International Symposium, SPIRE 2007 Santiago, Chile, October 29-31, 2007 Proceedings

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Nivio Ziviani
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ricardo Baeza-Yates
    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 4726)

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

Included in the following conference series:

Conference proceedings info: SPIRE 2007.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Keywords

Table of contents (27 papers)

  1. Front Matter

    Download chapter PDF

  2. A Chaining Algorithm for Mapping cDNA Sequences to Multiple Genomic Sequences

    • Mohamed Abouelhoda
    Pages 1-13

  3. Edge-Guided Natural Language Text Compression

    • Joaquín Adiego, Miguel A. Martínez-Prieto, Pablo de la Fuente
    Pages 14-25

  4. Local Transpositions in Alignment of Polyphonic Musical Sequences

    • Julien Allali, Pascal Ferraro, Pierre Hanna, Costas Iliopoulos
    Pages 26-38

  5. Efficient Computations of ℓ1 and ℓ ∞  Rearrangement Distances

    • Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat
    Pages 39-49

  6. Generalized LCS

    • Amihood Amir, Tzvika Hartman, Oren Kapah, B. Riva Shalom, Dekel Tsur
    Pages 50-61

  7. Exploiting Genre in Focused Crawling

    • Guilherme T. de Assis, Alberto H. F. Laender, Marcos André Gonçalves, Altigran S. da Silva
    Pages 62-73

  8. Admission Policies for Caches of Search Engine Results

    • Ricardo Baeza-Yate, Flavio Junqueira, Vassilis Plachouras, Hans Friedrich Witschel
    Pages 74-85

  9. A Pocket Guide to Web History

    • Klaus Berberich, Srikanta Bedathur, Gerhard Weikum
    Pages 86-97

  10. Jump-Matching with Errors

    • Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat
    Pages 98-106

  11. Estimating Number of Citations Using Author Reputation

    • Carlos Castillo, Debora Donato, Aristides Gionis
    Pages 107-117

  12. A Fast and Compact Web Graph Representation

    • Francisco Claude, Gonzalo Navarro
    Pages 118-129

  13. A Filtering Algorithm for k-Mismatch with Don’t Cares

    • Raphaël Clifford, Ely Porat
    Pages 130-136

  14. Compact Set Representation for Information Retrieval

    • J. Shane Culpepper, Alistair Moffat
    Pages 137-148

  15. Approximate Swap and Mismatch Edit Distance

    • Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur
    Pages 149-163

  16. Approximating Constrained LCS

    • Zvi Gotthilf, Moshe Lewenstein
    Pages 164-172

  17. Tuning Approximate Boyer-Moore for Gene Sequences

    • Petri Kalsi, Leena Salmela, Jorma Tarhio
    Pages 173-183

  18. Optimal Self-adjusting Trees for Dynamic String Data in Secondary Storage

    • Pang Ko, Srinivas Aluru
    Pages 184-194

  19. Indexing a Dictionary for Subset Matching Queries

    • Gad M. Landau, Dekel Tsur, Oren Weimann
    Pages 195-204

  20. Extending Weighting Models with a Term Quality Measure

    • Christina Lioma, Iadh Ounis
    Pages 205-216
Back to top

Other volumes

  1. String Processing and Information Retrieval

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation