LTRSTRUC: a novel search and identification program for LTR retrotransposons

MOTIVATION: Long terminal repeat (LTR) retrotransposons constitute a substantial fraction of most eukaryotic genomes and are believed to have a significant impact on genome structure and function. Conventional methods used to search for LTR retrotransposons in genome databases are labor intensive. We present an efficient, reliable and automated method to identify and analyze members of this important class of transposable elements. RESULTS: We have developed a new data-mining program, LTRSTRUC (LTR retrotransposon structure program) which identifies and automatically analyzes LTR retrotransposons in genome databases by searching for structural features characteristic of such elements. LTRSTRUC has significant advantages over conventional search methods in the case of LTR retrotransposon families having low sequence homology to known queries or families with atypical structure (e. g. non-autonomous elements lacking canonical retroviral ORFs) and is thus a discovery tool that complements established methods. LTRSTRUC finds LTR retrotransposons using an algorithm that encompasses a number of tasks that would otherwise have to be initiated individually by the user. For each LTR retrotransposon found, LTRSTRUC automatically generates an analysis of a variety of structural features of biological interest. AVAILABILITY: The LTRSTRUC program is currently available as a console application free of charge to academic users from the authors.