Optimal gene trees from sequences and species trees using a soft interpretation of parsimony

Berglund-Sonnhammer, Ann-Charlotte (author): Uppsala universitet,Centrum för bioinformatik

Steffansson, Pär (author)

Betts, Matthew J. (author)

Liberles, David A. (author)

(creator_code:org_t)

2006-07-07
2006
English.
In: Journal of Molecular Evolution. - : Springer Science and Business Media LLC. - 0022-2844 .- 1432-1432. ; 63:2, s. 240-250

Related links:: https://urn.kb.se/re...; show more...; https://doi.org/10.1...; show less...

Abstract Subject headings

Gene duplication and gene loss as well as other biological events can result in multiple copies of genes in a given species. Because of these gene duplication and loss dynamics, in addition to variation in sequence evolution and other sources of uncertainty, different gene trees ultimately present different evolutionary histories. All of this together results in gene trees that give different topologies from each other, making consensus species trees ambiguous in places. Other sources of data to generate species trees are also unable to provide completely resolved binary species trees. However, in addition to gene duplication events, speciation events have provided some underlying phylogenetic signal, enabling development of algorithms to characterize these processes. Therefore, a soft parsimony algorithm has been developed that enables the mapping of gene trees onto species trees and modification of uncertain or weakly supported branches based on minimizing the number of gene duplication and loss events implied by the tree. The algorithm also allows for rooting of unrooted trees and for removal of in-paralogues (lineage-specific duplicates and redundant sequences masquerading as such). The algorithm has also been made available for download as a software package, Softparsmap.

By the author/editor: Berglund-Sonnham ...; Steffansson, Pär; Betts, Matthew J ...; Liberles, David ...

About the subject

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.