Navigating Homogeneous Graph Paths Through Amyloidogenic and Non‐Amyloidogenic Hexapeptides

Hexapeptides are increasingly applied as model systems for studying the amyloidogenic properties of oligo- and polypeptides. It is possible to construct 64 million different hexapeptides from the twenty proteinogenic amino acid residues. Today's experimental amyloid databases contain only a fraction of these annotated hexapeptides. For labeling all the possible hexapeptides as "amyloidogenic" or "non-amyloidogenic" there exist several computational predictors with good accuracy. It may be of interest to define and study a simple graph structure on the 64 million hexapeptides as nodes, when two hexapeptides are connected by an edge if they differ by only a single residue. For example, in this graph, HIKKLM is connected to AIKKLM, or HIKKNM, or HIKKLC, but it is not connected with an edge to VVKKLM or HIKNPM. In the present contribution, we consider our previously published artificial intelligence-based tool, the Budapest Amyloid Predictor (BAP for short), and demonstrate a spectacular property of this predictor in the graph defined above. We show that for any two hexapeptides predicted to be "amyloidogenic" by the BAP predictor, there exists an easily constructible path of length at most six that passes through neighboring hexapeptides all predicted to be "amyloidogenic" by BAP. For example, the predicted amyloidogenic ILVWIW and FWLCYL hexapeptides can be connected through the length-6 path ILVWIW-IWVWIW-IWVCIW-IWVCIL-FWVCIL-FWLCIL-FWLCYL in such a way that the neighbors differ in exactly one residue, and all hexapeptides on the path are predicted to be amyloidogenic by BAP. The symmetric statement also holds true for non-amyloidogenic predicted hexapeptides: For any such pair, there exists a path of length at most six, traversing only predicted non-amyloidogenic hexapeptides. It is noted that the mentioned property of the Budapest Amyloid Predictor https://pitgroup.org/bap is not proprietary; it is also true for any linear Support Vector Machine (SVM)-based predictors; therefore, for any future improvements of BAP using the linear SVM prediction technique.

Authors

Institutions

Publication Details

Journal
Journal of Computational Chemistry
Published
2025-10-03
DOI
https://doi.org/10.1002/jcc.70238
Primary Topic
Alzheimer's disease research and treatments
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Navigating Homogeneous Graph Paths Through Amyloidogenic and Non‐Amyloidogenic Hexapeptides

László Keresztes, Bálint Varga, Viktor Farkas, Vince Grolmusz et al.
Journal of Computational Chemistry
Alzheimer's disease research and treatments
article

Navigating Homogeneous Graph Paths Through Amyloidogenic and Non‐Amyloidogenic Hexapeptides

László Keresztes, Bálint Varga, Viktor Farkas, Vince Grolmusz, András Perczel, Evelin Szögi
article en

Abstract

Hexapeptides are increasingly applied as model systems for studying the amyloidogenic properties of oligo- and polypeptides. It is possible to construct 64 million different hexapeptides from the twenty proteinogenic amino acid residues. Today's experimental amyloid databases contain only a fraction of these annotated hexapeptides. For labeling all the possible hexapeptides as "amyloidogenic" or "non-amyloidogenic" there exist several computational predictors with good accuracy. It may be of interest to define and study a simple graph structure on the 64 million hexapeptides as nodes, when two hexapeptides are connected by an edge if they differ by only a single residue. For example, in this graph, HIKKLM is connected to AIKKLM, or HIKKNM, or HIKKLC, but it is not connected with an edge to VVKKLM or HIKNPM. In the present contribution, we consider our previously published artificial intelligence-based tool, the Budapest Amyloid Predictor (BAP for short), and demonstrate a spectacular property of this predictor in the graph defined above. We show that for any two hexapeptides predicted to be "amyloidogenic" by the BAP predictor, there exists an easily constructible path of length at most six that passes through neighboring hexapeptides all predicted to be "amyloidogenic" by BAP. For example, the predicted amyloidogenic ILVWIW and FWLCYL hexapeptides can be connected through the length-6 path ILVWIW-IWVWIW-IWVCIW-IWVCIL-FWVCIL-FWLCIL-FWLCYL in such a way that the neighbors differ in exactly one residue, and all hexapeptides on the path are predicted to be amyloidogenic by BAP. The symmetric statement also holds true for non-amyloidogenic predicted hexapeptides: For any such pair, there exists a path of length at most six, traversing only predicted non-amyloidogenic hexapeptides. It is noted that the mentioned property of the Budapest Amyloid Predictor https://pitgroup.org/bap is not proprietary; it is also true for any linear Support Vector Machine (SVM)-based predictors; therefore, for any future improvements of BAP using the linear SVM prediction technique.

Journal of Computational ChemistryVol. 46(26)
Eötvös Loránd University (HU), Hungarian Astronomical Association (HU)
Nemzeti Kutatási, Fejlesztési és Innovaciós Alap
Openalex Percentile: Top 66%
Alzheimer's disease research and treatments
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.