↓ Skip to main content

Gene tree parsimony for incomplete gene trees: addressing true biological loss

Overview of attention for article published in Algorithms for Molecular Biology, January 2018
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (70th percentile)
  • Above-average Attention Score compared to outputs of the same age and source (57th percentile)

Mentioned by

twitter
8 X users

Citations

dimensions_citation
28 Dimensions

Readers on

mendeley
1 Mendeley
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.
Title
Gene tree parsimony for incomplete gene trees: addressing true biological loss
Published in
Algorithms for Molecular Biology, January 2018
DOI 10.1186/s13015-017-0120-1
Pubmed ID
Authors

Md Shamsuzzoha Bayzid, Tandy Warnow

Abstract

Species tree estimation from gene trees can be complicated by gene duplication and loss, and "gene tree parsimony" (GTP) is one approach for estimating species trees from multiple gene trees. In its standard formulation, the objective is to find a species tree that minimizes the total number of gene duplications and losses with respect to the input set of gene trees. Although much is known about GTP, little is known about how to treat inputs containing some incomplete gene trees (i.e., gene trees lacking one or more of the species). We present new theory for GTP considering whether the incompleteness is due to gene birth and death (i.e., true biological loss) or taxon sampling, and present dynamic programming algorithms that can be used for an exact but exponential time solution for small numbers of taxa, or as a heuristic for larger numbers of taxa. We also prove that the "standard" calculations for duplications and losses exactly solve GTP when incompleteness results from taxon sampling, although they can be incorrect when incompleteness results from true biological loss. The software for the DP algorithm is freely available as open source code at https://github.com/smirarab/DynaDup.

X Demographics

X Demographics

The data shown below were collected from the profiles of 8 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 100%
Readers by discipline Count As %
Unknown 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 5. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 21 January 2018.
All research outputs
#6,481,967
of 23,577,761 outputs
Outputs from Algorithms for Molecular Biology
#57
of 251 outputs
Outputs of similar age
#130,372
of 444,090 outputs
Outputs of similar age from Algorithms for Molecular Biology
#3
of 7 outputs
Altmetric has tracked 23,577,761 research outputs across all sources so far. This one has received more attention than most of these and is in the 72nd percentile.
So far Altmetric has tracked 251 research outputs from this source. They receive a mean Attention Score of 3.3. This one has done well, scoring higher than 76% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 444,090 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 70% of its contemporaries.
We're also able to compare this research output to 7 others from the same source and published within six weeks on either side of this one. This one has scored higher than 4 of them.