| LEXA, Matej, Pavel JEDLICKA, Ivan VANÁT, Michal ČERVEŇANSKÝ a Eduard KEJNOVSKÝ. TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting. Online. Bioinformatics. OXFORD: OXFORD UNIV PRESS, 2020, roč. 36, č. 20, s. 4991-4999. ISSN 1367-4803. Dostupné z: https://dx.doi.org/10.1093/bioinformatics/btaa632. [citováno 2024-04-24] |
Další formáty:
BibTeX
LaTeX
RIS
@article{1767956,
author = {Lexa, Matej and Jedlicka, Pavel and Vanát, Ivan and Červeňanský, Michal and Kejnovský, Eduard},
article_location = {OXFORD},
article_number = {20},
doi = {http://dx.doi.org/10.1093/bioinformatics/btaa632},
keywords = {TRANSPOSABLE ELEMENTS; VISUALIZATION; ANNOTATION; IDENTIFICATION; PALEONTOLOGY; PROGRAM; SEARCH; FINDER; TENEST},
language = {eng},
issn = {1367-4803},
journal = {Bioinformatics},
title = {TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting},
url = {https://academic.oup.com/bioinformatics/article/36/20/4991/5871348},
volume = {36},
year = {2020}
}
TY - JOUR
ID - 1767956
AU - Lexa, Matej - Jedlicka, Pavel - Vanát, Ivan - Červeňanský, Michal - Kejnovský, Eduard
PY - 2020
TI - TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting
JF - Bioinformatics
VL - 36
IS - 20
SP - 4991-4999
EP - 4991-4999
PB - OXFORD UNIV PRESS
SN - 13674803
KW - TRANSPOSABLE ELEMENTS
KW - VISUALIZATION
KW - ANNOTATION
KW - IDENTIFICATION
KW - PALEONTOLOGY
KW - PROGRAM
KW - SEARCH
KW - FINDER
KW - TENEST
UR - https://academic.oup.com/bioinformatics/article/36/20/4991/5871348
N2 - 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.
ER -
LEXA, Matej, Pavel JEDLICKA, Ivan VANÁT, Michal ČERVEŇANSKÝ a Eduard KEJNOVSKÝ. TE-greedy-nester: structure-based detection of LTR retrotransposons and their nesting. Online. \textit{Bioinformatics}. OXFORD: OXFORD UNIV PRESS, 2020, roč.~36, č.~20, s.~4991-4999. ISSN~1367-4803. Dostupné z: https://dx.doi.org/10.1093/bioinformatics/btaa632. [citováno 2024-04-24]
|
