ВинаР - Репозиторијум Института за нуклеарне науке Винча
    • English
    • Српски
    • Српски (Serbia)
  • Српски (ћирилица) 
    • Енглески
    • Српски (ћирилица)
    • Српски (латиница)
  • Пријава
Преглед записа 
  •   ВинаР
  • Vinča
  • Radovi istraživača
  • Преглед записа
  •   ВинаР
  • Vinča
  • Radovi istraživača
  • Преглед записа
JavaScript is disabled for your browser. Some features of this site may not work without it.

Prediction of GO terms for IDPs based on highly connected components in PPI networks

Thumbnail
2021
Преузимање 🢃
Conference article [PDF] (1.343Mb)
Аутори
Grbić, Milana
Gemović, Branislava
Davidović, Radoslav
Kartelj, Aleksandar
Matić, Dragan
Конференцијски прилог (Објављена верзија)
Метаподаци
Приказ свих података о документу
Апстракт
Partitioning large biological networks can help biologists to retrieve new information for particular biological structures. In literature, various methods for partitioning and clustering biological networks have been proposed. The aim of such a network partitioning is to retrieve smaller structures which are easier to analyse, but still containing important information about relations between the network elements. Highly connected deletion problem is one of such network partitioning, with the aim to partition a network into highly connected components (hcd components) by deleting minimum number of edges. A network component with n nodes is a hcd component if the degree of every vertex is larger than n/2. For the purpose of this research, we used a specially constructed local search based heuristic approach to identify hcd components. Dealing with protein-protein interaction (PPI) networks, it has been noticed that proteins from the same hcd component in a network have same Gene Ontolo...gy (GO) annotations. Based on that, we proposed a new method for prediction of GO annotations, which consists of the following steps: (a) starting PPI network is partitioned to hcd components; (b) the obtained hcd components are expanded by proteins which became singletons in the partition set; (c) the newly formed extended hcd components are the subject of further enrichment analysis in DiNGO tool, which returns a list of existing GO terms for proteins from the considered extended component; (d) after propagation through GO hierarchy, the extended list of GO is obtained; (e) each protein from the extended hcd component is annotated by a number of GO terms obtained from the previous step; The proposed method is tested on the data from CAFA-3 challenge. Comparing the F1-measure of the obtained results, a combination of parameters (type of extension, cutoff for enrichment analysis and maximum number of GO terms) with the best performances is selected for the further usage. The method with the selected parameters was further applied on a class of Intrinsically Disordered Proteins (IDP). Preliminary results indicate that this method can be useful for proposing new GO terms for IDP proteins.

Кључне речи:
hcd components / GO terms / enrichment analysis / protein function annotation
Извор:
Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts, 2021, 43, 1, 112-112
Издавач:
  • Department of Biology and Ecology : Faculty of Sciences University of Novi Sad
Напомена:
  • Biologia Serbica : Belgrade BioInformatics Conference : 21-25 June, 2021, Vinča.

ISSN: 2334-6590

[ Google Scholar ]
Handle
https://hdl.handle.net/21.15107/rcub_vinar_11017
URI
https://vinar.vin.bg.ac.rs/handle/123456789/11017
Колекције
  • 180 - Laboratorija za bioinformatiku i računarsku hemiju
  • Radovi istraživača
