Demo Data from VLDB 2026 / reviewers in the wild / expert
Sangsoon Woo
dblp:13/9109
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 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 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › epigenomics
chromatin analysis |
0.2 | 1 | 2013 | PING 2.0: an R/Bioconductor package for nucleosome positioning using next-generation sequencing data · Bioinform. 2013 |
Bioinformatics and computational biology › epigenomics › chromatin analysis
nucleosome positioning |
0.2 | 1 | 2013 | PING 2.0: an R/Bioconductor package for nucleosome positioning using next-generation sequencing data · Bioinform. 2013 |
Bioinformatics and computational biology › gene expression analysis
differential expression analysis |
0.1 | 1 | 2011 | A computationally efficient modular optimal discovery procedure · Bioinform. 2011 |
Bioinformatics and computational biology
gene expression analysis |
0.1 | 1 | 2011 | A computationally efficient modular optimal discovery procedure · Bioinform. 2011 |
Bioinformatics and computational biology › biostatistics › statistical bioinformatics
statistical genomics |
0.1 | 1 | 2011 | A computationally efficient modular optimal discovery procedure · Bioinform. 2011 |
Bioinformatics and computational biology
epigenomics |
0.0 | 1 | 2013 | PING 2.0: an R/Bioconductor package for nucleosome positioning using next-generation sequencing data · Bioinform. 2013 |
Bioinformatics and computational biology › epigenomics
histone modification analysis |
0.0 | 1 | 2013 | PING 2.0: an R/Bioconductor package for nucleosome positioning using next-generation sequencing data · Bioinform. 2013 |
Bioinformatics and computational biology › gene expression analysis
microarray data analysis |
0.0 | 1 | 2011 | A computationally efficient modular optimal discovery procedure · Bioinform. 2011 |
Methods — techniques the papers use, named apart from their topics
model-based approach · 0.2modular estimation · 0.1kullback-leibler distance · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | PING 2.0: an R/Bioconductor package for nucleosome positioning using next-generation sequencing dataabstractSUMMARY: MNase-Seq and ChIP-Seq have evolved as popular techniques to study chromatin and histone modification. Although many tools have been developed to identify enriched regions, software tools for nucleosome positioning are still limited. We introduce a flexible and powerful open-source R package, PING 2.0, for nucleosome positioning using MNase-Seq data or MNase- or sonicated- ChIP-Seq data combined with either single-end or paired-end sequencing. PING uses a model-based approach, which enables nucleosome predictions even in the presence of low read counts. We illustrate PING using two paired-end datasets from Saccharomyces cerevisiae and compare its performance with nucleR and ChIPseqR. AVAILABILITY: PING 2.0 is available from the Bioconductor website at http://bioconductor.org. It can run on Linux, Mac and Windows. Sangsoon Woo, Xuekui Zhang, Renan Sauteraud, François Robert 0001, Raphael Gottardo |
Bioinform. | 1 |
| 2011 | A computationally efficient modular optimal discovery procedureabstractMOTIVATION: It is well known that patterns of differential gene expression across biological conditions are often shared by many genes, particularly those within functional groups. Taking advantage of these patterns can lead to increased statistical power and biological clarity when testing for differential expression in a microarray experiment. The optimal discovery procedure (ODP), which maximizes the expected number of true positives for each fixed number of expected false positives, is a framework aimed at this goal. Storey et al. introduced an estimator of the ODP for identifying differentially expressed genes. However, their ODP estimator grows quadratically in computational time with respect to the number of genes. Reducing this computational burden is a key step in making the ODP practical for usage in a variety of high-throughput problems. RESULTS: Here, we propose a new estimate of the ODP called the modular ODP (mODP). The existing 'full ODP' requires that the likelihood function for each gene be evaluated according to the parameter estimates for all genes. The mODP assigns genes to modules according to a Kullback-Leibler distance, and then evaluates the statistic only at the module-averaged parameter estimates. We show that the mODP is relatively insensitive to the choice of the number of modules, but dramatically reduces the computational complexity from quadratic to linear in the number of genes. We compare the full ODP algorithm and mODP on simulated data and gene expression data from a recent study of Morrocan Amazighs. The mODP and full ODP algorithm perform very similarly across a range of comparisons. AVAILABILITY: The mODP methodology has been implemented into EDGE, a comprehensive gene expression analysis software package in R, available at http://genomine.org/edge/. Sangsoon Woo, Jeffrey T. Leek, John D. Storey |
Bioinform. | 1 |