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 |
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
|
---|---|
Chapter number | 16 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Berlin, Heidelberg, July 2004
|
DOI | 10.1007/978-3-540-27801-6_16 |
Book ISBNs |
978-3-54-022341-2, 978-3-54-027801-6
|
Authors |
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Dessmark, Anders, Jansson, Jesper, Lingas, Andrzej, Lundell, Eva-Marta |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Spain | 1 | 17% |
Italy | 1 | 17% |
Unknown | 4 | 67% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 33% |
Professor | 1 | 17% |
Professor > Associate Professor | 1 | 17% |
Researcher | 1 | 17% |
Unknown | 1 | 17% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 4 | 67% |
Agricultural and Biological Sciences | 1 | 17% |
Unknown | 1 | 17% |