Evidence map›Paper›PMID 23758809›Full record

ArticleBMC bioinformatics2013

MITE Digger, an efficient and accurate algorithm for genome wide discovery of miniature inverted repeat transposable elements.

Guojun Yang

Abstract read
In one paragraph

Article in BMC bioinformatics, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 27 papers.

0numbers the graph read from it
0cells of the map it votes in
27citing papers in PubMed
–field-weighted citation impact
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

27 citing papers in PubMed.

  1. Progresses of transposon research inSynthetic and systems biotechnology · 2026
    Review
  2. Review
  3. Review
  4. Article
  5. Review
  6. Finding and Characterizing Repeats in Plant Genomes.Methods in molecular biology (Clifton, N.J.) · 2022
    Article
  7. Article
  8. Article
  9. Article
  10. Review
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. 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

1 author.

Guojun YangDepartment of Biology, University of Toronto Mississauga, Mississauga, ON L5L 1C6, Canada. gage.yang@utoronto.ca

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundMiniature inverted repeat transposable elements (MITEs) are abundant non-autonomous elements, playing important roles in shaping gene and genome evolution. Their characteristic structural features are suitable for automated identification by computational approaches, however, de novo MITE discovery at genomic levels is still resource expensive. Efficient and accurate computational tools are desirable. Existing algorithms process every member of a MITE family, therefore a major portion of the computing task is redundant.

resultsIn this study, redundant computing steps were analyzed and a novel algorithm emphasizing on the reduction of such redundant computing was implemented in MITE Digger. It completed processing the whole rice genome sequence database in ~15 hours and produced 332 MITE candidates with low false positive (1.8%) and false negative (0.9%) rates. MITE Digger was also tested for genome wide MITE discovery with four other genomes.

conclusionsMITE Digger is efficient and accurate for genome wide retrieval of MITEs. Its user friendly interface further facilitates genome wide analyses of MITEs on a routine basis. The MITE Digger program is available at: http://labs.csb.utoronto.ca/yang/MITEDigger.

Indexed as

AlgorithmsDNA Transposable ElementsInverted Repeat SequencesGenome-Wide Association StudyGenomicsOryzaSoftwareDNA Transposable Elements

Identifiers

PMID23758809
PMCPMC3680318

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.