↓ 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 Constructing Strings at the Nano Scale via Staged Self-assembly
  3. Altmetric Badge
    Chapter 2 Discounted Cumulative Gain and User Decision Models
  4. Altmetric Badge
    Chapter 3 Cross-Lingual Text Fragment Alignment Using Divergence from Randomness
  5. Altmetric Badge
    Chapter 4 Enhancing Document Snippets Using Temporal Information
  6. Altmetric Badge
    Chapter 5 Spaced Seeds Design Using Perfect Rulers
  7. Altmetric Badge
    Chapter 6 Weighted Shortest Common Supersequence
  8. Altmetric Badge
    Chapter 7 Approximate Regular Expression Matching with Multi-strings
  9. Altmetric Badge
    Chapter 8 Persistency in Suffix Trees with Applications to String Interval Problems
  10. Altmetric Badge
    Chapter 9 Approximate Point Set Pattern Matching with L p -Norm
  11. Altmetric Badge
    Chapter 10 Detecting Health Events on the Social Web to Enable Epidemic Intelligence
  12. Altmetric Badge
    Chapter 11 A Learned Approach for Ranking News in Real-Time Using the Blogosphere
  13. Altmetric Badge
    Chapter 12 Attribute Retrieval from Relational Web Tables
  14. Altmetric Badge
    Chapter 13 Query-Sets + + : A Scalable Approach for Modeling Web Sites
  15. Altmetric Badge
    Chapter 14 Indexing with Gaps
  16. Altmetric Badge
    Chapter 15 Fast Computation of a String Duplication History under No-Breakpoint-Reuse
  17. Altmetric Badge
    Chapter 16 Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem
  18. Altmetric Badge
    Chapter 17 Approximations and Partial Solutions for the Consensus Sequence Problem
  19. Altmetric Badge
    Chapter 18 Fixed Block Compression Boosting in FM-Indexes
  20. Altmetric Badge
    Chapter 19 Space Efficient Wavelet Tree Construction
  21. Altmetric Badge
    Chapter 20 Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform
  22. Altmetric Badge
    Chapter 21 A Succinct Index for Hypertext
  23. Altmetric Badge
    Chapter 22 When Was It Written? Automatically Determining Publication Dates
  24. Altmetric Badge
    Chapter 23 A New Approach for Verifying URL Uniqueness in Web Crawlers
  25. Altmetric Badge
    Chapter 24 External Query Reformulation for Text-Based Image Retrieval
  26. Altmetric Badge
    Chapter 25 A Knowledge-Based Semantic Kernel for Text Classification
  27. Altmetric Badge
    Chapter 26 Compressed Text Indexing with Wildcards
  28. Altmetric Badge
    Chapter 27 Fast q-gram Mining on SLP Compressed Strings
  29. Altmetric Badge
    Chapter 28 Succinct Gapped Suffix Arrays
  30. Altmetric Badge
    Chapter 29 Finding Frequent Elements in Compressed 2D Arrays and Strings
  31. Altmetric Badge
    Chapter 30 On Suffix Extensions in Suffix Trees
  32. Altmetric Badge
    Chapter 31 COCA Filters: Co-occurrence Aware Bloom Filters
  33. Altmetric Badge
    Chapter 32 On-Line Construction of Position Heaps
  34. Altmetric Badge
    Chapter 33 Computing All Subtree Repeats in Ordered Ranked Trees
  35. Altmetric Badge
    Chapter 34 Sparse Spatial Selection for Novelty-Based Search Result Diversification
  36. Altmetric Badge
    Chapter 35 Candidate Document Retrieval for Web-Scale Text Reuse Detection
  37. Altmetric Badge
    Chapter 36 A Multi-faceted Approach to Query Intent Classification
  38. Altmetric Badge
    Chapter 37 Navigating the User Query Space
  39. Altmetric Badge
    Chapter 38 Improved Compressed Indexes for Full-Text Document Retrieval
  40. Altmetric Badge
    Chapter 39 ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing
  41. Altmetric Badge
    Chapter 40 Compressed Indexes for Aligned Pattern Matching
  42. Altmetric Badge
    Chapter 41 String Processing and Information Retrieval
Attention for Chapter 35: Candidate Document Retrieval for Web-Scale Text Reuse Detection
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
11 Mendeley
Summary Dimensions citations
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
Candidate Document Retrieval for Web-Scale Text Reuse Detection
Chapter number 35
Book title
String Processing and Information Retrieval
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-24583-1_35
Book ISBNs
978-3-64-224582-4, 978-3-64-224583-1
Authors

Matthias Hagen, Benno Stein

Editors

Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 9%
Germany 1 9%
Unknown 9 82%

Demographic breakdown

Readers by professional status Count As %
Student > Master 2 18%
Student > Postgraduate 2 18%
Student > Ph. D. Student 2 18%
Student > Doctoral Student 1 9%
Student > Bachelor 1 9%
Other 3 27%
Readers by discipline Count As %
Computer Science 10 91%
Biochemistry, Genetics and Molecular Biology 1 9%

This page is provided by Altmetric.