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 Substring and All Palindromes from Compressed Strings
|
---|---|
Chapter number | 31 |
Book title |
SOFSEM 2008: Theory and Practice of Computer Science
|
Published by |
Springer, Berlin, Heidelberg, January 2008
|
DOI | 10.1007/978-3-540-77566-9_31 |
Book ISBNs |
978-3-54-077565-2, 978-3-54-077566-9
|
Authors |
Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto, Matsubara, Wataru, Inenaga, Shunsuke, Ishino, Akira, Shinohara, Ayumi, Nakamura, Tomoyuki, Hashimoto, Kazuo |
Mendeley readers
The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Japan | 1 | 11% |
Unknown | 8 | 89% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 22% |
Lecturer > Senior Lecturer | 1 | 11% |
Other | 1 | 11% |
Student > Doctoral Student | 1 | 11% |
Lecturer | 1 | 11% |
Other | 2 | 22% |
Unknown | 1 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 78% |
Agricultural and Biological Sciences | 1 | 11% |
Unknown | 1 | 11% |