- Technical Note
- Open Access
Expedited batch processing and analysis of transposon insertions
© Ray et al; licensee BioMed Central Ltd. 2011
- Received: 7 June 2011
- Accepted: 4 November 2011
- Published: 4 November 2011
With advances in sequencing technology, greater and greater amounts of eukaryotic genome data are becoming available. Often, large portions of these genomes consist of transposable elements, frequently accounting for 50% or more in vertebrates. Each transposable element family may have thousands or tens of thousands of individual copies within a given genome, and therefore it can take an exorbitant amount of time and effort to process data in a meaningful fashion.
In order to combat this problem, we developed a set of bioinformatics techniques and programs to streamline the analysis. This includes a unique Perl script which automates the process of taking BLAST, Repeatmasker and similar data to extract and manipulate the hit sequences from the genome. This script, called Process_hits uses an object-oriented methodology to compile all hit locations from a given file for processing, organize this data into useable categories, and output it in multiple formats.
The program proved capable of handling large amounts of transposon data in an efficient fashion. It is equipped with a number of useful sub-functions, each of which is contained within its own sub-module to allow for greater expandability and as a foundation for future program design.
- Transposable Element
- FASTA File
- Transposable Element Sequence
- Transposable Element Family
- Efficient Fashion
Modern sequencing methods have resulted in a tremendous increase in the amount of genomic sequence data available. For example, as of this paper, the NCBI Entrez Genome Project database contains ~400 eukaryotic genomes that have been completed or are in the process of being assembled . Most of these genomes consist of large transposable element (TE) derived fractions. For example, transposable elements account for 45% of the human genome, 37% of the mouse genome, 73% of the maize genome, and 26.5% of the zebrafish genome [2–5]. TEs are valuable tools for genetic analysis and modification. They also represent drivers of genomic evolution and diversification by acting as mutagens or as targets for non-homologous recombination. In addition, TEs can act as sources of novel protein coding sequences and regulatory motifs [6, 7].
As a result of their prevalence and importance in genome biology, TEs are important study subjects. However because of their repetitive nature, specific techniques are required to deal with them. For example, researchers may be interested in investigating patterns of evolution among TE families or the distribution of the elements in the genomic environment. In cases where the genome is relatively unexplored, this can be difficult. The initial step is often identifying the transposable element families present in a given genome. This can be done de novo using tools such as RepeatScout , PILER , or a variety of other tools , discovering and detecting transposable elements in genome sequences , by comparison to a related organism, or by obtaining a previously generated library, such as those provided by RepBase .
Once a basic TE library is developed, it can be used to search for specific insertion sites within a genome. BLAST  and RepeatMasker  are two tools that are commonly used. RepeatMasker identifies and masks transposable elements using a known library, while BLAST will output matches to query sequences based on the quality of the match. However, unlike when dealing with a single or small set of genes, transposable element searches using either tool can return anywhere from a few hundred to millions of hits for each element family present within a given genome. Previously, there have been few good options for dealing with this amount of data. While there are several options for converting BLAST to FASTA, most of them seem to only work for a single sequence at a time or do not work with local BLAST data and while it is possible to manually extract the appropriate sequence information from BLAST or RepeatMasker output, doing so can be time consuming.
In order to counter this problem, we developed a set of bioinformatics techniques and programs to streamline analyses. These tools include a unique set of Perl scripts which automate the process of taking BLAST, Repeatmasker or similar data, locating the hit sequence, and exporting these sequences with unique IDs to a new FASTA file. This tool, called Process_hits, uses a combination of object-oriented and BioPerl  methods to compile all hit locations from a given output file for processing, organizes this data into useable categories, and outputs it into a variety of formats, allowing for the processing of large amount of sequence data over a short period of time.
Process_hits was designed with each of the common major sub-functions (hit processing, sequence extraction, and hit-object methods) contained within their own sub-modules. This program is composed of process_hits.pl, Geneloc.pm, Gene_process.pm, and Gene_extract.pm as well as several optional simple scripts designed to assist with pre-formatting and other data management issues. Process_hits.pl is the user interface; it takes in data and provides a framework for calling the library modules. Gene_loc.pm contains the modules for creating Geneloc objects, which store information on sequence location within a FASTA file. Gene_process.pm contains the modules required to convert input data into Geneloc objects, while Gene_extract.pm contains the modules required to convert Geneloc objects into FASTA sequences and output the data in several different methods. The optional scripts include Clean_FASTA, Split_BLAST, and Split_Repeatmasker. Clean_FASTA removes any characters or unusual formatting that may be present in the nucleotide sequences of a FASTA file. Split_BLAST and Split_Repeatmasker will break a single file down into smaller subfiles based on a given parameter, similar to the functionality provided by Process_hits described below.
User input is limited to process_hits.pl and consists of RepeatMasker formatted, EPCR tabular formatted , or tabular BLAST output formatted text files and a FASTA formatted sequence file. Variable parameters are set as part of the command line input. Usage options include a log function and a verbose function to assist with testing. Input options include using a single file or a list of files. The implemented quality control parameters allow users to set the minimum and/or maximum length, the maximum number of gaps, the maximum number of mismatches, and in the case of BLAST files, the minimum bit score or E-value for a given sequence. For BLAST data, the user can choose to output only a given number of the best hits based on the E-value. One of the advantages of these optional parameters is that one can perform a single BLAST or RepeatMasker search and use Process_hits to select only a specific portion of one's data for analysis.
Geneloc.pm provides the base methods that are necessary to create Geneloc objects. Each Geneloc object is established with a default set of attributes, which may be expanded automatically without specifying a new method. The default attributes include hit_ID, location, seqStart, seqEnd, and seqLength. Hit_ID contains the unique name for each object, and location contains the name of the sequence where the sub-sequence described was found. Both seqStart and seqEnd are numerical values for the site of the sub-sequence within a greater sequence, while seqLength is defined as the distance between the two values.
The input file is opened in Gene_process.pm and converted into Geneloc objects line by line. Geneloc objects are stored within a single array. This conversion process corrects for sequence orientation where it is needed. Once the entire file has been processed, the Geneloc objects that contain overlapping or adjacent sequences, may be combined into a single Geneloc object as set by the user. These Geneloc objects are then checked against the given parameters and removed if they do not fall within the given quality controls. Here, the data may be split into subgroups based on the query sequence for BLAST or the element name or family for RepeatMasker. For every unique query or element a new array containing the matching Geneloc objects is created. These new arrays are then contained within a hash with unique keys based on the individual query or element.
The array or arrays containing the Geneloc objects are then sent to Gene_extract.pm for extraction. The default output option is a single unaligned FASTA file containing all the matching sequences within the range of the parameters given above, but if one of the split methods detailed above is used, multiple FASTA files will be created. If this option is used, the program can also retrieve the original query sequences from a given FASTA file and match those sequences with the Geneloc objects. Initial FASTA files are indexed using the BioPerl method Bio::DB::Fasta . Geneloc objects are extracted one by one using their Start, End, and Location methods. The Start and End methods can be modified by adding a buffer that expands the sequence beyond the parameters of the original hit. This will extend the extracted sequence upstream or downstream where data is available. Using the indexed database, each Geneloc object is retrieved and printed to the appropriate FASTA file. If the output consists of similar sequences, there is an option to align all sequences, align the subsets created using the split methods, or align a random selection of them using MUSCLE , which if combined with the query retrieval methods above, will align the output sequences with their original query sequence. Other output options include a text file in the appropriate format of the final Geneloc objects to be extracted, which can be combined with a no-extract option in order to output only the text file.
For the first example we will use a BLAST output file as part of the initial search for the transposable element content of a given sequence database. To begin, the user opens a command window or terminal and directs it to the working directory. The Process_hits scripts will need to be placed in either this directory or in an executable folder (*bin on most Linux systems). Next comes the following command: "process_hits.pl -input blast -v -buffer 200 -bit 100 -minlength 100 -splitquery -align -print BLASTExample1.print.txt BLASTExample1.out ExampleDB.fas". The 'v' parameter will set Process_hits to verbose mode so that the user can follow along as the program runs and check for any potential errors running it for the first time on a new machine or dataset. Similarly, 'print' will create a tabular format BLAST file with only the BLAST hits that were extracted, which can be useful for error checking and so that the user will know exactly what is going into and coming out of the program. 'Minlength' and 'bit' are quality control options, extracting only sequences of a certain length and of a given bit score. The remaining three parameters control the Process_hits output. 'Buffer' will extract 200 bases upstream and downstream of the original hit and is typically used to either obtain flanking sequence or for expanding outward in order to retrieve a full-length transposable element sequence from your database. 'Splitquery' and 'align' will split the FASTA output into a separate file for each matching query sequence and align the output files using MUSCLE. Taken together, these options make a solid approach to an initial BLAST search for individual or multiple transposable element families.
For a RepeatMasker example, one typical application is to search for the 5' and 3' ends of a transposable element family. The method is designed to extend the original query and eventually find examples of full length sequences of larger element, such as LINEs. Again, the user starts by opening a command prompt or terminal into the directory containing the user's working files as well as Process_hits. The user proceeds by sending the following command: "process_hits.pl -input repeatmasker -splittype -align -overlap 100 -buffer 1000 -minlength 500 -qseq ExampleQuery.fas RMExample.out ExampleDB.fas". Here larger 'buffer' and 'minlength' options are used so that longer extracts are retrieved in an attempt to identify the full longer hits to the TEs of interest. Since in this case longer extracts are being retrieved, we have added the 'overlap' parameter, which will combine any hits within 100 bases of each other before buffering. This allows nearby hits that are likely to be from the original insertion but separated by small indels to be combined into the same extracted sequence. 'Splittype' functions are similar to 'splitquery' as described above. 'Qseq' will retrieve the original query sequences from a given FASTA file and add them to the FASTA files that are generated prior to alignment ("-align"). When taken all together, these settings will allow you to extend the partial TE sequences that are often output by PILER, RepeatScout, RepeatModeler, and other de novo repeat identifiers and generate a full length consensus sequence. It is also useful for the analysis of the flanking sequence of selected TEs.
Additional examples and details on various parameters and options can be found in Examples.txt and the readme.txt files, which are part of the Process_hits distribution.
Extraction Time (s)
Anolis carolinensis (AnoCar2.0)
Arabidopsis thaliana ( TAIR9.171)
Aspergillus nidulan (FGSC A4 s06-m03-r02)
Loxodonta africana (loxAfr3)
Macropus eugenii (Meug_1.1)
Oryctolagus cuniculus (OryCun2.0)
Petromyzon marinus (petMar1)
(B73 RefGen v2)
Project name: Process_hits
Project home page: https://sourceforge.net/projects/processhits/
Operating systems: Platform independent
Programming language: Perl 5.10.0+
Other requirements: BioPerl 1.61+
License: Academic Free License (AFL)
The authors wish to thank N Platt and H Pagan for testing the software in their analyses of various genome drafts. This work was supported by the Eberly College of Arts and Sciences at West Virginia University (DAR), by the National Science Foundation (MCB-0841821, DEB-1020865) (DAR) and by the Mississippi Agricultural and Forestry Experiment Station at Mississippi State University.
- NCBI ENTREZ Genome Project. [http://www.ncbi.nlm.nih.gov/genomes/static/gpstat.html]
- Lander ES, Linton LM, Birren B, Nusbaum C, Zody MC, Baldwin J, Devon K, Dewar K, Doyle M, FitzHugh W, Funke R, Gage D, Harris K, Heaford A, Howland J, Kann L, Lehoczky J, LeVine R, McEwan P, McKernan K, Meldrim J, Mesirov JP, Miranda C, Morris W, Naylor J, Raymond C, Rosetti M, Santos R, Sheridan A, Sougnez C, et al: Initial sequencing and analysis of the human genome. Nature. 2001, 409: 860-921. 10.1038/35057062.PubMedView ArticleGoogle Scholar
- Waterston RH, Lindblad-Toh K, Birney E, Rogers J, Abril JF, Agarwal P, Agarwala R, Ainscough R, Alexandersson M, An P, Antonarakis SE, Attwood J, Baertsch R, Bailey J, Barlow K, Beck S, Berry E, Birren B, Bloom T, Bork P, Botcherby M, Bray N, Brent MR, Brown DG, Brown SD, Bult C, Burton J, Butler J, Campbell RD, Carninci P, Cawley S, et al: Initial sequencing and comparative analysis of the mouse genome. Nature. 2002, 420: 520-562. 10.1038/nature01262.PubMedView ArticleGoogle Scholar
- Meyers BC, Tingey SV, Morgante M: Abundance, distribution, and transcriptional activity of repetitive elements in the maize genome. Genome Research. 2001, 11: 1660-1676. 10.1101/gr.188201.PubMedPubMed CentralView ArticleGoogle Scholar
- Sela , et al: The role of transposable elements in the evolution of non-mammalian vertebrates and invertebrates. Genome Biology. 2010, 11: R59-10.1186/gb-2010-11-6-r59.PubMedPubMed CentralView ArticleGoogle Scholar
- Bohne A, Brunet F, Galiana-Arnoux D, Schultheis C, Volff JN: Transposable elements as drivers of genomic and biological diversity in vertebrates. Chromosome Res. 2008, 16: 203-215. 10.1007/s10577-007-1202-6.PubMedView ArticleGoogle Scholar
- Deininger PL, Batzer MA: Mammalian retroelements. Genome Research. 2002, 12: 1455-1465. 10.1101/gr.282402.PubMedView ArticleGoogle Scholar
- Price AL, Jones NC, Pevzner PA: De novo identification of repeat families in large genomes. To appear in Proceedings of the 13 Annual International conference on Intelligent Systems for Molecular Biology (ISMB-05). 2005Google Scholar
- Edgar RC, Myers EW: PILER: identification and classification of genomic repeats. Bioinformatics. 2005, 21 (1): 152-158. 10.1093/bioinformatics/bti1003.View ArticleGoogle Scholar
- Bergman CM, Quesneville H: Discovering and detecting transposable elements in genome sequences. Briefings in Bioinformatics. 2007, 8: 382-392. 10.1093/bib/bbm048.PubMedView ArticleGoogle Scholar
- Bergman CM, Quesneville H: Discovering and detecting transposable elements in genome sequences. Brief Bioinform. 2007, 8 (6): 382-92. 10.1093/bib/bbm048.PubMedView ArticleGoogle Scholar
- Genetic Information Research Institute. [http://www.girinst.org]
- Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ: Basic local alignment search tool. Journal of Molecular Biology. 1990, 215 (3): 403-410.PubMedView ArticleGoogle Scholar
- Smit AFA, Hubley R, Green P: RepeatMasker Open-3.0. [http://www.repeatmasker.org]
- Stajich JE, Block D, Boulez K, Brenner SE, Chervitz SA, Dagdigian C, Fuellen G, Gilbert JG, Korf I, Lapp H, et al: The BioPerl toolkit: Perl modules for the life sciences. Genome Research. 2002, 12 (10): 1611-1618. 10.1101/gr.361602.PubMedPubMed CentralView ArticleGoogle Scholar
- Schuler GD: Electronic PCR: bridging the gap between genome mapping and genome sequencing. Trends Biotechnol. 1998, 16 (11): 456-459. 10.1016/S0167-7799(98)01232-3.PubMedView ArticleGoogle Scholar
- Edgar RC: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research. 2004, 32 (5): 1792-1797. 10.1093/nar/gkh340.PubMedPubMed CentralView ArticleGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.