Nicola Yanev

prof Nicola Yanev Professor Nicola Yanev
Academic information
Institution 1: Bulgarian Academy of Sciences
Institute: Institut of Mathematics and Informatics(IMI)
Institution 2: South-West University “Neofit Rilski”
Faculty: Faculty of Mathematics and Natural Sciences
Department: Department of Informatics
E-mail: choby@math.bas.bg
Research interests: Bioinformatics, sequence-to-structure and structure-to-structure alignment algorithms, Integer programming, Combinatorial optimization algorithms, Parallel algorithms
Key words: Bioinformatics, Sequence-to-structure and structure-to-structure alignment algorithms, Integer programming
Area: Bioinformatics, sequences alignment algorithms, Integer programming, Combinatorial optimization algorithms
Teaching:
  • Mathematical optimization;
  • Graph theory;
  • Integer (discrete) optimization;
  • Computational biology.
Projects participation
Project: Bioinformatics research:  protein folding, docking and prediction of biological activity
Participated as: Expert
Location: Blagoevgrad, Bulgaria
Funding organization: National Science Fund, Ministry of Education and Science
Date: from 2014-12-12 to 2017-12-12
Project: Bioinformatical research on the structure and activity of proteins and drug-receptor interactions
Participated as: Expert
Location: Blagoevgrad, Bulgaria
Funding organization: National Science Fund, Ministry of Education and Science DVU 01/197 / 16.12.2008 / DOO2-162
Date: from 2009-01-03 to 2012-10-31
Participation in academic, scientific and educational organizations
Organization: Union of Scientists in Bulgaria
Location: Sofia, Bulgaria
Participated as: Member
Description:
Date: from 1990-01
Organization: Union of Bulgarian Mathematicians
Location: Sofia, Bulgaria
Participated as: Member
Description:
Date: from 1965-01
Selected publications
Title: A new classifier for protein fold class recognition.
Year: 2018
Type: Article
Description: Yanev, N., Traykov, M. , Milanov, P., Yurukov, B., C. R. Acad. Bulg. Sci. (Impact Factor: 0.25), 71(7) 885-892.
Title: Algorithm for protein folding problem in 3D lattice HP model.
Year: 2018
Type: Article
Description: Traykov, M., Yanev, N., Mavrevski, R., Yurukov, B.,International Journal of Biology and Biomedicine, 3, 16-21, ISSN: 2367-9085.
Title: Protein Folding Prediction in a Cubic Lattice in Hydrophobic-Polar Model.
Year: 2017
Type: Article
Description: Yanev, N., Traykov, M., Milanov, P., Yurukov, B., Journal of computational biology (Impact Factor: 1.032), 24(5), 412-421.
Title: A new heuristic algorithm for protein folding in the HP model.
Year: 2016
Type: Article
Description: Traykov, M., Angelov, S., Yanev, N., Journal of computational biology (Impact Factor: 1.537), 23(8), 662-668.
Title: Maximum Contact Map Overlap Revisited.
Year: 2011
Type: Article
Description: Andonov, R., Malod-Dognin, N., Yanev, N., Journal of computational biology, 18(1), 27-41.
Title: Solving Maximum Clique Problem for Protein Structure Similarity.
Year: 2010
Type: Article
Description: Malod-Dognin, N., Andonov, R., Yanev N., Serdica Journal of Computing, 4(1), 93-100.
Title: Tabu search approaches for solving the two-group classification problem.
Year: 2009
Type: Article
Description: Hanafi, S., Yanev, N., https://10.1007/s10479-009-0581-9.
Title: A Hybrid Algorithm for the Unbounded Knapsack Problem.
Year: 2009
Type: Article
Description: Poirriez, V., Yanev, N., Andonov, R., Discrete optimisation,6(1), 110-124.
Title: An Efficient Lagrangian Relaxation for the Contact Map Overlap Problem.
Year: 2008
Type: Article
Description: Andonov, R., Yanev, N., Malod-Dognin, N., Lecture Notes in Computer Science, 5251, 162-173.
Title: A dynamic programming –based reduction procedure for the multidimensional 0-1 knapsack problem.
Year: 2008
Type: Article
Description: Balev, S., Yanev, N., Freville, A., Andonov, R., Springer, 186(1), 63-76.
Title: Lagrangian approaches to a  class of matching problems.
Year: 2008
Type: Article
Description: Yanev, N., Veber, P., Andonov, R., Balev, S., Journal of computational and aqpplied mathematics, 55(5), 1054-1067.
Title: Algorithms for three polynomially solvable cases of the lot-size problem.
Year: 1985
Type: Article
Description: Yanev, N., Mikrenska, M., Mathematics and mathematical education (bulg), Sunny Beach 1985,Bulg.Acad. of Sci,Sofia,1985.