Adaptive algorithm of automated annotation

A. M. Leontovich, L. I. Brodsky, V. A. Drachev, V. K. Nikolaev

Research output: Contribution to journalArticlepeer-review


Motivation: 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 (A4) 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.

Original languageEnglish
Pages (from-to)838-846
Number of pages9
Issue number6
StatePublished - 2002
Externally publishedYes

ASJC Scopus subject areas

  • Statistics and Probability
  • Biochemistry
  • Molecular Biology
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Adaptive algorithm of automated annotation'. Together they form a unique fingerprint.

Cite this