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 |
A Fast Longest Common Subsequence Algorithm for Similar Strings
|
---|---|
Chapter number | 7 |
Book title |
Language and Automata Theory and Applications
|
Published by |
Springer, Berlin, Heidelberg, May 2010
|
DOI | 10.1007/978-3-642-13089-2_7 |
Book ISBNs |
978-3-64-213088-5, 978-3-64-213089-2
|
Authors |
Abdullah N. Arslan |
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 % |
---|---|---|
United Kingdom | 1 | 11% |
Malaysia | 1 | 11% |
United States | 1 | 11% |
Unknown | 6 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 4 | 44% |
Student > Master | 1 | 11% |
Researcher | 1 | 11% |
Professor > Associate Professor | 1 | 11% |
Student > Postgraduate | 1 | 11% |
Other | 0 | 0% |
Unknown | 1 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 67% |
Business, Management and Accounting | 1 | 11% |
Engineering | 1 | 11% |
Unknown | 1 | 11% |