This is a Perl wrapper for LTR_FINEDR. All rights reserved to the original author. Both LTR_FINDER and LTR_FINDER_parallel are released under the MIT License.
Installation: No need. Just download and run.
Usage: perl LTR_FINDER_parallel -seq [file] -size [int] -overlap [int] -threads [int]
Options:
-seq [file] Specify the sequence file.
-size [int] Specify the size you want to split the genome sequence.
Please make it large enough to avoid spliting too many LTR elements. Default 5000000 (bp).
-overlap [int] Specify the overlapping size for each split piece. Default 100000 (bp)
-time [int] Specify the maximum time to run a subregion (a thread).
This helps to skip simple repeat regions that take a substantial of time to run. Default: 120 (seconds).
Increase -time when -size increased.
-try1 [0|1] If a region requires more time than the specified -time (timeout), decide:
0, discard the entire region.
1, further split to 50 Kb regions to salvage LTR candidates (default);
-harvest_out Output LTRharvest format if specified. Default: output LTR_FINDER table format.
-next Only summarize the results for previous jobs without rerunning LTR_FINDER (for -v).
-verbose|-v Retain LTR_FINDER outputs for each sequence piece.
-finder [file] The path to the program LTR_FINDER (default v1.0.7, included in this package).
-threads|-t [int] Indicate how many CPU/threads you want to run LTR_FINDER.
-check_dependencies Check if dependencies are fullfiled and quit
-help|-h Display this help information.
Input
Genome file in multi-FASTA format.
Output
GFF3, LTRharvest (STDOUT) or LTR_FINDER (-w 2) formats of predicted LTR candidates.
Parameter setting for LTR_FINDER
Currently there is no parameter settings for LTR_FINDER in this parallel version. I have chose the “best” parameters for you:
Please refer to LTR_FINEDR for details of these parameters.
If you want to use other parameters in LTR_FINDER_parallel, please edit the file LTR_FINDER_parallel line 9 to change the preset parameters.
Performance benchmark
Genome
Arabidopsis
Rice
Maize
Wheat
Version
TAIR10
MSU7
AGPv4
CS1.0
Size
119.7 Mb
374.5 Mb
2134.4 Mb
14547.3 Mb
Original memory (1 CPU*)
0.37 Gbyte
0.55 Gbyte
5.00 Gbyte
11.88 Gbyte
Parallel memory (36 CPUs*)
0.10 Gbyte
0.12 Gbyte
0.82 Gbyte
17.67 Gbyte
Original time (1 CPU)
0.58 h
2.1 h
448.5 h
10169.3 h
Parallel time (36 CPUs)
6.4 min
2.6 min
10.3 min
71.8 min
Speed up
5.4 x
48.5 x
2,613 x
8,498 x
Number of LTR candidates (original)
226
2,851
60,165
231,043
Number of LTR candidates (parallel)
229
2,870
60,597
242,421
Extra candidates by parallel**
1.33%
0.67%
0.72%
4.93%
*Intel(R) Xeon(R) CPU E5-2660 v4 @ 2.00GHz **Likely due to local search optimization in the small chunk of sequences
Citation
If you find LTR_FINDER_parallel helpful, please cite this manuscript:
Ou S, Jiang N. LTR_FINDER_parallel: parallelization of LTR_FINDER enabling rapid identification of long terminal repeat retrotransposons. Mob DNA 2019;10(1):48.
FAQs and best practices
How to generate output files for LTR_retriever? A: You can use the -harvest_out parameter to generate LTRharvest-format output, then feed to LTR_retriever using -inharvest. If you have more than one LTRharvest output, simply cat them together.
How to prepare the genome file? A: It’s highly recommended to use short and simple sequence names. For example, use letters, numbers, and _ to generate unique names shorter than 15 bits. This will make your downstream analyses much more easier. If you have delicate sequence names and encounter errors, you may want to simplify them and try again. The program will automatically shortern the sequence ID by just keeping the string before the first space.
Do I really need to modify the -size, -time, and -try1 parameters? A: Not really. Except when you are 100% sure what you are doing, these parameters are optimized for the best performance in general.
Issues
For any other issues please open a thread and I will be happy to help.
~ ~ ~ Run LTR_FINDER in parallel ~ ~ ~
This is a Perl wrapper for LTR_FINEDR. All rights reserved to the original author. Both LTR_FINDER and LTR_FINDER_parallel are released under the MIT License.
Installation: No need. Just download and run.
Input
Genome file in multi-FASTA format.
Output
GFF3, LTRharvest (STDOUT) or LTR_FINDER (-w 2) formats of predicted LTR candidates.
Parameter setting for LTR_FINDER
Currently there is no parameter settings for LTR_FINDER in this parallel version. I have chose the “best” parameters for you:
Please refer to LTR_FINEDR for details of these parameters.
If you want to use other parameters in LTR_FINDER_parallel, please edit the file
LTR_FINDER_parallelline 9 to change the preset parameters.Performance benchmark
*Intel(R) Xeon(R) CPU E5-2660 v4 @ 2.00GHz
**Likely due to local search optimization in the small chunk of sequences
Citation
If you find LTR_FINDER_parallel helpful, please cite this manuscript:
Ou S, Jiang N. LTR_FINDER_parallel: parallelization of LTR_FINDER enabling rapid identification of long terminal repeat retrotransposons. Mob DNA 2019;10(1):48.
FAQs and best practices
How to generate output files for LTR_retriever?
A: You can use the
-harvest_outparameter to generateLTRharvest-format output, then feed toLTR_retrieverusing-inharvest. If you have more than oneLTRharvestoutput, simplycatthem together.How to prepare the genome file?
A: It’s highly recommended to use short and simple sequence names. For example, use letters, numbers, and _ to generate unique names shorter than 15 bits. This will make your downstream analyses much more easier. If you have delicate sequence names and encounter errors, you may want to simplify them and try again. The program will automatically shortern the sequence ID by just keeping the string before the first space.
Do I really need to modify the
-size,-time, and-try1parameters?A: Not really. Except when you are 100% sure what you are doing, these parameters are optimized for the best performance in general.
Issues
For any other issues please open a thread and I will be happy to help.