LTR_FINDER_parallel: parallelization of LTR_FINDER enabling rapid identification of long terminal repeat retrotransposons
preprint
OA: closed
CC-BY-4.0
Abstract
Summary Annotation 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. Availability LTR_FINDER_parallel is freely available at https://github.com/oushujun/LTR_FINDER_parallel . Contact [email protected]
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-24T02:00:01.246996+00:00
License: CC-BY-4.0