Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Lorian Schaeffer

dblp:131/9989 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
metagenomics
0.312017
Pseudoalignment for metagenomic read assignment · Bioinform. 2017
Bioinformatics and computational biology › metagenomics
strain-level profiling
0.312017
Pseudoalignment for metagenomic read assignment · Bioinform. 2017
Bioinformatics and computational biology › metagenomics
taxonomic classification
0.312017
Pseudoalignment for metagenomic read assignment · Bioinform. 2017
Bioinformatics and computational biology › transcriptomics
RNA-seq analysis
0.212013
Updating RNA-Seq analyses after re-annotation · Bioinform. 2013
Bioinformatics and computational biology › transcriptomics
transcriptome annotation
0.212013
Updating RNA-Seq analyses after re-annotation · Bioinform. 2013
Bioinformatics and computational biology › sequence analysis › read mapping
pseudoalignment
0.112017
Pseudoalignment for metagenomic read assignment · Bioinform. 2017
Bioinformatics and computational biology › transcriptomics
transcript quantification
0.112017
Pseudoalignment for metagenomic read assignment · Bioinform. 2017

Methods — techniques the papers use, named apart from their topics

pseudoalignment · 0.3expectation-maximization · 0.3partitioning algorithm · 0.2deconvolution · 0.2
YearPublicationVenuePosition
2017 Pseudoalignment for metagenomic read assignment
abstract
MOTIVATION: Read assignment is an important first step in many metagenomic analysis workflows, providing the basis for identification and quantification of species. However ambiguity among the sequences of many strains makes it difficult to assign reads at the lowest level of taxonomy, and reads are typically assigned to taxonomic levels where they are unambiguous. We explore connections between metagenomic read assignment and the quantification of transcripts from RNA-Seq data in order to develop novel methods for rapid and accurate quantification of metagenomic strains. RESULTS: We find that the recent idea of pseudoalignment introduced in the RNA-Seq context is highly applicable in the metagenomics setting. When coupled with the Expectation-Maximization (EM) algorithm, reads can be assigned far more accurately and quickly than is currently possible with state of the art software, making it possible and practical for the first time to analyze abundances of individual genomes in metagenomics projects. AVAILABILITY AND IMPLEMENTATION: Pipeline and analysis code can be downloaded from http://github.com/pachterlab/metakallisto. CONTACT: [email protected].
Lorian Schaeffer, Harold Pimentel, Nicolas Bray, Páll Melsted, Lior Pachter
Bioinform.1
2013 Updating RNA-Seq analyses after re-annotation
abstract
UNLABELLED: The estimation of isoform abundances from RNA-Seq data requires a time-intensive step of mapping reads to either an assembled or previously annotated transcriptome, followed by an optimization procedure for deconvolution of multi-mapping reads. These procedures are essential for downstream analysis such as differential expression. In cases where it is desirable to adjust the underlying annotation, for example, on the discovery of novel isoforms or errors in existing annotations, current pipelines must be rerun from scratch. This makes it difficult to update abundance estimates after re-annotation, or to explore the effect of changes in the transcriptome on analyses. We present a novel efficient algorithm for updating abundance estimates from RNA-Seq experiments on re-annotation that does not require re-analysis of the entire dataset. Our approach is based on a fast partitioning algorithm for identifying transcripts whose abundances may depend on the added or deleted isoforms, and on a fast follow-up approach to re-estimating abundances for all transcripts. We demonstrate the effectiveness of our methods by showing how to synchronize RNA-Seq abundance estimates with the daily RefSeq incremental updates. Thus, we provide a practical approach to maintaining relevant databases of RNA-Seq derived abundance estimates even as annotations are being constantly revised. AVAILABILITY AND IMPLEMENTATION: Our methods are implemented in software called ReXpress and are freely available, together with source code, at http://bio.math.berkeley.edu/ReXpress/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Adam Roberts, Lorian Schaeffer, Lior Pachter
Bioinform.2