SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:uu-135066"
 

Search: onr:"swepub:oai:DiVA.org:uu-135066" > SPRIT :

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

SPRIT : Identifying horizontal gene transfer in rooted phylogenetic trees

Hill, Tobias (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
Nordström, Karl J V (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
Thollesson, Mikael (author)
Uppsala universitet,Institutionen för evolution, genomik och systematik,Systematisk biologi
show more...
Säfström, Tommy M (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
Vernersson, Andreas K E (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
Fredriksson, Robert (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
Schiöth, Helgi B (author)
Uppsala universitet,Institutionen för neurovetenskap,Functional Pharmacology/Funktionell Farmakologi
show less...
 (creator_code:org_t)
2010-02-13
2010
English.
In: BMC Evolutionary Biology. - : Springer Science and Business Media LLC. - 1471-2148. ; 10:1, s. 42-
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • BACKGROUND: Phylogenetic trees based on sequences from a set of taxa can be incongruent due to horizontal gene transfer (HGT). By identifying the HGT events, we can reconcile the gene trees and derive a taxon tree that adequately represents the species' evolutionary history. One HGT can be represented by a rooted Subtree Prune and Regraft (RSPR) operation and the number of RSPRs separating two trees corresponds to the minimum number of HGT events. Identifying the minimum number of RSPRs separating two trees is NP-hard, but the problem can be reduced to fixed parameter tractable. A number of heuristic and two exact approaches to identifying the minimum number of RSPRs have been proposed. This is the first implementation delivering an exact solution as well as the intermediate trees connecting the input trees. RESULTS: We present the SPR Identification Tool (SPRIT), a novel algorithm that solves the fixed parameter tractable minimum RSPR problem and its GPL licensed Java implementation. The algorithm can be used in two ways, exhaustive search that guarantees the minimum RSPR distance and a heuristic approach that guarantees finding a solution, but not necessarily the minimum one. We benchmarked SPRIT against other software in two different settings, small to medium sized trees i.e. five to one hundred taxa and large trees i.e. thousands of taxa. In the small to medium tree size setting with random artificial incongruence, SPRIT's heuristic mode outperforms the other software by always delivering a solution with a low overestimation of the RSPR distance. In the large tree setting SPRIT compares well to the alternatives when benchmarked on finding a minimum solution within a reasonable time. SPRIT presents both the minimum RSPR distance and the intermediate trees. CONCLUSIONS: When used in exhaustive search mode, SPRIT identifies the minimum number of RSPRs needed to reconcile two incongruent rooted trees. SPRIT also performs quick approximations of the minimum RSPR distance, which are comparable to, and often better than, purely heuristic solutions. Put together, SPRIT is an excellent tool for identification of HGT events and pinpointing which taxa have been involved in HGT.

Subject headings

NATURVETENSKAP  -- Biologi (hsv//swe)
NATURAL SCIENCES  -- Biological Sciences (hsv//eng)

Keyword

Biology
Biologi

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

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.

 
pil uppåt Close

Copy and save the link in order to return to this view