Evidence map›Paper›PMID 28968831›Full record

ArticleBioinformatics (Oxford, England)2018

DART: a fast and accurate RNA-seq mapper with a partitioning strategy.

Hsin-Nan Lin, Wen-Lian Hsu

Open access · bronzeAbstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 10 papers.

0numbers the graph read from it
0cells of the map it votes in
10citing papers in PubMed
0.9field-weighted citation impact, top 26% 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

10 citing papers in PubMed, 30 citations in OpenAlex.

  1. Article
  2. Article
  3. Alternative splicing analysis benchmark with DICAST.NAR genomics and bioinformatics · 2023
    Article
  4. Article
  5. Review
  6. The Original Form of CFrontiers in plant science · 2022
    Article
  7. Article
  8. Review
  9. Long noncoding RNAs are involved in multiple immunological pathways in response to vaccination.Proceedings of the National Academy of Sciences of the United States of America · 2019
    Article
  10. 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

2 authors at 1 institution in 1 country.

Hsin-Nan LinInstitute of Information Science, Academia Sinica, Taipei, Taiwan.
Wen-Lian HsuInstitute of Information Science, Academia Sinica, Taipei, Taiwan.
Institute of Information Science, Academia Sinica · TW

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationIn recent years, the massively parallel cDNA sequencing (RNA-Seq) technologies have become a powerful tool to provide high resolution measurement of expression and high sensitivity in detecting low abundance transcripts. However, RNA-seq data requires a huge amount of computational efforts. The very fundamental and critical step is to align each sequence fragment against the reference genome. Various de novo spliced RNA aligners have been developed in recent years. Though these aligners can handle spliced alignment and detect splice junctions, some challenges still remain to be solved. With the advances in sequencing technologies and the ongoing collection of sequencing data in the ENCODE project, more efficient alignment algorithms are highly demanded. Most read mappers follow the conventional seed-and-extend strategy to deal with inexact matches for sequence alignment. However, the extension is much more time consuming than the seeding step.

resultsWe proposed a novel RNA-seq de novo mapping algorithm, call DART, which adopts a partitioning strategy to avoid the extension step. The experiment results on synthetic datasets and real NGS datasets showed that DART is a highly efficient aligner that yields the highest or comparable sensitivity and accuracy compared to most state-of-the-art aligners, and more importantly, it spends the least amount of time among the selected aligners. AVAILABILITY AND IMPLEMENTATION: https://github.com/hsinnan75/DART. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Identifiers

PMID28968831
PMCPMC5860201
OpenAlexW2752450281

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.