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 |
Parallel Computation for the All-Pairs Suffix-Prefix Problem
|
|---|---|
| Chapter number | 12 |
| Book title |
String Processing and Information Retrieval
|
| Published in |
Lecture notes in computer science, September 2016
|
| DOI | 10.1007/978-3-319-46049-9_12 |
| Book ISBNs |
978-3-31-946048-2, 978-3-31-946049-9
|
| Authors |
Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 6 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor | 3 | 50% |
| Researcher | 1 | 17% |
| Student > Postgraduate | 1 | 17% |
| Student > Master | 1 | 17% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 3 | 50% |
| Engineering | 1 | 17% |
| Unknown | 2 | 33% |