Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/14420
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tenekeci,S. | - |
dc.contributor.author | Tekir,S. | - |
dc.date.accessioned | 2024-05-05T14:59:36Z | - |
dc.date.available | 2024-05-05T14:59:36Z | - |
dc.date.issued | 2024 | - |
dc.identifier.issn | 1476-9271 | - |
dc.identifier.uri | https://doi.org/10.1016/j.compbiolchem.2024.108040 | - |
dc.identifier.uri | https://hdl.handle.net/11147/14420 | - |
dc.description.abstract | Identification of promoters, enhancers, and their interactions helps understand genetic regulation. This study proposes a graph-based semi-supervised learning model (GCN4EPI) for the enhancer-promoter classification problem. We adopt a graph convolutional network (GCN) architecture to integrate interaction information with sequence features. Nodes of the constructed graph hold word embeddings of DNA sequences while edges hold the Enhancer-Promoter Interaction (EPI) information. By means of semi-supervised learning, much less data (16%) and time are needed in model training. Comparisons on a benchmark dataset of six human cell lines show that the proposed approach outperforms the state-of-the-art methods by a large margin (10% higher F1 score) and has the fastest training time (up to 3 times). Moreover, GCN4EPI's performance on cross-cell line data is also better than the baselines (3% higher F1 score). Our qualitative analyses with graph explainability models prove that GCN4EPI learns from both text and graph structure. The results suggest that integrating interaction information with sequence features improves predictive performance and compensates for the number of training instances. © 2024 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier Ltd | en_US |
dc.relation.ispartof | Computational Biology and Chemistry | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Enhancer | en_US |
dc.subject | Graph convolutional networks | en_US |
dc.subject | Natural language processing | en_US |
dc.subject | Promoter | en_US |
dc.subject | Sequence analysis | en_US |
dc.title | Identifying promoter and enhancer sequences by graph convolutional networks | en_US |
dc.type | Article | en_US |
dc.department | Izmir Institute of Technology | en_US |
dc.identifier.volume | 110 | en_US |
dc.identifier.wos | WOS:001209523700001 | - |
dc.identifier.scopus | 2-s2.0-85186593399 | - |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.identifier.doi | 10.1016/j.compbiolchem.2024.108040 | - |
dc.authorscopusid | 57340107000 | - |
dc.authorscopusid | 16234844500 | - |
dc.identifier.wosquality | Q2 | - |
dc.identifier.scopusquality | Q2 | - |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
item.languageiso639-1 | en | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.openairetype | Article | - |
Appears in Collections: | Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
CORE Recommender
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.