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 |
Computing Longest Common Substrings Via Suffix Arrays
|
---|---|
Chapter number | 10 |
Book title |
Computer Science – Theory and Applications
|
Published in |
Proc. Computer Science in Russia Symposium, January 2008
|
DOI | 10.1007/978-3-540-79709-8_10 |
Book ISBNs |
978-3-54-079708-1, 978-3-54-079709-8
|
Authors |
Maxim A. Babenko, Tatiana A. Starikovskaya, Babenko, Maxim A., Starikovskaya, Tatiana A. |
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 % |
---|---|---|
Japan | 1 | 14% |
Denmark | 1 | 14% |
Unknown | 5 | 71% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 43% |
Student > Postgraduate | 2 | 29% |
Student > Bachelor | 1 | 14% |
Professor > Associate Professor | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 43% |
Agricultural and Biological Sciences | 1 | 14% |
Physics and Astronomy | 1 | 14% |
Medicine and Dentistry | 1 | 14% |
Unknown | 1 | 14% |