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 the Longest Parameterized Common Subsequence
|
---|---|
Chapter number | 27 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Berlin, Heidelberg, July 2007
|
DOI | 10.1007/978-3-540-73437-6_27 |
Book ISBNs |
978-3-54-073436-9, 978-3-54-073437-6
|
Authors |
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Waleń, Iliopoulos, Costas S., Kubica, Marcin, Rahman, M. Sohel, Waleń, Tomasz |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
France | 1 | 20% |
Unknown | 4 | 80% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 40% |
Student > Ph. D. Student | 2 | 40% |
Professor | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 80% |
Unknown | 1 | 20% |