Demo Data from VLDB 2026 / reviewers in the wild / expert
Negin Malekian
dblp:187/3494
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-6763-7063ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
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 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › protein sequence analysis
amino acid substitution matrix |
1.0 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Bioinformatics and computational biology
protein sequence analysis |
1.0 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Bioinformatics and computational biology › protein structure prediction
alphafold-predicted structures |
0.3 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Bioinformatics and computational biology
multiple sequence alignment |
0.3 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Bioinformatics and computational biology
protein structure prediction |
0.3 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Bioinformatics and computational biology
sequence alignment |
0.3 | 1 | 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structures · Bioinform. 2026 |
Methods — techniques the papers use, named apart from their topics
protein language model embeddings · 1.0BLOSUM methodology · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Much ado about nothing: modeling amino acid replacement with predicted protein structuresabstractMOTIVATION: Substitution matrices like BLOSUM62 model the likelihood of replacement of amino acids in evolution. Substitution matrices are used in protein sequence alignment tasks. Since the introduction of BLOSUM62 over three decades ago, many matrices have been released. Yet, to date, no effort uses large amounts of 3D structures predicted by AlphaFold. RESULTS: Here, we define AFSM, the AlphaFold Substitution Matrix derived from over 20 000 predicted 3D structures following the BLOSUM methodology. We benchmark AFSM against BLOSUM62 and 16 other matrices on five tasks in multiple sequence alignment (MSA) and protein homology search. Our analysis surprisingly reveals that all matrix families perform similarly. Only when there are few sequences in an MSA do BLOSUM62 and AFSM perform better than using no matrix. This suggests that substitution matrices were most beneficial when there was little sequence data. We corroborate this argument by showing that embeddings, which are computed from billions of sequences, perform better than substitution matrices, when sequence data is sparse. Taken together, this suggests that structural data does not improve BLOSUM62. But increased sequence data makes extrapolation with substitution matrices obsolete. Nonetheless, BLOSUM62 continues to capture chemists' intuition on amino acids by providing numerical values implicitly reflecting physicochemical properties, and it remains indispensable for sparse MSAs and direct comparison of two sequences. AVAILABILITY AND IMPLEMENTATION: Data is available from doi.org/10.5281/zenodo.18777546. Lukas Buschmann, Sarah Naomi Bolz, Ferras el-Hendi, Negin Malekian, Michael Schroeder 0001 |
Bioinform. | 4 |
| 2023 | Netrank: network-based approach for biomarker discoveryabstractBACKGROUND: Integrating multi-omics data is fast becoming a powerful approach for predicting disease progression and treatment outcomes. In light of that, we introduce a modified version of the NetRank algorithm, a network-based algorithm for biomarker discovery that incorporates the protein associations, co-expressions, and functions with its phenotypic association to differentiate different types of cancer. NetRank is introduced here as a robust feature selection method for biomarker selection in cancer prediction. We assess the robustness and suitability of the RNA gene expression data through scanning genomic data for 19 cancer types with more than 3000 patients from The Cancer Genome Atlas (TCGA). RESULTS: The results of evaluating different cancer type profiles from the TCGA data demonstrate the strength of our approach to identifying interpretable biomarker signatures for cancer outcome prediction. NetRank's biomarkers segregate most cancer types with an area under the curve (AUC) above 90% using compact signatures. CONCLUSION: In this paper we provide a fast and efficient implementation of NetRank, with a case study from The Cancer Genome Atlas, to assess the performance. We incorporated complete functionality for pre and post-processing for RNA-seq gene expression data with functions for building protein-protein interaction networks. The source code of NetRank is freely available (at github.com/Alfatlawi/Omics-NetRank) with an installable R library. We also deliver a comprehensive practical user manual with examples and data attached to this paper. Ali H. Al-Fatlawi, Eka Rusadze, Alexander Shmelkin, Negin Malekian, Cigdem Ozen, Christian Pilarsky, Michael Schroeder 0001 |
BMC Bioinform. | 4 |