2015
DOI: 10.1515/sagmb-2014-0093
|View full text |Cite
|
Sign up to set email alerts
|

TopKLists: a comprehensive R package for statistical inference, stochastic aggregation, and visualization of multiple omics ranked lists

Abstract: High-throughput sequencing techniques are increasingly affordable and produce massive amounts of data. Together with other high-throughput technologies, such as microarrays, there are an enormous amount of resources in databases. The collection of these valuable data has been routine for more than a decade. Despite different technologies, many experiments share the same goal. For instance, the aims of RNA-seq studies often coincide with those of differential gene expression experiments based on microarrays. As… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(45 citation statements)
references
References 16 publications
0
45
0
Order By: Relevance
“…The linear models were implemented using lm R function and the LRT test with associated statistics were calculated using lrtest function from lmtest R package. The Borda ranking method was implemented using the Borda function from TopKLists R package (Schimek et al, 2015) .…”
Section: Linear Modelling To Identify Protein and Phospho-protein Assmentioning
confidence: 99%
“…The linear models were implemented using lm R function and the LRT test with associated statistics were calculated using lrtest function from lmtest R package. The Borda ranking method was implemented using the Borda function from TopKLists R package (Schimek et al, 2015) .…”
Section: Linear Modelling To Identify Protein and Phospho-protein Assmentioning
confidence: 99%
“…Other rank aggregation methods not considered here are online rank aggregation (Helmbold & Warmuth, 2007 from multiple omics ranked lists (Schimek et al, 2015), and an indirect inference approach for rank aggregation (Švendová & Schimek, 2017). For comparison of various aggregation methods, see Li, Wang, and Xiao (2019); Q.…”
Section: Rank Aggregation Methodsmentioning
confidence: 99%
“…We describe here our computational approach for fitting penalized BPL models using seamless L 0 penalties. All code was written in the R statistical environment (R Core Team, 2018; Wickham, 2017;Neuwirth, 2014;Schimek et al, 2015) and is freely available via github (https://github.com/psboonstra/RankModeling). When g is an L 0 -type penalty, maximizing n i=1 log f i (β) − g(β, λ) is a non-convex optimization problem that is both computationally difficult and which admits the possibility of identifying local optima.…”
Section: Computational Implementationmentioning
confidence: 99%