TE-nester: a recursive software tool for structure-based discovery of nested transposable elements
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68081707%3A_____%2F18%3A00503226" target="_blank" >RIV/68081707:_____/18:00503226 - isvavai.cz</a>
Výsledek na webu
<a href="https://ieeexplore.ieee.org/document/8621071" target="_blank" >https://ieeexplore.ieee.org/document/8621071</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/BIBM.2018.8621071" target="_blank" >10.1109/BIBM.2018.8621071</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
TE-nester: a recursive software tool for structure-based discovery of nested transposable elements
Popis výsledku v původním jazyce
Eukaryotic genomes are generally rich in repetitive sequences. LTR retrotransposons are the most abundant class of repetitive sequences in plant genomes. They form segments of genomic sequences that accumulate via individual events and bursts of retrotransposition. A limited number of tools exist that can identify fragments of repetitive sequences that likely originate from a longer, originally unfragmented element, using mostly sequence similarity to guide reconstruction of fragmented sequences. Here, we use a slightly different approach based on structural (as opposed to sequence similarity) detection of unfragmented full-length elements, which are then recursively eliminated from the analyzed sequence to repeatedly uncover unfragmented copies hidden underneath more recent insertions. This approach has the potential to detect relatively old and highly fragmented copies. We created a software tool for this kind of analysis called TE-nester and applied it to a number of assembled plant genomes to discover pairs of nested LTR retrotransposons of various age and fragmentation state. TE-nester will allow us to test hypotheses about genome evolution, TE life cycle and insertion history. The software, still under improvement, is available for download from a repository at https://gitlab.fi.muni.cz/lexa/nested.
Název v anglickém jazyce
TE-nester: a recursive software tool for structure-based discovery of nested transposable elements
Popis výsledku anglicky
Eukaryotic genomes are generally rich in repetitive sequences. LTR retrotransposons are the most abundant class of repetitive sequences in plant genomes. They form segments of genomic sequences that accumulate via individual events and bursts of retrotransposition. A limited number of tools exist that can identify fragments of repetitive sequences that likely originate from a longer, originally unfragmented element, using mostly sequence similarity to guide reconstruction of fragmented sequences. Here, we use a slightly different approach based on structural (as opposed to sequence similarity) detection of unfragmented full-length elements, which are then recursively eliminated from the analyzed sequence to repeatedly uncover unfragmented copies hidden underneath more recent insertions. This approach has the potential to detect relatively old and highly fragmented copies. We created a software tool for this kind of analysis called TE-nester and applied it to a number of assembled plant genomes to discover pairs of nested LTR retrotransposons of various age and fragmentation state. TE-nester will allow us to test hypotheses about genome evolution, TE life cycle and insertion history. The software, still under improvement, is available for download from a repository at https://gitlab.fi.muni.cz/lexa/nested.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Ostatní
Rok uplatnění
2018
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
Proceedings 2018 IEEE International Conference on Bioinformatics and Biomedecine (BIBM)
ISSN
2156-1125
e-ISSN
—
Svazek periodika
2018
Číslo periodika v rámci svazku
2018
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
3
Strana od-do
2776-2778
Kód UT WoS článku
000458654000484
EID výsledku v databázi Scopus
2-s2.0-85062481735