Cited by 336Chromosomal and Genetic VariationsGenomics and Phylogenetic StudiesGenomic variations and chromosomal abnormalities

LTR_STRUC: a novel search and identification program for LTR retrotransposons

Open access
McCarthy, Eugene M., McDonald, John F.·2003·Bioinformatics

Abstract

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, LTR_STRUC (LTR retrotransposon structure program) which identifies and automatically analyzes LTR retrotransposons in genome databases by searching for structural features characteristic of such elements. LTR_STRUC 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. LTR_STRUC 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, LTR_STRUC automatically generates an analysis of a variety of structural features of biological interest. Availability: The LTR_STRUC program is currently available as a console application free of charge to academic users from the authors.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/btf878

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. [3]3. Coffin,J.M., Hughes,S.H. and Varmus,H.E. (1997) Retroviruses, Plainview, Coldspring Harbor Laboratory Press, NY.

Cited by

Sorted by citations

Authors
McCarthy, E. M., & McDonald, J. F.
Affiliations
University of Georgia (US)
Venue
Bioinformatics
Published
2003-02-12
Volume
19
Issue
3
Pages
362-367
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2163960662
Cited by
336
References
5
Citations by year
2026: 7 · 2025: 4 · 2024: 2 · 2023: 5 · 2022: 7 · 2021: 16 · 2020: 22 · 2019: 11 · 2018: 14 · 2017: 22 · 2016: 13 · 2015: 20 · 2014: 20 · 2013: 13 · 2012: 26
FWCI
13.76
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion)
  • PubMed (publishedVersion)
Topics
  • Life Sciences › Agricultural and Biological Sciences › Plant Science › Chromosomal and Genetic Variations
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Genetics › Genomic variations and chromosomal abnormalities
Keywords
LTR retrotransposons, transposable element identification, genome mining, non-autonomous retrotransposons, eukaryotic genomes
MeSH terms
Algorithms, Database Management Systems, Software, Information Storage and Retrieval, Sequence Alignment, Sequence Analysis, DNA, Retroelements, Terminal Repeat Sequences, Databases, Nucleic Acid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review