Publication details

TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting

Authors

LEXA Matej JEDLICKA Pavel VANÁT Ivan ČERVEŇANSKÝ Michal KEJNOVSKÝ Eduard

Year of publication 2020
Type Article in Periodical
Magazine / Source Bioinformatics
MU Faculty or unit

Faculty of Informatics

Citation
Web https://academic.oup.com/bioinformatics/article/36/20/4991/5871348
Doi http://dx.doi.org/10.1093/bioinformatics/btaa632
Keywords TRANSPOSABLE ELEMENTS; VISUALIZATION; ANNOTATION; IDENTIFICATION; PALEONTOLOGY; PROGRAM; SEARCH; FINDER; TENEST
Description Transposable elements (TEs) in eukaryotes often get inserted into one another, forming sequences that become a complex mixture of full-length elements and their fragments. The reconstruction of full-length elements and the order in which they have been inserted is important for genome and transposon evolution studies. However, the accumulation of mutations and genome rearrangements over evolutionary time makes this process error-prone and decreases the efficiency of software aiming to recover all nested full-length TEs. We created software that uses a greedy recursive algorithm to mine increasingly fragmented copies of full-length LTR retrotransposons in assembled genomes and other sequence data. The software called TE-greedy-nester considers not only sequence similarity but also the structure of elements. This new tool was tested on a set of natural and synthetic sequences and its accuracy was compared to similar software. We found TE-greedy-nester to be superior in a number of parameters, namely computation time and full-length TE recovery in highly nested regions.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info