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 |
Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths
|
---|---|
Chapter number | 11 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Berlin, Heidelberg, July 2012
|
DOI | 10.1007/978-3-642-31265-6_11 |
Book ISBNs |
978-3-64-231264-9, 978-3-64-231265-6
|
Authors |
Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette, Blin, Guillaume, Bulteau, Laurent, Jiang, Minghui, Tejada, Pedro J., Vialette, Stéphane |
Mendeley readers
The data shown below were compiled from readership statistics for 10 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 10 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 3 | 30% |
Professor | 2 | 20% |
Student > Ph. D. Student | 2 | 20% |
Researcher | 2 | 20% |
Unknown | 1 | 10% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 7 | 70% |
Mathematics | 1 | 10% |
Agricultural and Biological Sciences | 1 | 10% |
Unknown | 1 | 10% |