↓ Skip to main content
What is this page? Embed badge

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 RLZAP: Relative Lempel-Ziv with Adaptive Pointers
  3. Altmetric Badge
    Chapter 2 A Linear-Space Algorithm for the Substring Constrained Alignment Problem
  4. Altmetric Badge
    Chapter 3 Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
  5. Altmetric Badge
    Chapter 4 The Smallest Grammar Problem Revisited
  6. Altmetric Badge
    Chapter 5 Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
  7. Altmetric Badge
    Chapter 6 Parallel Lookups in String Indexes
  8. Altmetric Badge
    Chapter 7 Fast Classification of Protein Structures by an Alignment-Free Kernel
  9. Altmetric Badge
    Chapter 8 XBWT Tricks
  10. Altmetric Badge
    Chapter 9 Maximal Unbordered Factors of Random Strings
  11. Altmetric Badge
    Chapter 10 Fragmented BWT: An Extended BWT for Full-Text Indexing
  12. Altmetric Badge
    Chapter 11 AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching
  13. Altmetric Badge
    Chapter 12 Parallel Computation for the All-Pairs Suffix-Prefix Problem
  14. Altmetric Badge
    Chapter 13 Dynamic and Approximate Pattern Matching in 2D
  15. Altmetric Badge
    Chapter 14 Fully Dynamic de Bruijn Graphs
  16. Altmetric Badge
    Chapter 15 Bookmarks in Grammar-Compressed Strings
  17. Altmetric Badge
    Chapter 16 Analyzing Relative Lempel-Ziv Reference Construction
  18. Altmetric Badge
    Chapter 17 Inverse Range Selection Queries
  19. Altmetric Badge
    Chapter 18 Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
  20. Altmetric Badge
    Chapter 19 Efficient Representation of Multidimensional Data over Hierarchical Domains
  21. Altmetric Badge
    Chapter 20 LCP Array Construction Using O(sort(n)) (or Less) I/Os
  22. Altmetric Badge
    Chapter 21 GraCT: A Grammar Based Compressed Representation of Trajectories
  23. Altmetric Badge
    Chapter 22 Lexical Matching of Queries and Ads Bid Terms in Sponsored Search
  24. Altmetric Badge
    Chapter 23 Compact Trip Representation over Networks
  25. Altmetric Badge
    Chapter 24 Longest Common Abelian Factors and Large Alphabets
  26. Altmetric Badge
    Chapter 25 Pattern Matching for Separable Permutations
Attention for Chapter 18: Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
Altmetric Badge

Readers on

mendeley
3 Mendeley
Summary
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
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
Chapter number 18
Book title
String Processing and Information Retrieval
Published in
Lecture notes in computer science, September 2016
DOI 10.1007/978-3-319-46049-9_18
Book ISBNs
978-3-31-946048-2, 978-3-31-946049-9
Authors

German Tischler

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 1 33%
Unknown 2 67%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 33%
Researcher 1 33%
Student > Master 1 33%
Readers by discipline Count As %
Computer Science 2 67%
Unknown 1 33%

This page is provided by Altmetric.