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.
Mendeley readers
Chapter title |
Persistency in Suffix Trees with Applications to String Interval Problems
|
---|---|
Chapter number | 8 |
Book title |
String Processing and Information Retrieval
|
Published in |
Lecture notes in computer science, January 2011
|
DOI | 10.1007/978-3-642-24583-1_8 |
Book ISBNs |
978-3-64-224582-4, 978-3-64-224583-1
|
Authors |
Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
Editors |
Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Colombia | 1 | 14% |
Russia | 1 | 14% |
Poland | 1 | 14% |
Unknown | 4 | 57% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 29% |
Librarian | 1 | 14% |
Professor | 1 | 14% |
Student > Master | 1 | 14% |
Researcher | 1 | 14% |
Other | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 71% |
Engineering | 1 | 14% |
Unknown | 1 | 14% |