Evidence map›Paper›PMID 29684010›Full record

ArticlePLoS computational biology2018

A machine learning based framework to identify and classify long terminal repeat retrotransposons.

Leander Schietgat, Celine Vens, Ricardo Cerri, Carlos N Fischer, Eduardo Costa, Jan Ramon, Claudia M A Carareto, Hendrik Blockeel

Open access · goldAbstract read
In one paragraph

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.

0numbers the graph read from it
0cells of the map it votes in
14citing papers in PubMed
8.1field-weighted citation impact, top 3% of its field
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

14 citing papers in PubMed, 43 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Evolution of Plant Genome Size and Composition.Genomics, proteomics & bioinformatics · 2024
    Review
  5. Article
  6. Article
  7. Article
  8. Review
  9. Finding and Characterizing Repeats in Plant Genomes.Methods in molecular biology (Clifton, N.J.) · 2022
    Article
  10. Article
  11. PeerJ · 2021
    Article
  12. Article
  13. Review
  14. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors at 6 institutions in 3 countries.

Leander SchietgatDepartment of Computer Science, KU Leuven, Leuven, Belgium.
Celine VensDepartment of Computer Science, KU Leuven, Leuven, Belgium.ORCID 0000-0003-0983-256X
Ricardo CerriDepartment of Computer Science, UFSCar Federal University of São Carlos, São Carlos, São Paulo, Brazil.ORCID 0000-0002-2582-1695
Carlos N FischerDepartment of Statistics, Applied Mathematics, and Computer Science, UNESP São Paulo State University, Rio Claro, São Paulo, Brazil.ORCID 0000-0002-5598-6263
Eduardo CostaDepartment of Computer Science, KU Leuven, Leuven, Belgium.
Jan RamonDepartment of Computer Science, KU Leuven, Leuven, Belgium.
Claudia M A CararetoDepartment of Biology, UNESP São Paulo State University, São José do Rio Preto, São Paulo, Brazil.
Hendrik BlockeelDepartment of Computer Science, KU Leuven, Leuven, Belgium.ORCID 0000-0003-0378-3699
KU Leuven · BEUniversidade Estadual Paulista (Unesp) · BRGhent University · BEInstitut national de recherche en sciences et technologies du numérique · FRUniversidade de São Paulo · BRUniversidade Federal de São Carlos · BR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

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

Machine LearningRetroelementsTerminal Repeat SequencesAnimalsArabidopsisArabidopsis ProteinsComputational BiologyConserved SequenceDecision TreesDNA, PlantDrosophila melanogasterDrosophila ProteinsEvolution, MolecularGenome, InsectGenome, PlantSoftwareArabidopsis ProteinsDNA, PlantDrosophila ProteinsRetroelements

Identifiers

PMID29684010
PMCPMC5933816
OpenAlexW2800198679

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.