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 |
Identifying Approximate Palindromes in Run-Length Encoded Strings
|
---|---|
Chapter number | 29 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2010
|
DOI | 10.1007/978-3-642-17514-5_29 |
Book ISBNs |
978-3-64-217513-8, 978-3-64-217514-5
|
Authors |
Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao, Chen, Kuan-Yu, Hsu, Ping-Hui, Chao, Kun-Mao |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |