Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andriy Kryshtafovych

dblp:17/4740 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0001-5066-7178ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure prediction
0.532019
Comparative analysis of methods for evaluation of protein models against native structures · Bioinform. 2019
Using multi-data hidden Markov models trained on local neighborhoods of protein structure to predict residue-residue contacts · Bioinform. 2009
A novel approach to fold recognition using sequence-derived properties from sets of structurally similar local fragments of proteins · Bioinform. 2004
Bioinformatics and computational biology › protein structure prediction
model quality assessment
0.412019
Comparative analysis of methods for evaluation of protein models against native structures · Bioinform. 2019
Bioinformatics and computational biology › protein structure prediction
residue contact prediction
0.112009
Using multi-data hidden Markov models trained on local neighborhoods of protein structure to predict residue-residue contacts · Bioinform. 2009
Bioinformatics and computational biology › protein structure prediction › template-based modeling
fold recognition
0.012004
A novel approach to fold recognition using sequence-derived properties from sets of structurally similar local fragments of proteins · Bioinform. 2004
Bioinformatics and computational biology › protein structure prediction
de novo structure prediction
0.012009
Using multi-data hidden Markov models trained on local neighborhoods of protein structure to predict residue-residue contacts · Bioinform. 2009
Bioinformatics and computational biology
structural bioinformatics
0.012004
A novel approach to fold recognition using sequence-derived properties from sets of structurally similar local fragments of proteins · Bioinform. 2004

Methods — techniques the papers use, named apart from their topics

secondary structure prediction · 0.1local neighborhood descriptors · 0.1hidden markov model · 0.1sequence-derived properties · 0.0local fragment analysis · 0.0
YearPublicationVenuePosition
2019 Comparative analysis of methods for evaluation of protein models against native structures
abstract
MOTIVATION: Measuring discrepancies between protein models and native structures is at the heart of development of protein structure prediction methods and comparison of their performance. A number of different evaluation methods have been developed; however, their comprehensive and unbiased comparison has not been performed. RESULTS: We carried out a comparative analysis of several popular model assessment methods (RMSD, TM-score, GDT, QCS, CAD-score, LDDT, SphereGrinder and RPF) to reveal their relative strengths and weaknesses. The analysis, performed on a large and diverse model set derived in the course of three latest community-wide CASP experiments (CASP10-12), had two major directions. First, we looked at general differences between the scores by analyzing distribution, correspondence and correlation of their values as well as differences in selecting best models. Second, we examined the score differences taking into account various structural properties of models (stereochemistry, hydrogen bonds, packing of domains and chain fragments, missing residues, protein length and secondary structure). Our results provide a solid basis for an informed selection of the most appropriate score or combination of scores depending on the task at hand. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Kliment Olechnovic, Bohdan Monastyrskyy, Andriy Kryshtafovych, Ceslovas Venclovas
Bioinform.3
2009 Using multi-data hidden Markov models trained on local neighborhoods of protein structure to predict residue-residue contacts
abstract
MOTIVATION: Correct prediction of residue-residue contacts in proteins that lack good templates with known structure would take ab initio protein structure prediction a large step forward. The lack of correct contacts, and in particular long-range contacts, is considered the main reason why these methods often fail. RESULTS: We propose a novel hidden Markov model (HMM)-based method for predicting residue-residue contacts from protein sequences using as training data homologous sequences, predicted secondary structure and a library of local neighborhoods (local descriptors of protein structure). The library consists of recurring structural entities incorporating short-, medium- and long-range interactions and is general enough to reassemble the cores of nearly all proteins in the PDB. The method is tested on an external test set of 606 domains with no significant sequence similarity to the training set as well as 151 domains with SCOP folds not present in the training set. Considering the top 0.2 x L predictions (L = sequence length), our HMMs obtained an accuracy of 22.8% for long-range interactions in new fold targets, and an average accuracy of 28.6% for long-, medium- and short-range contacts. This is a significant performance increase over currently available methods when comparing against results published in the literature. AVAILABILITY: http://predictioncenter.org/Services/FragHMMent/.
Patrik Björkholm, Pawel Daniluk, Andriy Kryshtafovych, Krzysztof Fidelis, Robin Andersson, Torgeir R. Hvidsten
Bioinform.3
2006 Using local gene expression similarities to discover regulatory binding site modules
abstract
BACKGROUND: We present an approach designed to identify gene regulation patterns using sequence and expression data collected for Saccharomyces cerevisae. Our main goal is to relate the combinations of transcription factor binding sites (also referred to as binding site modules) identified in gene promoters to the expression of these genes. The novel aspects include local expression similarity clustering and an exact IF-THEN rule inference algorithm. We also provide a method of rule generalization to include genes with unknown expression profiles. RESULTS: We have implemented the proposed framework and tested it on publicly available datasets from yeast S. cerevisae. The testing procedure consists of thorough statistical analyses of the groups of genes matching the rules we infer from expression data against known sets of co-regulated genes. For this purpose we have used published ChIP-Chip data and Gene Ontology annotations. In order to make these tests more objective we compare our results with recently published similar studies. CONCLUSION: Results we obtain show that local expression similarity clustering greatly enhances overall quality of the derived rules, both in terms of enrichment of Gene Ontology functional annotation and coherence with ChIP-Chip binding data. Our approach thus provides reliable hypotheses on co-regulation that can be experimentally verified. An important feature of the method is its reliance only on widely accessible sequence and expression data. The same procedure can be easily applied to other microbial organisms.
Bartek Wilczynski, Torgeir R. Hvidsten, Andriy Kryshtafovych, Jerzy Tiuryn, Jan Komorowski, Krzysztof Fidelis
BMC Bioinform.3
2004 A novel approach to fold recognition using sequence-derived properties from sets of structurally similar local fragments of proteins
abstract
Comparative modeling methods can consistently produce reliable structural models for protein sequences with more than 25% sequence identity to proteins with known structure. However, there is a good chance that also sequences with lower sequence identity have their structural components represented in structural databases. To this end, we present a novel fragment-based method using sets of structurally similar local fragments of proteins. The approach differs from other fragment-based methods that use only single backbone fragments. Instead, we use a library of groups containing sets of sequence fragments with geometrically similar local structures and extract sequence related properties to assign these specific geometrical conformations to target sequences. We test the ability of the approach to recognize correct SCOP folds for 273 sequences from the 49 most popular folds. 49% of these sequences have the correct fold as their top prediction, while 82% have the correct fold in one of the top five predictions. Moreover, the approach shows no performance reduction on a subset of sequence targets with less than 10% sequence identity to any protein used to build the library.
Torgeir R. Hvidsten, Andriy Kryshtafovych, Jan Komorowski, Krzysztof Fidelis
Bioinform.2