LTR_FINDER_parallel: parallelization of LTR_FINDER enabling rapid identification of long terminal repeat retrotransposons
In: Mobile DNA, Jg. 10 (2019), Heft 1, S. 1-3
Online
unknown
Zugriff:
SummaryAnnotation of plant genomes is still a challenging task due to the abundance of repetitive sequences, especially long terminal repeat (LTR) retrotransposons. LTR_FINDER is a widely used program for identification of LTR retrotransposons but its application on large genomes is hindered by its single threaded processes. Here we report an accessory program that allows parallel operation of LTR_FINDER, resulting up to 8,500X faster identification of LTR elements. It takes only 72 minutes to process the 14.5 Gb bread wheat (Triticum aestivum) genome in comparison to 1.16 years required by the original sequential version.AvailabilityLTR_FINDER_parallel is freely available at https://github.com/oushujun/LTR_FINDER_parallel.Contactjiangn@msu.edu
| Titel: |
LTR_FINDER_parallel: parallelization of LTR_FINDER enabling rapid identification of long terminal repeat retrotransposons
|
|---|---|
| Autor/in / Beteiligte Person: | Ou, Shujun ; Jiang, Ning |
| Link: | |
| Zeitschrift: | Mobile DNA, Jg. 10 (2019), Heft 1, S. 1-3 |
| Veröffentlichung: | Springer Science and Business Media LLC, 2019 |
| Medientyp: | unknown |
| ISSN: | 1759-8753 (print) |
| DOI: | 10.1186/s13100-019-0193-0 |
| Schlagwort: |
|
| Sonstiges: |
|