UP FAMNIT successful with three new research projects
- Home
- About university
- News and announcements
- UP FAMNIT successful with three new research projects
UP FAMNIT researchers were successful with their application for new research projects co-funded by the Slovenian Research Agency (ARRS) in the frame of the ERC Complementary Scheme. Its goal is to provide incentives for those applicants from Slovenian research organizations who were positively assessed by the European Research Council (ERC)' peer review process, but nonetheless not approved for co-financing. The agency shall co-finance those adjusted research projects corresponding with main objectives of the original proposal which had reached the specific threshold in the ERC review process. The objective of this scheme is to obtain favorable conditions for refining both researcher’s scientific excellence and the original idea of the project with a view to apply for and obtain an ERC grant.
UP FAMNIT has obtained three out of ten co-financed projects to be implemented in the period 1 June 2021–31 May 2024. Each project has a budget of 150.000 EUR.
Principal investigators of the approved basic projects are: Prof. István Kovács, PhD, Prof. Dušanka Janežič, PhD and Prof. Bojan Kuzma, PhD.
We congratulate our researchers and wish them successful work in the future!
Combinatorial structures with a high level of symmetry are often explored in applications to both natural and social sciences. In some of these applications there is a demand to compare two objects effectively. A mathematical model capturing this situation is a finite graph with non-trivial symmetries, and the underlying mathematical discipline is algebraic graph theory (AGT).
The symmetry of a graph is measured by its automorphism group and the alikeness of objects is expressed by the concept of a graph isomorphism.
In the core of ATIFG lies the Cayley isomorphism problem, a well-known and long-standing open problem in AGT. In the proposal we outline several (sub)-problems, which will serve as mile-stones in the final solution.
This project is at the forefront of current research trends in the field of molecular modeling. We will develop new molecular modeling methods based on chemical graph theory, a branch of mathematical chemistry dealing with discrete structures in chemistry.
A special focus will be on the development of new algorithms for the prediction of protein binding sites (ProBiS) and new web tools for modeling of pharmaceutically interesting molecules - ProBiS Tools (algorithm, database, web server).
The ProBiS Tools will be the first to allow the identification of interactions between protein structures, the prediction of ligand selectivity and binding, and the monitoring of the effects of conserved waters and sequence variants on ligand binding, to surpass human involvement in drug design.
We aim to develop a free web-based protein interaction atlas to predict genetic variations involved in drug interactions and disease development - ProBiS-ATLAS of all available protein binding sites in the PDB with mapped ligands and sequence variants. The atlas will also include information on the effects of sequence variants on binding for each specific ligand in the PDB. This newly developed approach will be particularly useful in the context of precision medicine.
Our ProBiS Tools will make it possible to combine several otherwise unrelated fields of research, i.e. graph theoretical approaches, genome sequence studies, protein structures and molecular dynamics simulation.
Despite the great potential for the concrete application of our results in specific technological and industrial sectors, the main focus of our research is still on the development of general, new mathematical methods and algorithms in the field of molecular modeling, and thus represents a contribution to the overall scientific knowledge.
The project involves a number of researchers with excellent publishing records, currently working in Slovenia guaranteeing research at the highest possible level.
The proposed project is roughly divided into 4 parts and belongs to the theory of graphs induced by relations and general preservers on:
In particular we aim to: