Evidence map›Paper›PMID 24813214›Full record

ArticleBioinformatics (Oxford, England)2014

Efficient RNA isoform identification and quantification from RNA-Seq data with network flows.

Elsa Bernard, Laurent Jacob, Julien Mairal, Jean-Philippe Vert

Abstract read
In one paragraph

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

0numbers the graph read from it
0cells of the map it votes in
31citing 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

31 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Review
  6. Improving RNA Assembly via Safety and Completeness in Flow Decompositions.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  7. Efficient Minimum Flow Decomposition via Integer Linear Programming.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  8. Deriving Ranges of Optimal Estimated Transcript Expression due to Nonidentifiability.Journal of computational biology : a journal of computational molecular cell biology · 2022
    Article
  9. Article
  10. Article
  11. Article
  12. Exact transcript quantification over splice graphs.Algorithms for molecular biology : AMB · 2021
    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

4 authors.

Elsa BernardMines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France Mines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France Mines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France.
Laurent JacobMines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France.
Julien MairalMines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France.
Jean-Philippe VertMines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France Mines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France Mines ParisTech, Centre for Computational Biology, 77300 Fontainebleau, Institut Curie, 26 rue d'Ulm, 75248 Paris Cedex 05, INSERM U900, Paris F-75248, France, Laboratoire Biométrie et Biologie Evolutive, Université de Lyon, Université Lyon 1, CNRS, INRA, UMR5558, Villeurbanne, France and LEAR Project-Team, INRIA Grenoble Rhône Alpes, 38330 Montbonnot, France.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationSeveral state-of-the-art methods for isoform identification and quantification are based on [Formula: see text]-regularized regression, such as the Lasso. However, explicitly listing the-possibly exponentially-large set of candidate transcripts is intractable for genes with many exons. For this reason, existing approaches using the [Formula: see text]-penalty are either restricted to genes with few exons or only run the regression algorithm on a small set of preselected isoforms.

resultsWe introduce a new technique called FlipFlop, which can efficiently tackle the sparse estimation problem on the full set of candidate isoforms by using network flow optimization. Our technique removes the need of a preselection step, leading to better isoform identification while keeping a low computational cost. Experiments with synthetic and real RNA-Seq data confirm that our approach is more accurate than alternative methods and one of the fastest available. AVAILABILITY AND IMPLEMENTATION: Source code is freely available as an R package from the Bioconductor Web site (http://www.bioconductor.org/), and more information is available at http://cbio.ensmp.fr/flipflop. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

AlgorithmsExonsGene Expression ProfilingHumansModels, StatisticalRNA IsoformsSequence Analysis, RNASoftwareRNA Isoforms

Identifiers

PMID24813214
PMCPMC4147886

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.