Demo Data from EDBT 2026 / reviewers in the wild / expert
V. A. Drachev
dblp:07/317
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › genome annotation
automatic annotation |
0.0 | 1 | 2002 | Adaptive algorithm of automated annotation · Bioinform. 2002 |
Bioinformatics and computational biology › sequence analysis
sequence annotation |
0.0 | 1 | 2002 | Adaptive algorithm of automated annotation · Bioinform. 2002 |
Bioinformatics and computational biology › protein function prediction › sequence-based protein function prediction
homology-based function transfer |
0.0 | 1 | 2002 | Adaptive algorithm of automated annotation · Bioinform. 2002 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2002 | Adaptive algorithm of automated annotation · Bioinform. 2002 |
Methods — techniques the papers use, named apart from their topics
statistical modeling · 0.0adaptive thresholding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | Adaptive algorithm of automated annotationabstractMOTIVATION: It is common knowledge that the avalanche of data arriving from the sequencing projects cannot be annotated either experimentally or manually by experts. The need for a reliable and convenient tool for automated sequence annotation is broadly recognized. RESULTS: Here, we describe the Adaptive Algorithm of Automated Annotation (A(4)) based on a statistical approach to this problem. The mathematical model relates a set of homologous sequences and descriptions of their functional properties, and calculates the probabilities of transferring a sequence description onto its homologue. The proposed model is adaptive, its parameters (distribution characteristics, transference probabilities, thresholds, etc.) are dynamic, i.e. are generated individually for the sequences and various functional properties (words of the description). The proposed technique significantly outperforms the widely used test for frequency threshold, which is a special case of our model realized for the simplest set of parameters. The prediction technique has been realized as a computer program and tested on a random sequence sampling from SWISS-PROT. AVAILABILITY: The automated annotation program based on the proposed algorithm is available through the Web browser at http://www.genebee.msu.su/services/annot/basic.html. Andrey M. Leontovich, L. I. Brodsky, V. A. Drachev, V. K. Nikolaev |
Bioinform. | 3 |