Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tania Pencheva is active.

Publication


Featured researches published by Tania Pencheva.


BMC Bioinformatics | 2008

AMMOS: Automated Molecular Mechanics Optimization tool for in silico Screening.

Tania Pencheva; David Lagorce; Ilza Pajeva; Bruno O. Villoutreix; Maria A. Miteva

BackgroundVirtual or in silico ligand screening combined with other computational methods is one of the most promising methods to search for new lead compounds, thereby greatly assisting the drug discovery process. Despite considerable progresses made in virtual screening methodologies, available computer programs do not easily address problems such as: structural optimization of compounds in a screening library, receptor flexibility/induced-fit, and accurate prediction of protein-ligand interactions. It has been shown that structural optimization of chemical compounds and that post-docking optimization in multi-step structure-based virtual screening approaches help to further improve the overall efficiency of the methods. To address some of these points, we developed the program AMMOS for refining both, the 3D structures of the small molecules present in chemical libraries and the predicted receptor-ligand complexes through allowing partial to full atom flexibility through molecular mechanics optimization.ResultsThe program AMMOS carries out an automatic procedure that allows for the structural refinement of compound collections and energy minimization of protein-ligand complexes using the open source program AMMP. The performance of our package was evaluated by comparing the structures of small chemical entities minimized by AMMOS with those minimized with the Tripos and MMFF94s force fields. Next, AMMOS was used for full flexible minimization of protein-ligands complexes obtained from a mutli-step virtual screening. Enrichment studies of the selected pre-docked complexes containing 60% of the initially added inhibitors were carried out with or without final AMMOS minimization on two protein targets having different binding pocket properties. AMMOS was able to improve the enrichment after the pre-docking stage with 40 to 60% of the initially added active compounds found in the top 3% to 5% of the entire compound collection.ConclusionThe open source AMMOS program can be helpful in a broad range of in silico drug design studies such as optimization of small molecules or energy minimization of pre-docked protein-ligand complexes. Our enrichment study suggests that AMMOS, designed to minimize a large number of ligands pre-docked in a protein target, can successfully be applied in a final post-processing step and that it can take into account some receptor flexibility within the binding site area.


BMC Chemical Biology | 2009

DG-AMMOS: A New tool to generate 3D conformation of small molecules using Distance Geometry and Automated Molecular Mechanics Optimization for in silico Screening

David Lagorce; Tania Pencheva; Bruno O. Villoutreix; Maria A. Miteva

Background Discovery of new bioactive molecules that could enter drug discovery programs or that could serve as chemical probes is a very complex and costly endeavor. Structure-based and ligand-based in silico screening approaches are nowadays extensively used to complement experimental screening approaches in order to increase the effectiveness of the process and facilitating the screening of thousands or millions of small molecules against a biomolecular target. Both in silico screening methods require as input a suitable chemical compound collection and most often the 3D structure of the small molecules has to be generated since compounds are usually delivered in 1D SMILES, CANSMILES or in 2D SDF formats. Results Here, we describe the new open source program DG-AMMOS which allows the generation of the 3D conformation of small molecules using Distance Geometry and their energy minimization via Automated Molecular Mechanics Optimization. The program is validated on the Astex dataset, the ChemBridge Diversity database and on a number of small molecules with known crystal structures extracted from the Cambridge Structural Database. A comparison with the free program Balloon and the well-known commercial program Omega generating the 3D of small molecules is carried out. The results show that the new free program DG-AMMOS is a very efficient 3D structure generator engine. Conclusion DG-AMMOS provides fast, automated and reliable access to the generation of 3D conformation of small molecules and facilitates the preparation of a compound collection prior to high-throughput virtual screening computations. The validation of DG-AMMOS on several different datasets proves that generated structures are generally of equal quality or sometimes better than structures obtained by other tested methods.


International Journal of Chemical Engineering | 2011

Tuning Genetic Algorithm Parameters to Improve Convergence Time

Maria Angelova; Tania Pencheva

Fermentation processes by nature are complex, time-varying, and highly nonlinear. As dynamic systems their modeling and further high-quality control are a serious challenge. The conventional optimization methods cannot overcome the fermentation processes peculiarities and do not lead to a satisfying solution. As an alternative, genetic algorithms as a stochastic global optimization method can be applied. For the purpose of parameter identification of a fed-batch cultivation of S. cerevisiae altogether four kinds of simple and four kinds of multipopulation genetic algorithms have been considered. Each of them is characterized with a different sequence of implementation of main genetic operators, namely, selection, crossover, and mutation. The influence of the most important genetic algorithm parameters—generation gap, crossover, and mutation rates has—been investigated too. Among the considered genetic algorithm parameters, generation gap influences most significantly the algorithm convergence time, saving up to 40% of time without affecting the model accuracy.


Computers & Mathematics With Applications | 2012

Purposeful model parameters genesis in simple genetic algorithms

Maria Angelova; Krassimir T. Atanassov; Tania Pencheva

Simple genetic algorithms have been investigated aiming to improve the algorithm convergence time. Because of the stochastic nature of genetic algorithms, several runs have to be performed in order to achieve representative results. A procedure for purposeful genesis concerning intervals of variations of model parameters is proposed for a standard simple genetic algorithm, aiming to improve significantly the algorithm effectiveness. Such a stepwise methodology is applied to parameter identification of fed-batch cultivation of S. cerevisiae. The procedure is further validated to a modified simple genetic algorithm with changed sequence of main genetic algorithm operators, namely mutation, crossover and selection, proven to be faster than the standard one. Results obtained from both applications show significant improvement of the algorithm convergence time while saving the model accuracy.


