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.
? Tutorial for this page

Scott C. Ritchie

dblp:237/9336 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-8454-9548ORCID · reported

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

Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › computational microbiology
microbiome analysis
0.412019
FastSpar: rapid and scalable correlation estimation for compositional data · Bioinform. 2019
Algorithms and data structures
parallel algorithms
0.112019
FastSpar: rapid and scalable correlation estimation for compositional data · Bioinform. 2019

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

unbiased estimator · 0.8parallelization · 0.8SparCC · 0.8
YearPublicationVenuePosition
2019 FastSpar: rapid and scalable correlation estimation for compositional data
abstract
SUMMARY: A common goal of microbiome studies is the elucidation of community composition and member interactions using counts of taxonomic units extracted from sequence data. Inference of interaction networks from sparse and compositional data requires specialized statistical approaches. A popular solution is SparCC, however its performance limits the calculation of interaction networks for very high-dimensional datasets. Here we introduce FastSpar, an efficient and parallelizable implementation of the SparCC algorithm which rapidly infers correlation networks and calculates P-values using an unbiased estimator. We further demonstrate that FastSpar reduces network inference wall time by 2-3 orders of magnitude compared to SparCC. AVAILABILITY AND IMPLEMENTATION: FastSpar source code, precompiled binaries and platform packages are freely available on GitHub: github.com/scwatts/FastSpar. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Stephen C. Watts, Scott C. Ritchie, Michael Inouye, Kathryn E. Holt
Bioinform.2