ArticlePLoS computational biology2018
A machine learning based framework to identify and classify long terminal repeat retrotransposons.
Article in PLoS computational biology, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 14 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
14 citing papers in PubMed, 43 citations in OpenAlex.
- Transformer-Based Classification of Transposable Element Consensus Sequences with TEclass2.Biology · 2025Article
- Article
- Detection and classification of long terminal repeat sequences in plant LTR-retrotransposons and their analysis using explainable machine learning.BioData mining · 2024Article
- Evolution of Plant Genome Size and Composition.Genomics, proteomics & bioinformatics · 2024Review
- Inpactor2: a software based on deep learning to identify and classify LTR-retrotransposons in plant genomes.Briefings in bioinformatics · 2023Article
- Article
- TransposonUltimate: software for transposon classification, annotation and detection.Nucleic acids research · 2022Article
- Methodologies for theGenes · 2022Review
- Finding and Characterizing Repeats in Plant Genomes.Methods in molecular biology (Clifton, N.J.) · 2022Article
- Article
- Article
- Genome size evolution: towards new model systems for old questions.Proceedings. Biological sciences · 2020Article
- Retrotransposons in Plant Genomes: Structure, Identification, and Classification through Bioinformatics and Machine Learning.International journal of molecular sciences · 2019Review
- Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
8 authors at 6 institutions in 3 countries.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Transposable elements (TEs) are repetitive nucleotide sequences that make up a large portion of eukaryotic genomes. They can move and duplicate within a genome, increasing genome size and contributing to genetic diversity within and across species. Accurate identification and classification of TEs present in a genome is an important step towards understanding their effects on genes and their role in genome evolution. We introduce TE-Learner, a framework based on machine learning that automatically identifies TEs in a given genome and assigns a classification to them. We present an implementation of our framework towards LTR retrotransposons, a particular type of TEs characterized by having long terminal repeats (LTRs) at their boundaries. We evaluate the predictive performance of our framework on the well-annotated genomes of Drosophila melanogaster and Arabidopsis thaliana and we compare our results for three LTR retrotransposon superfamilies with the results of three widely used methods for TE identification or classification: RepeatMasker, Censor and LtrDigest. In contrast to these methods, TE-Learner is the first to incorporate machine learning techniques, outperforming these methods in terms of predictive performance, while able to learn models and make predictions efficiently. Moreover, we show that our method was able to identify TEs that none of the above method could find, and we investigated TE-Learner's predictions which did not correspond to an official annotation. It turns out that many of these predictions are in fact strongly homologous to a known TE.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.