Electronic Journal of Biotechnology | 2007

Multiple model approach to modelling of Escherichia coli fed-batch cultivation extracellular production of bacterial phytase

Olympia Roeva; Tania Pencheva; Stoyan Tzonkov; Michael Arndt; Bernd Hitzmann; Sofia Kleist; Gerchard Miksch; Karl Friehs; Erwin Flaschel

The paper presents the implementation of multiple model approach to modelling of Escherichia coli BL21(DE3)pPhyt109 fed-batch cultivation processes for an extracellular production of bacterial phytase. Due to the complex metabolic pathways of microorganisms, the accurate modelling of bioprocesses is rather difficult. Multiple model approach is an alternative concept which helps in modelling and control of complex processes. The main idea is the development of a model based on simple submodels for the purposes of further high quality process control. The presented simulations of E. coli fed-batch cultivation show how the process could be divided into different functional states and how the model parameters could be obtained easily using genetic algorithms. The obtained results and model verification demonstrate the effectiveness of the applied concept of multiple model approach and of the proposed identification scheme.


IWIFSGN@FQAS | 2016

InterCriteria Analysis Approach to Parameter Identification of a Fermentation Process Model

Tania Pencheva; Maria Angelova; Peter Vassilev; Olympia Roeva

In this investigation recently developed InterCriteria Analysis (ICA) is applied aiming at examination of the influence of a genetic algorithm (GA) parameter in the procedure of a parameter identification of a fermentation process model. Proven as the most sensitive GA parameter, generation gap is in the focus of this investigation. The apparatuses of index matrices and intuitionistic fuzzy sets, laid in the ICA core, are implemented to establish the relations between investigated here generation gap, from one side, and model parameters of fed-batch fermentation process of Saccharomyces cerevisiae, from the other side. The obtained results after ICA application are analysed towards convergence time and model accuracy and some conclusions about observed interactions are derived.


federated conference on computer science and information systems | 2015

InterCriteria Analysis of crossover and mutation rates relations in simple genetic algorithm

Maria Angelova; Olympia Roeva; Tania Pencheva

In this investigation recently developed InterCriteria Analysis (ICA) is applied to examine the influences of two main genetic algorithms parameters - crossover and mutation rates during the model parameter identification of S. cerevisiae and E. coli fermentation processes. The apparatuses of index matrices and intuitionistic fuzzy sets, which are the core of ICA, are used to establish the relations between investigated genetic algorithms parameters, from one hand, and fermentation process model parameters, from the other hand. The obtained results after ICA application are analysed towards convergence time and model accuracy and some conclusions about derived interactions are reported.


European Journal of Medicinal Chemistry | 2010

Post-docking virtual screening of diverse binding pockets: Comparative study using DOCK, AMMOS, X-Score and FRED scoring functions

Tania Pencheva; Oumarou Samna Soumana; Ilza Pajeva; Maria A. Miteva

Most of the benchmark studies on docking-scoring methods reported in the last decade conclude that no single scoring function performs well across different protein targets. In this study a comparison of thirteen commonly used force field and empirical scoring functions as implemented in DOCK, AMMOS, X-Score and FRED is carried out on five proteins with diverse binding pockets. The performance is analyzed in relation to the physicochemical properties of the binding sites. The solvation effects are considered via the Generalized Born/Surface Area (GBSA) solvation method for one of the assessed scoring functions. We examined the ability of these scoring functions to discriminate between active and inactive compounds over receptor-based focused libraries. Our results demonstrated that the employed here empirical scoring functions were more appropriate for the pocket of predominant hydrophobic nature while the force field scoring functions performed better on the mixed or polar pockets.


Global Journal of Technology and Optimization | 2014

Purposeful Model Parameters Genesis in Multi-population Genetic Algorithm

Tania Pencheva; Maria Angelova

In this paper recently proposed procedure for purposeful model parameters genesis, originally developed for simple genetic algorithm, has been validated for multi-population genetic algorithm when it is applied for the purposes of parameter identification of S. cerevisiae fed-batch cultivation. Proposed procedure aims to improve the algorithm effectiveness in respect to the convergence time and model accuracy treating intervals of variations of model parameters. Obtained results after the procedure application show more than 12% improvement of multi-population genetic algorithm convergence time while saving and even slightly meliorating the model accuracy.


ieee international conference on intelligent systems | 2016

Generalized Net model of asymptomatic osteoporosis diagnosing

Simeon Ribagin; Olympia Roeva; Tania Pencheva

Osteoporosis is a growing major public health problem with impact that crosses medical, social, and economic lines. It is now recognized that it is extremely important to diagnose osteoporosis before a fragility fracture occurs. The purpose of the present study is to give an example of application of Generalized Nets in orthopedics and traumatology and to propose a novel approach for diagnosing the asymptomatic osteoporosis in elderly patients.

Collaboration


Dive into the Tania Pencheva's collaboration.

Top Co-Authors

Avatar

Maria Angelova

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Olympia Roeva

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Ilza Pajeva

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Stoyan Tzonkov

Leibniz University of Hanover

View shared research outputs
Top Co-Authors

Avatar

Dessislava Jereva

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Peter Vassilev

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Simeon Ribagin

Bulgarian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Ivanka Tsakovska

Bulgarian Academy of Sciences

View shared research outputs
Researchain Logo
Decentralizing Knowledge