Demo Data from SIGIR 2026 / reviewers in the wild / expert
Viacheslav Fofanov
dblp:66/4938
· DBLP profile ↗
7ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 7
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
4 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genomics
next-generation sequencing data analysis |
0.1 | 1 | 2009 | PIQA: pipeline for Illumina G1 genome analyzer data quality assessment · Bioinform. 2009 |
Bioinformatics and computational biology › sequence analysis › sequencing data processing
sequencing quality control |
0.1 | 1 | 2009 | PIQA: pipeline for Illumina G1 genome analyzer data quality assessment · Bioinform. 2009 |
Bioinformatics and computational biology › genomics
genomic signature |
0.1 | 1 | 2007 | Effect of the mutation rate and background size on the quality of pathogen identification · Bioinform. 2007 |
Bioinformatics and computational biology › metagenomics
pathogen identification |
0.1 | 1 | 2007 | Effect of the mutation rate and background size on the quality of pathogen identification · Bioinform. 2007 |
Bioinformatics and computational biology
sequence analysis |
0.1 | 1 | 2007 | Effect of the mutation rate and background size on the quality of pathogen identification · Bioinform. 2007 |
Bioinformatics and computational biology
protein function prediction |
0.1 | 1 | 2006 | Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction · RECOMB 2006 |
Mathematical optimization
distributed optimization |
0.1 | 1 | 2006 | Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction · RECOMB 2006 |
Bioinformatics and computational biology
comparative genomics |
0.0 | 1 | 2004 | How independent are the appearances of n-mers in different genomes? · Bioinform. 2004 |
Methods — techniques the papers use, named apart from their topics
geometric sieving · 0.1distributed optimization · 0.1statistical summary · 0.1graphical visualization · 0.1probabilistic modeling · 0.1monte carlo simulation · 0.1correlation analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Variant site strain typer (VaST): efficient strain typing using a minimal number of variant genomic sitesabstractBACKGROUND: Targeted PCR amplicon sequencing (TAS) techniques provide a sensitive, scalable, and cost-effective way to query and identify closely related bacterial species and strains. Typically, this is accomplished by targeting housekeeping genes that provide resolution down to the family, genera, and sometimes species level. Unfortunately, this level of resolution is not sufficient in many applications where strain-level identification of bacteria is required (biodefense, forensics, clinical diagnostics, and outbreak investigations). Adding more genomic targets will increase the resolution, but the challenge is identifying the appropriate targets. VaST was developed to address this challenge by finding the minimum number of targets that, in combination, achieve maximum strain-level resolution for any strain complex. The final combination of target regions identified by the algorithm produce a unique haplotype for each strain which can be used as a fingerprint for identifying unknown samples in a TAS assay. VaST ensures that the targets have conserved primer regions so that the targets can be amplified in all of the known strains and it also favors the inclusion of targets with basal variants which makes the set more robust when identifying previously unseen strains. RESULTS: We analyzed VaST's performance using a number of different pathogenic species that are relevant to human disease outbreaks and biodefense. The number of targets required to achieve full resolution ranged from 20 to 88% fewer sites than what would be required in the worst case and most of the resolution is achieved within the first 20 targets. We computationally and experimentally validated one of the VaST panels and found that the targets led to accurate phylogenetic placement of strains, even when the strains were not a part of the original panel design. CONCLUSIONS: VaST is an open source software that, when provided a set of variant sites, can find the minimum number of sites that will provide maximum resolution of a strain complex, and it has many different run-time options that can accommodate a wide range of applications. VaST can be an effective tool in the design of strain identification panels that, when combined with TAS technologies, offer an efficient and inexpensive strain typing protocol. Tara N. Furstenau, Jill H. Cocking, Jason W. Sahl, Viacheslav Fofanov |
BMC Bioinform. | 4 |
| 2010 | Analysis of substructural variation in families of enzymatic proteins with applications to protein function predictionabstractBACKGROUND: Structural variations caused by a wide range of physico-chemical and biological sources directly influence the function of a protein. For enzymatic proteins, the structure and chemistry of the catalytic binding site residues can be loosely defined as a substructure of the protein. Comparative analysis of drug-receptor substructures across and within species has been used for lead evaluation. Substructure-level similarity between the binding sites of functionally similar proteins has also been used to identify instances of convergent evolution among proteins. In functionally homologous protein families, shared chemistry and geometry at catalytic sites provide a common, local point of comparison among proteins that may differ significantly at the sequence, fold, or domain topology levels. RESULTS: This paper describes two key results that can be used separately or in combination for protein function analysis. The Family-wise Analysis of SubStructural Templates (FASST) method uses all-against-all substructure comparison to determine Substructural Clusters (SCs). SCs characterize the binding site substructural variation within a protein family. In this paper we focus on examples of automatically determined SCs that can be linked to phylogenetic distance between family members, segregation by conformation, and organization by homology among convergent protein lineages. The Motif Ensemble Statistical Hypothesis (MESH) framework constructs a representative motif for each protein cluster among the SCs determined by FASST to build motif ensembles that are shown through a series of function prediction experiments to improve the function prediction power of existing motifs. CONCLUSIONS: FASST contributes a critical feedback and assessment step to existing binding site substructure identification methods and can be used for the thorough investigation of structure-function relationships. The application of MESH allows for an automated, statistically rigorous procedure for incorporating structural variation data into protein function prediction pipelines. Our work provides an unbiased, automated assessment of the structural variability of identified binding site substructures among protein structure families and a technique for exploring the relation of substructural variation to protein function. As available proteomic data continues to expand, the techniques proposed will be indispensable for the large-scale analysis and interpretation of structural data. Drew H. Bryant, Mark Moll, Brian Y. Chen, Viacheslav Fofanov, Lydia E. Kavraki |
BMC Bioinform. | 4 |
| 2009 | PIQA: pipeline for Illumina G1 genome analyzer data quality assessmentabstractSUMMARY: PIQA is a quality analysis pipeline designed to examine genomic reads produced by Next Generation Sequencing technology (Illumina G1 Genome Analyzer). A short statistical summary, as well as tile-by-tile and cycle-by-cycle graphical representation of clusters density, quality scores and nucleotide frequencies allow easy identification of various technical problems including defective tiles, mistakes in sample/library preparations and abnormalities in the frequencies of appearance of sequenced genomic reads. PIQA is written in the R statistical programming language and is compatible with bustard, fastq and scarf Illumina G1 Genome Analyzer data formats. AVAILABILITY: The PIQA pipeline, installation instructions and examples are available at the supplementary web site (http://bioinfo.uh.edu/PIQA). Antonio Martínez-Alcántara, Efren Ballesteros, Mark Rojas, H. Koshinsky, Viacheslav Fofanov, Paul Havlak, Yuriy Fofanov |
Bioinform. | 6 |
| 2008 | Prediction of enzyme function based on 3D templates of evolutionarily important amino acidsabstractBACKGROUND: Structural genomics projects such as the Protein Structure Initiative (PSI) yield many new structures, but often these have no known molecular functions. One approach to recover this information is to use 3D templates - structure-function motifs that consist of a few functionally critical amino acids and may suggest functional similarity when geometrically matched to other structures. Since experimentally determined functional sites are not common enough to define 3D templates on a large scale, this work tests a computational strategy to select relevant residues for 3D templates. RESULTS: Based on evolutionary information and heuristics, an Evolutionary Trace Annotation (ETA) pipeline built templates for 98 enzymes, half taken from the PSI, and sought matches in a non-redundant structure database. On average each template matched 2.7 distinct proteins, of which 2.0 share the first three Enzyme Commission digits as the template's enzyme of origin. In many cases (61%) a single most likely function could be predicted as the annotation with the most matches, and in these cases such a plurality vote identified the correct function with 87% accuracy. ETA was also found to be complementary to sequence homology-based annotations. When matches are required to both geometrically match the 3D template and to be sequence homologs found by BLAST or PSI-BLAST, the annotation accuracy is greater than either method alone, especially in the region of lower sequence identity where homology-based annotations are least reliable. CONCLUSION: These data suggest that knowledge of evolutionarily important residues improves functional annotation among distant enzyme homologs. Since, unlike other 3D template approaches, the ETA method bypasses the need for experimental knowledge of the catalytic mechanism, it should prove a useful, large scale, and general adjunct to combine with other methods to decipher protein function in the structural proteome. David M. Kristensen, R. Matthew Ward, Andreas Martin Lisewski, Serkan Erdin, Brian Y. Chen, Viacheslav Fofanov, Marek Kimmel, Lydia E. Kavraki, Olivier Lichtarge |
BMC Bioinform. | 6 |
| 2007 | Effect of the mutation rate and background size on the quality of pathogen identificationabstractMOTIVATION: Genomic-based methods have significant potential for fast and accurate identification of organisms or even genes of interest in complex environmental samples (air, water, soil, food, etc.), especially when isolation of the target organism cannot be performed by a variety of reasons. Despite this potential, the presence of the unknown, variable and usually large quantities of background DNA can cause interference resulting in false positive outcomes. RESULTS: In order to estimate how the genomic diversity of the background (total length of all of the different genomes present in the background), target length and target mutation rate affect the probability of misidentifications, we introduce a mathematical definition for the quality of an individual signature in the presence of a background based on its length and number of mismatches needed to transform the signature into the closest subsequence present in the background. This definition, in conjunction with a probabilistic framework, allows one to predict the minimal signature length required to identify the target in the presence of different sizes of backgrounds and the effect of the target's mutation rate on the quality of its identification. The model assumptions and predictions were validated using both Monte Carlo simulations and real genomic data examples. The proposed model can be used to determine appropriate signature lengths for various combinations of target and background genome sizes. It also predicted that any genomic signatures will be unable to identify target if its mutation rate is >5%. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Chris Reed 0003, Viacheslav Fofanov, Catherine Putonti, Sergei Chumakov, Tom Slezak, Yuriy Fofanov |
Bioinform. | 2 |
| 2006 | Geometric Sieving: Automated Distributed Optimization of 3D Motifs for Protein Function Prediction
Brian Y. Chen, Viacheslav Fofanov, Drew H. Bryant, Bradley D. Dodson, David M. Kristensen, Andreas Martin Lisewski, Marek Kimmel, Olivier Lichtarge, Lydia E. Kavraki |
RECOMB | 2 |
| 2004 | How independent are the appearances of n-mers in different genomes?abstractMOTIVATION: Analysis of statistical properties of DNA sequences is important for evolutional biology as well as for DNA probe and PCR technologies. These technologies, in turn, can be used for organism identification, which implies applications in the diagnosis of infectious diseases, environmental studies, etc. RESULTS: We present results of the correlation analysis of distributions of the presence/absence of short nucleotide subsequences of different length ('n-mers', n = 5-20) in more than 1500 microbial and virus genomes, together with five genomes of multicellular organisms (including human). We calculate whether a given n-mer is present or absent (frequency of presence) in a given genome, which is not the usually calculated number of appearances of n-mers in one or more genomes (frequency of appearance). For organisms that are not close relatives of each other, the presence/absence of different 7-20mers in their genomes are not correlated. For close biological relatives, some correlation of the presence of n-mers in this range appears, but is not as strong as expected. Suppressed correlations among the n-mers present in different genomes leads to the possibility of using random sets of n-mers (with appropriately chosen n) to discriminate genomes of different organisms and possibly individual genomes of the same species including human with a low probability of error. Yuriy Fofanov, Charles Katili, Jim Wang, Yuri Belosludtsev, Thomas Powdrill, Chetan Belapurkar, Viacheslav Fofanov, Tong-Bin Li, Sergei Chumakov, B. Montgomery Pettitt |
Bioinform. | 8 |