Demo Data from EDBT 2026 / reviewers in the wild / expert
Sujong Kim
dblp:18/3107
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3
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% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › computational oncology
cancer classification from gene expression |
0.1 | 1 | 2006 | Structured polychotomous machine diagnosis of multiple cancer types using gene expression · Bioinform. 2006 |
Bioinformatics and computational biology
gene expression analysis |
0.1 | 1 | 2006 | Structured polychotomous machine diagnosis of multiple cancer types using gene expression · Bioinform. 2006 |
Bioinformatics and computational biology › gene expression analysis › gene expression classification
marker gene selection |
0.1 | 1 | 2006 | Structured polychotomous machine diagnosis of multiple cancer types using gene expression · Bioinform. 2006 |
Methods — techniques the papers use, named apart from their topics
wald test · 0.1support vector machine · 0.1structured kernels · 0.1rao test · 0.1newton-raphson · 0.1analysis of variance decomposition · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Robust test method for time-course microarray experimentsabstractBACKGROUND: In a time-course microarray experiment, the expression level for each gene is observed across a number of time-points in order to characterize the temporal trajectories of the gene-expression profiles. For many of these experiments, the scientific aim is the identification of genes for which the trajectories depend on an experimental or phenotypic factor. There is an extensive recent body of literature on statistical methodology for addressing this analytical problem. Most of the existing methods are based on estimating the time-course trajectories using parametric or non-parametric mean regression methods. The sensitivity of these regression methods to outliers, an issue that is well documented in the statistical literature, should be of concern when analyzing microarray data. RESULTS: In this paper, we propose a robust testing method for identifying genes whose expression time profiles depend on a factor. Furthermore, we propose a multiple testing procedure to adjust for multiplicity. CONCLUSIONS: Through an extensive simulation study, we will illustrate the performance of our method. Finally, we will report the results from applying our method to a case study and discussing potential extensions. Insuk Sohn, Kouros Owzar, Stephen L. George, Sujong Kim, Sin-Ho Jung |
BMC Bioinform. | 4 |
| 2009 | A permutation-based multiple testing method for time-course microarray experimentsabstractBACKGROUND: Time-course microarray experiments are widely used to study the temporal profiles of gene expression. Storey et al. (2005) developed a method for analyzing time-course microarray studies that can be applied to discovering genes whose expression trajectories change over time within a single biological group, or those that follow different time trajectories among multiple groups. They estimated the expression trajectories of each gene using natural cubic splines under the null (no time-course) and alternative (time-course) hypotheses, and used a goodness of fit test statistic to quantify the discrepancy. The null distribution of the statistic was approximated through a bootstrap method. Gene expression levels in microarray data are often complicatedly correlated. An accurate type I error control adjusting for multiple testing requires the joint null distribution of test statistics for a large number of genes. For this purpose, permutation methods have been widely used because of computational ease and their intuitive interpretation. RESULTS: In this paper, we propose a permutation-based multiple testing procedure based on the test statistic used by Storey et al. (2005). We also propose an efficient computation algorithm. Extensive simulations are conducted to investigate the performance of the permutation-based multiple testing procedure. The application of the proposed method is illustrated using the Caenorhabditis elegans dauer developmental data. CONCLUSION: Our method is computationally efficient and applicable for identifying genes whose expression levels are time-dependent in a single biological group and for identifying the genes for which the time-profile depends on the group in a multi-group setting. Insuk Sohn, Kouros Owzar, Stephen L. George, Sujong Kim, Sin-Ho Jung |
BMC Bioinform. | 4 |
| 2006 | Structured polychotomous machine diagnosis of multiple cancer types using gene expressionabstractMOTIVATION: The problem of class prediction has received a tremendous amount of attention in the literature recently. In the context of DNA microarrays, where the task is to classify and predict the diagnostic category of a sample on the basis of its gene expression profile, a problem of particular importance is the diagnosis of cancer type based on microarray data. One method of classification which has been very successful in cancer diagnosis is the support vector machine (SVM). The latter has been shown (through simulations) to be superior in comparison with other methods, such as classical discriminant analysis, however, SVM suffers from the drawback that the solution is implicit and therefore is difficult to interpret. In order to remedy this difficulty, an analysis of variance decomposition using structured kernels is proposed and is referred to as the structured polychotomous machine. This technique utilizes Newton-Raphson to find estimates of coefficients followed by the Rao and Wald tests, respectively, for addition and deletion of import vectors. RESULTS: The proposed method is applied to microarray data and simulation data. The major breakthrough of our method is efficiency in that only a minimal number of genes that accurately predict the classes are selected. It has been verified that the selected genes serve as legitimate markers for cancer classification from a biological point of view. AVAILABILITY: All source codes used are available on request from the authors. Ja-Yong Koo, Insuk Sohn, Sujong Kim, Jae Won Lee |
Bioinform. | 3 |