↓ Skip to main content

String Processing and Information Retrieval

Overview of attention for book
Cover of 'String Processing and Information Retrieval'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Querying the Web Graph
  3. Altmetric Badge
    Chapter 2 Incremental Algorithms for Effective and Efficient Query Recommendation
  4. Altmetric Badge
    Chapter 3 Fingerprinting Ratings for Collaborative Filtering — Theoretical and Empirical Analysis
  5. Altmetric Badge
    Chapter 4 On Tag Spell Checking
  6. Altmetric Badge
    Chapter 5 Compressed Self-indices Supporting Conjunctive Queries on Document Collections
  7. Altmetric Badge
    Chapter 6 String Retrieval for Multi-pattern Queries
  8. Altmetric Badge
    Chapter 7 Colored Range Queries and Document Retrieval
  9. Altmetric Badge
    Chapter 8 Range Queries over Untangled Chains
  10. Altmetric Badge
    Chapter 9 Multiplication Algorithms for Monge Matrices
  11. Altmetric Badge
    Chapter 10 Why Large Closest String Instances Are Easy to Solve in Practice
  12. Altmetric Badge
    Chapter 11 A PTAS for the Square Tiling Problem
  13. Altmetric Badge
    Chapter 12 On the Hardness of Counting and Sampling Center Strings
  14. Altmetric Badge
    Chapter 13 Counting and Verifying Maximal Palindromes
  15. Altmetric Badge
    Chapter 14 Identifying SNPs without a Reference Genome by Comparing Raw Reads
  16. Altmetric Badge
    Chapter 15 Dynamic Z-Fast Tries
  17. Altmetric Badge
    Chapter 16 Improved Fast Similarity Search in Dictionaries
  18. Altmetric Badge
    Chapter 17 Training Parse Trees for Efficient VF Coding
  19. Altmetric Badge
    Chapter 18 Algorithms for Finding a Minimum Repetition Representation of a String
  20. Altmetric Badge
    Chapter 19 Faster Compressed Dictionary Matching
  21. Altmetric Badge
    Chapter 20 Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval
  22. Altmetric Badge
    Chapter 21 Standard Deviation as a Query Hardness Estimator
  23. Altmetric Badge
    Chapter 22 Using Related Queries to Improve Web Search Results Ranking
  24. Altmetric Badge
    Chapter 23 Evaluation of Query Performance Prediction Methods by Range
  25. Altmetric Badge
    Chapter 24 Mining Large Query Induced Graphs towards a Hierarchical Query Folksonomy
  26. Altmetric Badge
    Chapter 25 Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems
  27. Altmetric Badge
    Chapter 26 Restricted LCS
  28. Altmetric Badge
    Chapter 27 Extracting Powers and Periods in a String from Its Runs Structure
  29. Altmetric Badge
    Chapter 28 On Shortest Common Superstring and Swap Permutations
  30. Altmetric Badge
    Chapter 29 A Self-Supervised Approach for Extraction of Attribute-Value Pairs from Wikipedia Articles
  31. Altmetric Badge
    Chapter 30 Temporal Analysis of Document Collections: Framework and Applications
  32. Altmetric Badge
    Chapter 31 Text Comparison Using Soft Cardinality
  33. Altmetric Badge
    Chapter 32 Hypergeometric Language Model and Zipf-Like Scoring Function for Web Document Similarity Retrieval
  34. Altmetric Badge
    Chapter 33 Dual-Sorted Inverted Lists
  35. Altmetric Badge
    Chapter 34 CST++
  36. Altmetric Badge
    Chapter 35 Succinct Representations of Dynamic Strings
  37. Altmetric Badge
    Chapter 36 Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
  38. Altmetric Badge
    Chapter 37 The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching
  39. Altmetric Badge
    Chapter 38 Parameterized Searching with Mismatches for Run-Length Encoded Strings
  40. Altmetric Badge
    Chapter 39 Fast Bit-Parallel Matching for Network and Regular Expressions
  41. Altmetric Badge
    Chapter 40 String Matching with Variable Length Gaps
  42. Altmetric Badge
    Chapter 41 Approximate String Matching with Stuck Address Bits
  43. Altmetric Badge
    Chapter 42 Erratum to: Range Queries over Untangled Chains
Attention for Chapter 37: The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching
Altmetric Badge

Mentioned by

patent
1 patent

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
17 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching
Chapter number 37
Book title
String Processing and Information Retrieval
Published by
Springer, Berlin, Heidelberg, October 2010
DOI 10.1007/978-3-642-16321-0_37
Book ISBNs
978-3-64-216320-3, 978-3-64-216321-0
Authors

Maxime Crochemore, German Tischler

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
France 2 12%
Japan 1 6%
Germany 1 6%
Unknown 13 76%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 18%
Student > Ph. D. Student 3 18%
Other 2 12%
Professor 2 12%
Professor > Associate Professor 2 12%
Other 4 24%
Unknown 1 6%
Readers by discipline Count As %
Computer Science 11 65%
Agricultural and Biological Sciences 2 12%
Biochemistry, Genetics and Molecular Biology 1 6%
Pharmacology, Toxicology and Pharmaceutical Science 1 6%
Sports and Recreations 1 6%
Other 0 0%
Unknown 1 6%