Apostolos Axenopoulos

Apostolos Axenopoulos

Auto-generated profile, based on publicly available information

Apostolos Axenopoulos

Information Technologies Institute, Centre for Research and Technology Hellas, Thessaloniki 57001, Greece

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 July 2009 in International Journal of Computer Vision
Verified
Journal Article
Closed access
PDF file
PDPetros Daras
Petros Daras
AAApostolos Axenopoulos
Apostolos Axenopoulos

20 January 2021 in Bioinformatics
Verified
Journal Article
Closed access
PDF file
SMStelios K Mylonas
Stelios K Mylonas
AAApostolos Axenopoulos
Apostolos Axenopoulos
PDPetros Daras
Petros Daras
The knowledge of potentially druggable binding sites on proteins is an important preliminary step toward the discovery of novel drugs. The computational prediction of such areas can be boosted by following the recent major advances in the deep learning field and by exploiting the increasing availability of proper data. In this article, a novel computational method for the prediction of potential binding sites is proposed, called DeepSurf. DeepSurf combines a surface-based representation, where a number of 3D voxelized grids are placed on the protein’s surface, with state-of-the-art deep learning architectures. After being trained on the large database of scPDB, DeepSurf demonstrates superior results on three diverse testing datasets, by surpassing all its main deep learning-based competitors, while attaining competitive performance to a set of traditional non-data-driven approaches. The source code of the method along with trained models are freely available at https://github.com/stemylonas/DeepSurf.git. Supplementary data are available at Bioinformatics online.

1 April 2013 in Signal Processing: Image Communication
Verified
Journal Article
Closed access
MLMichalis Lazaridis
Michalis Lazaridis
AAApostolos Axenopoulos
Apostolos Axenopoulos
DRDimitrios Rafailidis
Dimitrios Rafailidis
PDPetros Daras
Petros Daras

4 February 2025 in Bioinformatics
Verified
Journal Article
Open access
APAngelos Michail Papadopoulos
Angelos Michail Papadopoulos
AAApostolos Axenopoulos
Apostolos Axenopoulos
AIAnastasia Iatrou
Anastasia Iatrou
KSKostas Stamatopoulos
Kostas Stamatopoulos
FAFederico Alvarez
Federico Alvarez
PDPetros Daras
Petros Daras
Motivation: Identifying antibody binding sites, is crucial for developing vaccines and therapeutic antibodies, processes that are time-consuming and costly. Accurate prediction of the paratope’s binding site can speed up the development by improving our understanding of antibody–antigen interactions. Results: We present ParaSurf, a deep learning model that significantly enhances paratope prediction by incorporating both surface geometric and non-geometric factors. Trained and tested on three prominent antibody–antigen benchmarks, ParaSurf achieves state-of-the-art results across nearly all metrics. Unlike models restricted to the variable region, ParaSurf demonstrates the ability to accurately predict binding scores across the entire Fab region of the antibody. Additionally, we conducted an extensive analysis using the largest of the three datasets employed, focusing on three key components: (i) a detailed evaluation of paratope prediction for each complementarity-determining region loop, (ii) the performance of models trained exclusively on the heavy chain, and (iii) the results of training models solely on the light chain without incorporating data from the heavy chain. Availability and implementation: Source code for ParaSurf, along with the datasets used, preprocessing pipeline, and trained model weights, are freely available at https://github.com/aggelos-michael-papadopoulos/ParaSurf.

21 April 2011 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
AAApostolos Axenopoulos
Apostolos Axenopoulos
PDPetros Daras
Petros Daras
GPGeorgios Papadopoulos
Georgios Papadopoulos
EHElias Houstis
Elias Houstis
This paper presents a novel approach for fast rigid docking of proteins based on geometric complementarity. After extraction of the 3D molecular surface, a set of local surface patches is generated based on the local surface curvature. The shape complementarity between a pair of patches is calculated using an efficient shape descriptor, the Shape Impact Descriptor. The key property of the Shape Impact Descriptor is its rotation invariance, which obviates the need for taking an exhaustive set of rotations for each pair of patches. Thus, complementarity matching between two patches is reduced to a simple histogram matching. Finally, a condensed set of almost complementary pairs of surface patches is supplied as input to the final scoring step, where each pose is evaluated using a 3D distance grid. The experimental results prove that the proposed method demonstrates superior performance over other well-known geometry-based, rigid-docking approaches.

30 November 2012 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
AAApostolos Axenopoulos
Apostolos Axenopoulos
PDPetros Daras
Petros Daras
GPGeorgios E. Papadopoulos
Georgios E. Papadopoulos
EHElias N. Houstis
Elias N. Houstis
In this paper, a framework for protein-protein docking is proposed, which exploits both shape and physicochemical complementarity to generate improved docking predictions. Shape complementarity is achieved by matching local surface patches. However, unlike existing approaches, which are based on single-patch or two-patch matching, we developed a new algorithm that compares simultaneously, groups of neighboring patches from the receptor with groups of neighboring patches from the ligand. Taking into account the fact that shape complementarity in protein surfaces is mostly approximate rather than exact, the proposed group-based matching algorithm fits perfectly to the nature of protein surfaces. This is demonstrated by the high performance that our method achieves especially in the case where the unbound structures of the proteins are considered. Additionally, several physicochemical factors, such as desolvation energy, electrostatic complementarity (EC), hydrophobicity (HP), Coulomb potential (CP), and Lennard-Jones potential are integrated using an optimized scoring function, improving geometric ranking in more than 60 percent of the complexes of Docking Benchmark 2.4.