NOTE: This repository is not maintained anymore. I can only try to resolve/answer easy issues/questions. I may not have the time to do extensive debugging. If there is any issue or bug you found and fixed, please submit a pull request, I’ll try my best to review then add it into the code base. Thanks!
Introduction
LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.
The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE, http://www.expasy.org/prosite/) to locate cores of important enzymes if they occur. Then possible ORFs are constructed based on that. At last, the program reports possible LTR retrotransposon models in different confidence levels according to how many signals and domains they hit.
Installation
cd source
make
Add the current path to PATH:
```echo "export PATH=\PATH:$PWD” >> ~/.bashrc```
Xu, Zhao, and Hao Wang. “LTR_FINDER: an efficient tool for the prediction of full-length LTR retrotransposons.” Nucleic Acids Research 35, suppl. 2 (2007): W265-W268.
LTR_Finder
NOTE: This repository is not maintained anymore. I can only try to resolve/answer easy issues/questions. I may not have the time to do extensive debugging. If there is any issue or bug you found and fixed, please submit a pull request, I’ll try my best to review then add it into the code base. Thanks!
Introduction
LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.
The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then Smith-Waterman algorithm is used to adjust the ends of LTR pair candidates to get alignment boundaries. These boundaries are subject to re-adjustment using supporting information of TG..CA box and TSRs and reliable LTRs are selected. Next, LTR_FINDER tries to identify PBS, PPT and RT inside LTR pairs by build-in aligning and counting modules. RT identification includes a dynamic programming to process frame shift. For other protein domains, LTR_FINDER calls ps_scan (from PROSITE, http://www.expasy.org/prosite/) to locate cores of important enzymes if they occur. Then possible ORFs are constructed based on that. At last, the program reports possible LTR retrotransposon models in different confidence levels according to how many signals and domains they hit.
Installation
cd sourcemakeUsage
Reference
Xu, Zhao, and Hao Wang. “LTR_FINDER: an efficient tool for the prediction of full-length LTR retrotransposons.” Nucleic Acids Research 35, suppl. 2 (2007): W265-W268.