Институција/група
Vinča
TY  - CONF
AU  - Grbić, Milana
AU  - Gemović, Branislava
AU  - Davidović, Radoslav
AU  - Kartelj, Aleksandar
AU  - Matić, Dragan
PY  - 2021
UR  - https://vinar.vin.bg.ac.rs/handle/123456789/11017
AB  - Partitioning large biological networks can help biologists to retrieve new information for particular biological structures. In literature, various methods for partitioning and clustering biological networks have been proposed. The aim of such a network partitioning is to retrieve smaller structures which are easier to analyse, but still containing important information about relations between the network elements. Highly connected deletion problem is one of such network partitioning, with the aim to partition a network into highly connected components (hcd components) by deleting minimum number of edges. A network component with n nodes is a hcd component if the degree of every vertex is larger than n/2. For the purpose of this research, we used a specially constructed local search based heuristic approach to identify hcd components. Dealing with protein-protein interaction (PPI) networks, it has been noticed that proteins from the same hcd component in a network have same Gene Ontology (GO) annotations. Based on that, we proposed a new method for prediction of GO annotations, which consists of the following steps: (a) starting PPI network is partitioned to hcd components; (b) the obtained hcd components are expanded by proteins which became singletons in the partition set; (c) the newly formed extended hcd components are the subject of further enrichment analysis in DiNGO tool, which returns a list of existing GO terms for proteins from the considered extended component; (d) after propagation through GO hierarchy, the extended list of GO is obtained; (e) each protein from the extended hcd component is annotated by a number of GO terms obtained from the previous step; The proposed method is tested on the data from CAFA-3 challenge. Comparing the F1-measure of the obtained results, a combination of parameters (type of extension, cutoff for enrichment analysis and maximum number of GO terms) with the best performances is selected for the further usage. The method with the selected parameters was further applied on a class of Intrinsically Disordered Proteins (IDP). Preliminary results indicate that this method can be useful for proposing new GO terms for IDP proteins.
PB  - Department of Biology and Ecology : Faculty of Sciences University of Novi Sad
C3  - Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts
T1  - Prediction of GO terms for IDPs based on highly connected components in PPI networks
VL  - 43
IS  - 1
SP  - 112
EP  - 112
UR  - https://hdl.handle.net/21.15107/rcub_vinar_11017
ER  - 
@conference{
author = "Grbić, Milana and Gemović, Branislava and Davidović, Radoslav and Kartelj, Aleksandar and Matić, Dragan",
year = "2021",
abstract = "Partitioning large biological networks can help biologists to retrieve new information for particular biological structures. In literature, various methods for partitioning and clustering biological networks have been proposed. The aim of such a network partitioning is to retrieve smaller structures which are easier to analyse, but still containing important information about relations between the network elements. Highly connected deletion problem is one of such network partitioning, with the aim to partition a network into highly connected components (hcd components) by deleting minimum number of edges. A network component with n nodes is a hcd component if the degree of every vertex is larger than n/2. For the purpose of this research, we used a specially constructed local search based heuristic approach to identify hcd components. Dealing with protein-protein interaction (PPI) networks, it has been noticed that proteins from the same hcd component in a network have same Gene Ontology (GO) annotations. Based on that, we proposed a new method for prediction of GO annotations, which consists of the following steps: (a) starting PPI network is partitioned to hcd components; (b) the obtained hcd components are expanded by proteins which became singletons in the partition set; (c) the newly formed extended hcd components are the subject of further enrichment analysis in DiNGO tool, which returns a list of existing GO terms for proteins from the considered extended component; (d) after propagation through GO hierarchy, the extended list of GO is obtained; (e) each protein from the extended hcd component is annotated by a number of GO terms obtained from the previous step; The proposed method is tested on the data from CAFA-3 challenge. Comparing the F1-measure of the obtained results, a combination of parameters (type of extension, cutoff for enrichment analysis and maximum number of GO terms) with the best performances is selected for the further usage. The method with the selected parameters was further applied on a class of Intrinsically Disordered Proteins (IDP). Preliminary results indicate that this method can be useful for proposing new GO terms for IDP proteins.",
publisher = "Department of Biology and Ecology : Faculty of Sciences University of Novi Sad",
journal = "Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts",
title = "Prediction of GO terms for IDPs based on highly connected components in PPI networks",
volume = "43",
number = "1",
pages = "112-112",
url = "https://hdl.handle.net/21.15107/rcub_vinar_11017"
}
Grbić, M., Gemović, B., Davidović, R., Kartelj, A.,& Matić, D.. (2021). Prediction of GO terms for IDPs based on highly connected components in PPI networks. in Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts
Department of Biology and Ecology : Faculty of Sciences University of Novi Sad., 43(1), 112-112.
https://hdl.handle.net/21.15107/rcub_vinar_11017
Grbić M, Gemović B, Davidović R, Kartelj A, Matić D. Prediction of GO terms for IDPs based on highly connected components in PPI networks. in Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts. 2021;43(1):112-112.
https://hdl.handle.net/21.15107/rcub_vinar_11017 .
Grbić, Milana, Gemović, Branislava, Davidović, Radoslav, Kartelj, Aleksandar, Matić, Dragan, "Prediction of GO terms for IDPs based on highly connected components in PPI networks" in Biologia Serbica : Belgrade BioInformatics Conference : BelBi2021 : Book of Abstracts, 43, no. 1 (2021):112-112,
https://hdl.handle.net/21.15107/rcub_vinar_11017 .

DSpace software copyright © 2002-2015  DuraSpace
О репозиторијуму ВинаР | Пошаљите запажања

re3dataOpenAIRERCUB
 

 

Комплетан репозиторијумГрупеАуториНасловиТемеОва институцијаАуториНасловиТеме

Статистика

Преглед статистика

DSpace software copyright © 2002-2015  DuraSpace
О репозиторијуму ВинаР | Пошаљите запажања

re3dataOpenAIRERCUB