Demo Data from VLDB 2026 / reviewers in the wild / expert
Elias Zintzaras
dblp:52/749
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2005
—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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genomics
genome-wide association study |
0.1 | 1 | 2005 | HEGESMA: genome search meta-analysis and heterogeneity testing · Bioinform. 2005 |
Bioinformatics and computational biology › structural bioinformatics
protein structure classification |
0.0 | 1 | 1994 | Growing a classification tree using the apparent misclassification rate · Comput. Appl. Biosci. 1994 |
Methods — techniques the papers use, named apart from their topics
monte carlo permutation test · 0.1linear discriminant analysis · 0.0dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | HEGESMA: genome search meta-analysis and heterogeneity testingabstractSUMMARY: Heterogeneity and genome search meta-analysis (HEGESMA) is a comprehensive software for performing genome scan meta-analysis, a quantitative method to identify genetic regions (bins) with consistently increased linkage score across multiple genome scans, and for testing the heterogeneity of the results of each bin across scans. The program provides as an output the average of ranks and three heterogeneity statistics, as well as corresponding significance levels. Statistical inferences are based on Monte Carlo permutation tests. The program allows both unweighted and weighted analysis, with the weights for each study as specified by the user. Furthermore, the program performs heterogeneity analyses restricted to the bins with similar average ranks. AVAILABILITY: http://biomath.med.uth.gr. Elias Zintzaras, John P. A. Ioannidis |
Bioinform. | 1 |
| 1994 | Growing a classification tree using the apparent misclassification rateabstractA method to determine the size of a classification tree is proposed. This method is based on the change of the apparent misclassification rate (AMR) of the tree at each growing stage. The method is simple and fast compared to the other classification tree methods, which are based on minimizing a cost complexity function. To test the method, it was used to classify species of fungi, and the results are in good agreement with those obtained by linear discriminant analysis. Also, 21 proteins with known structures and functions were classified using the proposed method. For this purpose the coefficient of variation for several properties of the secondary structures of these proteins has been used. Again, the results were in good agreement with the classification obtained previously using dynamic programming. Elias Zintzaras, Nigel P. Brown, Axel Kowald |
Comput. Appl. Biosci. | 1 |