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 |
Algorithms for Computing Variants of the Longest Common Subsequence Problem
|
---|---|
Chapter number | 41 |
Book title |
Algorithms and Computation
|
Published by |
Springer, Berlin, Heidelberg, December 2006
|
DOI | 10.1007/11940128_41 |
Book ISBNs |
978-3-54-049694-6, 978-3-54-049696-0
|
Authors |
M. Sohel Rahman, Costas S. Iliopoulos, Rahman, M. Sohel, Iliopoulos, Costas S. |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 1 | 50% |
Student > Bachelor | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Unknown | 1 | 50% |