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
| Title |
Cubic time algorithms of amalgamating gene trees and building evolutionary scenarios
|
|---|---|
| Published in |
Biology Direct, December 2012
|
| DOI | 10.1186/1745-6150-7-48 |
| Pubmed ID | |
| Authors |
Vassily A Lyubetsky, Lev I Rubanov, Leonid Y Rusin, Konstantin Yu Gorbunov |
| Abstract |
A long recognized problem is the inference of the supertree S that amalgamates a given set {G(j)} of trees G(j), with leaves in each G(j) being assigned homologous elements. We ground on an approach to find the tree S by minimizing the total cost of mappings α(j) of individual gene trees G(j) into S. Traditionally, this cost is defined basically as a sum of duplications and gaps in each α(j). The classical problem is to minimize the total cost, where S runs over the set of all trees that contain an exhaustive non-redundant set of species from all input G(j). |
Mendeley readers
The data shown below were compiled from readership statistics for 16 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| United Kingdom | 2 | 13% |
| South Africa | 1 | 6% |
| Unknown | 13 | 81% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Researcher | 7 | 44% |
| Student > Bachelor | 2 | 13% |
| Professor | 2 | 13% |
| Student > Ph. D. Student | 2 | 13% |
| Other | 1 | 6% |
| Other | 2 | 13% |
| Readers by discipline | Count | As % |
|---|---|---|
| Agricultural and Biological Sciences | 6 | 38% |
| Environmental Science | 4 | 25% |
| Computer Science | 2 | 13% |
| Social Sciences | 2 | 13% |
| Chemical Engineering | 1 | 6% |
| Other | 1 | 6% |