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

Alexey V. Antonov

dblp:05/1527 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2009
0000-0002-6909-8902ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 2 first-author

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 · 92% Computational science and engineering · 8%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › cancer genomics
cancer classification
0.122004
A web portal for classification of expression data using maximal margin linear programming · Bioinform. 2004
Optimization models for cancer classification: extracting gene interaction information from microarray expression data · Bioinform. 2004
Bioinformatics and computational biology › network bioinformatics › biological network analysis
functional module identification
0.112009
The DICS repository: module-assisted analysis of disease-related gene lists · Bioinform. 2009
Bioinformatics and computational biology
gene expression analysis
0.122004
A web portal for classification of expression data using maximal margin linear programming · Bioinform. 2004
Optimization models for cancer classification: extracting gene interaction information from microarray expression data · Bioinform. 2004
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network
0.112009
The DICS repository: module-assisted analysis of disease-related gene lists · Bioinform. 2009
Bioinformatics and computational biology
systems biology
0.112009
The DICS repository: module-assisted analysis of disease-related gene lists · Bioinform. 2009
Computational science and engineering
benchmark dataset
0.112005
MIPS bacterial genomes functional annotation benchmark dataset · Bioinform. 2005
Bioinformatics and computational biology › genome annotation
functional annotation
0.112005
MIPS bacterial genomes functional annotation benchmark dataset · Bioinform. 2005
Bioinformatics and computational biology
genome annotation
0.112005
MIPS bacterial genomes functional annotation benchmark dataset · Bioinform. 2005
Bioinformatics and computational biology › protein sequence analysis
protein sequence annotation
0.012005
MIPS bacterial genomes functional annotation benchmark dataset · Bioinform. 2005

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

module detection · 0.2linear programming · 0.1sequence similarity · 0.1interpro domain composition · 0.1maximal margin linear programming · 0.0maximal margin classification · 0.0
YearPublicationVenuePosition
2009 The DICS repository: module-assisted analysis of disease-related gene lists
abstract
SUMMARY: The DICS database is a dynamic web repository of computationally predicted functional modules from the human protein-protein interaction network. It provides references to the CORUM, DrugBank, KEGG and Reactome pathway databases. DICS can be accessed for retrieving sets of overlapping modules and protein complexes that are significantly enriched in a gene list, thereby providing valuable information about the functional context. AVAILABILITY: Supplementary information on datasets and methods is available on the web server http://mips.gsf.de/proj/dics.
Sabine Dietmann, Elisabeth Georgii, Alexey V. Antonov, Koji Tsuda, Hans-Werner Mewes
Bioinform.3
2005 MIPS bacterial genomes functional annotation benchmark dataset
abstract
MOTIVATION: Any development of new methods for automatic functional annotation of proteins according to their sequences requires high-quality data (as benchmark) as well as tedious preparatory work to generate sequence parameters required as input data for the machine learning methods. Different program settings and incompatible protocols make a comparison of the analyzed methods difficult. RESULTS: The MIPS Bacterial Functional Annotation Benchmark dataset (MIPS-BFAB) is a new, high-quality resource comprising four bacterial genomes manually annotated according to the MIPS functional catalogue (FunCat). These resources include precalculated sequence parameters, such as sequence similarity scores, InterPro domain composition and other parameters that could be used to develop and benchmark methods for functional annotation of bacterial protein sequences. These data are provided in XML format and can be used by scientists who are not necessarily experts in genome annotation. AVAILABILITY: BFAB is available at http://mips.gsf.de/proj/bfab
Igor V. Tetko, Barbara Brauner, Irmtraud Dunger, Goar Frishman, Corinna Montrone, Gisela Fobo, Andreas Ruepp, Alexey V. Antonov, Dimitrij Surmeli, Hans-Werner Mewes
Bioinform.8
2004 Optimization models for cancer classification: extracting gene interaction information from microarray expression data
abstract
MOTIVATION: Microarray data appear particularly useful to investigate mechanisms in cancer biology and represent one of the most powerful tools to uncover the genetic mechanisms causing loss of cell cycle control. Recently, several different methods to employ microarray data as a diagnostic tool in cancer classification have been proposed. These procedures take changes in the expression of particular genes into account but do not consider disruptions in certain gene interactions caused by the tumor. It is probable that some genes participating in tumor development do not change their expression level dramatically. Thus, they cannot be detected by simple classification approaches used previously. For these reasons, a classification procedure exploiting information related to changes in gene interactions is needed. RESULTS: We propose a MAximal MArgin Linear Programming (MAMA) method for the classification of tumor samples based on microarray data. This procedure detects groups of genes and constructs models (features) that strongly correlate with particular tumor types. The detected features include genes whose functional relations are changed for particular cancer types. The proposed method was tested on two publicly available datasets and demonstrated a prediction ability superior to previously employed classification schemes. AVAILABILITY: The MAMA system was developed using the linear programming system LINDO http://www.lindo.com. A Perl script that specifies the optimization problem for this software is available upon request from the authors.
Alexey V. Antonov, Igor V. Tetko, Michael T. Mader, Jan Budczies, Hans-Werner Mewes
Bioinform.1
2004 A web portal for classification of expression data using maximal margin linear programming
abstract
Abstract Summary: The Maximal Margin (MAMA) linear programming classification algorithm has recently been proposed and tested for cancer classification based on expression data. It demonstrated sound performance on publicly available expression datasets. We developed a web interface to allow potential users easy access to the MAMA classification tool. Basic and advanced options provide flexibility in exploitation. The input data format is the same as that used in most publicly available datasets. This makes the web resource particularly convenient for non-expert machine learning users working in the field of expression data analysis. Availability: The web software developed is available at http://mips.gsf.de/proj/mdcs/. A stand-alone version of the server can be downloaded from this site too.
Alexey V. Antonov, Igor V. Tetko, Volodymyr V. Prokopenko, Denis Kosykh, Hans-Werner Mewes
Bioinform.1