Adaptive algorithm of automated annotation

9Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Leontovich, A. M., Brodsky, L. I., Drachev, V. A., & Nikolaev, V. K. (2002). Adaptive algorithm of automated annotation. Bioinformatics, 18(6), 838–846. https://doi.org/10.1093/bioinformatics/18.6.838

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free