Gökçe Uludoğan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Gökçe Uludoğan has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Arzucan Özgür
Department of Computer Engineering, Boğaziçi University, İstanbul, Turkey
2 shared publications - Elif Ozkirimli
Roche Informatics, F. Hoffmann-La Roche AG, Basel, 4070, Switzerland
2 shared publications Arzucan Özgür
Department of Computer Engineering, Boğaziçi University, Bebek, İstanbul, 34342, Turkey
1 shared publication- Asu Busra Temizer
Department of Pharmaceutical Chemistry Institute of Health Sciences, Istanbul University Istanbul Turkey
1 shared publication Buse Giledereli
Department of Computer Engineering, Boğaziçi University, Bebek, İstanbul, 34342, Turkey
1 shared publication- Kutlu Ozergin Ulgen
Department of Chemical Engineering Bogazici University Istanbul Turkey
1 shared publication
Latest Publications
- Open Access
- 1 July 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (Supplement)
PUFFIN: protein unit discovery with functional supervision.
Proteins carry out biological functions through the coordinated action of groups of residues organized into structural arrangements. These arrangements, which we refer to as protein units, exist at an intermediate scale, being larger than individual residues yet smaller than entire proteins. A deeper understanding of protein function can be achieved by identifying these units and their associations with function. However, existing approaches either focus on residue-level signals, rely on curated annotations, or segment protein structures without incorporating functional information, thereby limiting interpretable analysis of structure-function relationships. We introduce PUFFIN, a data-driven framework for discovering protein units by jointly learning structural partitioning and functional supervision. PUFFIN represents proteins as residue-level structure graphs and applies a graph neural network with a structure-aware pooling mechanism that partitions each protein into multiresidue units, with functional supervision that shapes the partition. We show that the learned units are structurally coherent, exhibit organized associations with molecular function, and show meaningful correspondence with curated InterPro annotations. Together, these results demonstrate that PUFFIN provides an interpretable framework for analyzing structure-function relationships using learned protein units and their statistical function associations. We made our source code available at github.com/boun-tabi-lifelu/puffin.
- 1 July 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (Supplement)
Open AccessPUFFIN: protein unit discovery with functional supervision.
Proteins carry out biological functions through the coordinated action of groups of residues organized into structural arrangements. These arrangements, which we refer to as protein units, exist at an intermediate scale, being larger than individual residues yet smaller than entire proteins. A deeper understanding of protein function can be achieved by identifying these units and their associations with function. However, existing approaches either focus on residue-level signals, rely on curated annotations, or segment protein structures without incorporating functional information, thereby limiting interpretable analysis of structure-function relationships. We introduce PUFFIN, a data-driven framework for discovering protein units by jointly learning structural partitioning and functional supervision. PUFFIN represents proteins as residue-level structure graphs and applies a graph neural network with a structure-aware pooling mechanism that partitions each protein into multiresidue units, with functional supervision that shapes the partition. We show that the learned units are structurally coherent, exhibit organized associations with molecular function, and show meaningful correspondence with curated InterPro annotations. Together, these results demonstrate that PUFFIN provides an interpretable framework for analyzing structure-function relationships using learned protein units and their statistical function associations. We made our source code available at github.com/boun-tabi-lifelu/puffin.
- Open Access
- 25 March 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (4)
STAR-GO: improving protein function prediction by learning to hierarchically integrate ontology-informed semantic embeddings
Motivation: Accurate prediction of protein function is essential for elucidating molecular mechanisms and advancing biological and therapeutic discovery. Yet experimental annotation lags far behind the rapid growth of protein sequence data. Computational approaches address this gap by associating proteins with Gene Ontology (GO) terms, which encode functional knowledge through hierarchical relations and textual definitions. However, existing models often emphasize one modality over the other, limiting their ability to generalize, particularly to unseen or newly introduced GO terms that frequently arise as the ontology evolves, and making the previously trained models outdated. Results: We present STAR-GO, a Transformer-based framework that jointly models the semantic and structural characteristics of GO terms to enhance zero-shot protein function prediction. STAR-GO integrates textual definitions with ontology graph structure to learn unified GO representations, which are processed in hierarchical order to propagate information from general to specific terms. These representations are then aligned with protein sequence embeddings to capture sequence–function relationships. STAR-GO achieves state-of-the-art performance and superior zero-shot generalization, demonstrating the utility of integrating semantics and structure for robust and adaptable protein function prediction. Availability: Code and pre-trained models are available at https://github.com/boun-tabi-lifelu/stargo, https://doi.org/10.5281/zenodo.18643082
- 25 March 2026
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 42 (4)
Open AccessSTAR-GO: improving protein function prediction by learning to hierarchically integrate ontology-informed semantic embeddings
Motivation: Accurate prediction of protein function is essential for elucidating molecular mechanisms and advancing biological and therapeutic discovery. Yet experimental annotation lags far behind the rapid growth of protein sequence data. Computational approaches address this gap by associating proteins with Gene Ontology (GO) terms, which encode functional knowledge through hierarchical relations and textual definitions. However, existing models often emphasize one modality over the other, limiting their ability to generalize, particularly to unseen or newly introduced GO terms that frequently arise as the ontology evolves, and making the previously trained models outdated. Results: We present STAR-GO, a Transformer-based framework that jointly models the semantic and structural characteristics of GO terms to enhance zero-shot protein function prediction. STAR-GO integrates textual definitions with ontology graph structure to learn unified GO representations, which are processed in hierarchical order to propagate information from general to specific terms. These representations are then aligned with protein sequence embeddings to capture sequence–function relationships. STAR-GO achieves state-of-the-art performance and superior zero-shot generalization, demonstrating the utility of integrating semantics and structure for robust and adaptable protein function prediction. Availability: Code and pre-trained models are available at https://github.com/boun-tabi-lifelu/stargo, https://doi.org/10.5281/zenodo.18643082
- Open Access
- 23 January 2024
- Published by Wiley in Molecular Informatics
- Vol. 43 (3)
Exploring data‐driven chemical SMILES tokenization approaches to identify key protein–ligand binding moieties
Machine learning models have found numerous successful applications in computational drug discovery. A large body of these models represents molecules as sequences since molecular sequences are easily available, simple, and informative. The sequence‐based models often segment molecular sequences into pieces called chemical words, analogous to the words that make up sentences in human languages, and then apply advanced natural language processing techniques for tasks such as de novo drug design, property prediction, and binding affinity prediction. However, the chemical characteristics and significance of these building blocks, chemical words, remain unexplored. To address this gap, we employ data‐driven SMILES tokenization techniques such as Byte Pair Encoding, WordPiece, and Unigram to identify chemical words and compare the resulting vocabularies. To understand the chemical significance of these words, we build a language‐inspired pipeline that treats high affinity ligands of protein targets as documents and selects key chemical words making up those ligands based on tf–idf weighting. The experiments on multiple protein–ligand affinity datasets show that despite differences in words, lengths, and validity among the vocabularies generated by different subword tokenization algorithms, the identified key chemical words exhibit similarity. Further, we conduct case studies on a number of target to analyze the impact of key chemical words on binding. We find that these key chemical words are specific to protein targets and correspond to known pharmacophores and functional groups. Our approach elucidates chemical properties of the words identified by machine learning models and can be used in drug discovery studies to determine significant chemical moieties.
- 23 January 2024
- Published by Wiley in Molecular Informatics
- Vol. 43 (3)
Open AccessExploring data‐driven chemical SMILES tokenization approaches to identify key protein–ligand binding moieties
Machine learning models have found numerous successful applications in computational drug discovery. A large body of these models represents molecules as sequences since molecular sequences are easily available, simple, and informative. The sequence‐based models often segment molecular sequences into pieces called chemical words, analogous to the words that make up sentences in human languages, and then apply advanced natural language processing techniques for tasks such as de novo drug design, property prediction, and binding affinity prediction. However, the chemical characteristics and significance of these building blocks, chemical words, remain unexplored. To address this gap, we employ data‐driven SMILES tokenization techniques such as Byte Pair Encoding, WordPiece, and Unigram to identify chemical words and compare the resulting vocabularies. To understand the chemical significance of these words, we build a language‐inspired pipeline that treats high affinity ligands of protein targets as documents and selects key chemical words making up those ligands based on tf–idf weighting. The experiments on multiple protein–ligand affinity datasets show that despite differences in words, lengths, and validity among the vocabularies generated by different subword tokenization algorithms, the identified key chemical words exhibit similarity. Further, we conduct case studies on a number of target to analyze the impact of key chemical words on binding. We find that these key chemical words are specific to protein targets and correspond to known pharmacophores and functional groups. Our approach elucidates chemical properties of the words identified by machine learning models and can be used in drug discovery studies to determine significant chemical moieties.