Rumen Andonov

Prof. Rumen Andonov


Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2011 in Journal of Computational Biology
Verified
Journal Article
Closed access
RARumen Andonov
Rumen Andonov
NMNoël Malod-Dognin
Noël Malod-Dognin
NYNicola Yanev
Nicola Yanev
Among the measures for quantifying the similarity between three-dimensional (3D) protein structures, maximum contact map overlap (CMO) received sustained attention during the past decade. Despite this, the known algorithms exhibit modest performance and are not applicable for large-scale comparison. This article offers a clear advance in this respect. We present a new integer programming model for CMO and propose an exact branch-and-bound algorithm with bounds obtained by a novel Lagrangian relaxation. The efficiency of the approach is demonstrated on a popular small benchmark (Skolnick set, 40 domains). On this set, our algorithm significantly outperforms the best existing exact algorithms. Many hard CMO instances have been solved for the first time. To further assess our approach, we constructed a large-scale set of 300 protein domains. Computing the similarity measure for any of the 44850 pairs, we obtained a classification in excellent agreement with SCOP. Supplementary Material is available at www.liebertonline.com/cmb .

2 January 2004 in Nucleic Acids Research
Verified
Journal Article
Open access
NZNouri Ben Zakour
Nouri Ben Zakour
MGMichel Gautier
Michel Gautier
RARumen Andonov
Rumen Andonov
DLDominique Lavenier
Dominique Lavenier
MCMarie-Françoise Cochet
Marie-Françoise Cochet
YLYves Le Loir
Yves Le Loir
Genome sequence data can be used to analyze genome plasticity by whole genome PCR scanning. Small sized chromosomes can indeed be fully amplified by long-range PCR with a set of primers designed using a reference strain and applied to several other strains. Analysis of the resulting patterns can reveal the genome plasticity. To facilitate such analysis, we have developed GenoFrag, a software package for the design of primers optimized for whole genome scanning by long-range PCR. GenoFrag was developed for the analysis of Staphylococcus aureus genome plasticity by whole genome amplification in approximately 10 kb-long fragments. A set of primers was generated from the genome sequence of S.aureus N315, employed here as a reference strain. Two subsets of primers were successfully used to amplify two portions of the N315 chromosome. This experimental validation demonstrates that GenoFrag is a robust and reliable tool for primer design and that whole genome PCR scanning can be envisaged for the analysis of genome diversity in S.aureus, one of the major public health concerns worldwide.

29 November 2012 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
IWInken Wohlers
Inken Wohlers
RARumen Andonov
Rumen Andonov
GKGunnar Klau
Gunnar Klau
We present a mathematical model and exact algorithm for optimally aligning protein structures using the DALI scoring model. This scoring model is based on comparing the interresidue distance matrices of proteins and is used in the popular DALI software tool, a heuristic method for protein structure alignment. Our model and algorithm extend an integer linear programming approach that has been previously applied for the related, but simpler, contact map overlap problem. To this end, we introduce a novel type of constraint that handles negative score values and relax it in a Lagrangian fashion. The new algorithm, which we call DALIX, is applicable to any distance matrix-based scoring scheme. We also review options that allow to consider fewer pairs of interresidue distances explicitly because their large number hinders the optimization process. Using four known data sets of varying structural similarity, we compute many provably score-optimal DALI alignments. This allowed, for the first time, to evaluate the DALI heuristic in sound mathematical terms. The results indicate that DALI usually computes optimal or close to optimal alignments. However, we detect a subset of small proteins for which DALI fails to generate any significant alignment, although such alignments do exist.

26 January 2017
Verified
Conference Paper
Open access
PDF file
NPNirmal Prajapati
Nirmal Prajapati
WRWaruna Ranasinghe
Waruna Ranasinghe
SRSanjay Rajopadhye
Sanjay Rajopadhye
RARumen Andonov
Rumen Andonov
HDHristo Djidjev
Hristo Djidjev
TGTobias Grosser
Tobias Grosser
Stencil computations are an important class of compute and data intensive programs that occur widely in scientific and engineeringapplications. A number of tools use sophisticated tiling, parallelization, and memory mapping strategies, and generate code that relies on vendor-supplied compilers. This code has a number of parameters, such as tile sizes, that are then tuned via empirical exploration. We develop a model that guides such a choice. Our model is a simple set of analytical functions that predict the execution time of the generated code. It is deliberately optimistic, since tile sizes and, moreover, the optimistic assumptions are intended to enable we are targeting modeling and parameter selections yielding highly tuned codes. We experimentally validate the model on a number of 2D and 3D stencil codes, and show that the root mean square error in the execution time is less than 10% for the subset of the codes that achieve performance within 20% of the best. Furthermore, based on using our model, we are able to predict tile sizes that achieve a further improvement of 9% on average.

1 November 2004 in INFORMS Journal on Computing
Verified
Journal Article
Closed access
RARumen Andonov
Rumen Andonov
SBStefan Balev
Stefan Balev
NYNicola Yanev
Nicola Yanev
This paper presents a new network-flow formulation for the problem of predicting 3D protein structures using threading. Several integer-programming models based on this formulation are proposed and compared. These models allow for an efficient decomposition and for the application of a parallel branch-and-cut algorithm, significantly reducing the running time. The efficiency of our approach has been confirmed by extensive computational experiments.

1 June 2019 in Journal of Bioinformatics and Computational Biology
Verified
Journal Article
Closed access
PDF file
RARumen Andonov
Rumen Andonov
HDHristo Djidjev
Hristo Djidjev
SFSebastien François
Sebastien François
DLDominique Lavenier
Dominique Lavenier