Demo Data from SIGIR 2026 / reviewers in the wild / expert
Abbas Roayaei Ardakany
dblp:142/2330
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
1 paper |
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 › epigenomics › chromatin interaction analysis
differential chromatin interaction detection |
0.4 | 1 | 2019 | Selfish: discovery of differential chromatin interactions via a self-similarity measure · Bioinform. 2019 |
Bioinformatics and computational biology › epigenomics
hi-c data analysis |
0.4 | 1 | 2019 | Selfish: discovery of differential chromatin interactions via a self-similarity measure · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
self-similarity measure · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Selfish: discovery of differential chromatin interactions via a self-similarity measureabstractMOTIVATION: High-throughput conformation capture experiments, such as Hi-C provide genome-wide maps of chromatin interactions, enabling life scientists to investigate the role of the three-dimensional structure of genomes in gene regulation and other essential cellular functions. A fundamental problem in the analysis of Hi-C data is how to compare two contact maps derived from Hi-C experiments. Detecting similarities and differences between contact maps are critical in evaluating the reproducibility of replicate experiments and for identifying differential genomic regions with biological significance. Due to the complexity of chromatin conformations and the presence of technology-driven and sequence-specific biases, the comparative analysis of Hi-C data is analytically and computationally challenging. RESULTS: We present a novel method called Selfish for the comparative analysis of Hi-C data that takes advantage of the structural self-similarity in contact maps. We define a novel self-similarity measure to design algorithms for (i) measuring reproducibility for Hi-C replicate experiments and (ii) finding differential chromatin interactions between two contact maps. Extensive experimental results on simulated and real data show that Selfish is more accurate and robust than state-of-the-art methods. AVAILABILITY AND IMPLEMENTATION: https://github.com/ucrbioinfo/Selfish. Abbas Roayaei Ardakany, Ferhat Ay, Stefano Lonardi |
Bioinform. | 1 |
| 2017 | Efficient and Accurate Detection of Topologically Associating Domains from Contact MapsabstractContinuous improvements to high-throughput conformation capture (Hi-C) are revealing richerinformation about the spatial organization of the chromatin and its role in cellular functions.Several studies have confirmed the existence of structural features of the genome 3D organiza-tion that are stable across cell types and conserved across species, calledtopological associatingdomains(TADs). The detection of TADs has become a critical step in the analysis of Hi-C data,e.g., to identify enhancer-promoter associations. Here we presentEast, a novel TAD identifi-cation algorithm based on fast 2D convolution of Haar-like features, that is as accurate as thestate-of-the-art method based on the directionality index, but 75-80x faster.Eastis availablein the public domain at https://github.com/ucrbioinfo/EAST. Abbas Roayaei Ardakany, Stefano Lonardi |
WABI | 1 |
| 2013 | An Extended Local Binary Pattern for Gender ClassificationabstractThis paper addresses the problem of gender recognition by proposing a new feature descriptor to be used in classification. The contribution of this work is an extension to the local binary patterns traditionally used as descriptors. Local binary patterns include information about the relationship between a central pixel value and those of its neighboring pixels in a very compact manner. In the proposed method we incorporate into the descriptor more information from the neighborhood by using four predefined patterns, rather than just one, as in the classic model. We evaluate the performance of our method on the standard FERET database by comparing it to existing methods and show that we can extract more discriminative features and subsequently provide better gender recognition accuracy. Abbas Roayaei Ardakany, Mircea Nicolescu, Monica N. Nicolescu |
ISM | 1 |