Skip to main content
SpringerLink
Log in

On solvability, regularity, and locality of the problem of genome annotation

  • Applications Problems
  • Published:
Pattern Recognition and Image Analysis Aims and scope Submit manuscript

Abstract

Determination of the nucleotide sequences of hundreds of organisms (in the first place, the human genome) is a significant technical achievement of modern biology. The next stage of studying the genome is to determine the functions of each gene and the corresponding protein: the so-called genome annotation. The existing methods of classifying the biological roles of proteins on the basis of the amino acid sequence are restricted to searching for similar sequences in a database and, as a result, have limited applicability. In this paper, a formalism is introduced for studying this problem in the framework of the algebraic approach and the solvability, locality, and regularity of the problem and monotonicity of the condition of solvability are considered. The proposed formalism enables one to study systematically the hypothesis of locality of various biological roles of proteins.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. I. Yu. Torshin, Bioinformatics in the Post-Genomic Era: Sensing the Change from Molecular Genetics to Personalized Medicine (Nova Biomedical Books, New York, 2009).

    Google Scholar 

  2. K. V. Rudakov and I. Yu. Torshin, “On Solvability of the Formal Problem of Protein Secondary Structure Recognition,” in Mathematical Methods of Pattern Recognition-14, Suzdal, September 21–25, 2009.

  3. K. V. Rudakov and I. Yu. Torshin, “Questions on Solvability of the Problem of Protein Secondary Structure Recognition,” informatics and its Application 4(2), (2010).

  4. Yu. I. Zhuravlev, “Well-Posed Algebras over Sets of Ill-Posed (Heuristic) Algorithms. I,” Kibernetika, no. 4, 5–17 (1977)

  5. Yu. I. Zhuravlev, “Well-Posed Algebras over Sets of Ill-Posed (Heuristic) Algorithms. II,” Kibernetika, no. 6, 21–27 (1977)

  6. Yu. I. Zhuravlev, “Well-Posed Algebras over Sets of Ill-Posed (Heuristic) Algorithms. III,” Kibernetika, no. 2, 35–43 (1978)

  7. Yu. I. Zhuravlev, “On the Algebraic Approach to Solving Problems of Recognition and Classification,” in Problems of Cybernetics (Nauka, Moscow, 1978), issue 33, pp. 5–68 [in Russian].

    Google Scholar 

  8. Yu. I. Zhuravlev and K. V. Rudakov, “On the Algebraic Correction of Procedures for Data Processing,” in Problems of Applied Mathematics and Informatics, (Nauka, Moscow, 1987), pp. 187–198 [in Russian].

    Google Scholar 

  9. K. V. Rudakov, “Universal and Local Restrictions in the Problem of Correcting Heuristic Algorithms,” Kibernetika, no. 2, 30–35 (1987).

  10. K. V. Rudakov, “Completeness and Universal Restrictions in the Problem of Correcting Heuristic Classification Algorithms,” Kibernetika, no. 3, 106–109 (1987).

  11. K. V. Rudakov, “Symmetric and Functional Restrictions in the Problem of Correcting Heuristic Classification Algorithms,” Kibernetika, no. 4, 73–77 (1987).

  12. K. V. Rudakov, “On Application of Universal Constraints for Studying Classification Algorithms,” Kibernetika, no. 1, 1–5 (1988).

  13. Gene Ontology: Tool for the Unification of Biology, in (The Gene Ontology Consortium, 2000; Nature Genet.25: 25—29).

  14. D. P. Hill, A. P. Davis, J. E. Richardson et al., “Program Description: Strategies for Biological Annotation of Mammalian Systems: Implementing Gene Ontologies in Mouse Genome Informatics,” Genomics 74(1), 121–128 (May 15, 2001).

    Article  Google Scholar 

  15. N. Hulo, C. J. Sigrist, V. Le Saux, et. al., “Recent Improvements to the PROSITE Database,” Nucleic Acids Res. 32 (Database issue), 134–137 (January 1, 2004).

    Article  Google Scholar 

  16. Yu. I. Zhuravlev, “Set Theoretical Methods in Logic Algebra,” Problemy Kibernetiki 8(1) 25–45 (1962).

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Russian Satellite Center of the Trace Element Institute for UNESCO, Bol’shoi Tishinskii per. 26, stroen. 15-16, Moscow, 109652, Russia

    I. Yu. Torshin

Authors
  1. I. Yu. Torshin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Yu. Torshin.

Additional information

Ivan Yur’evich Torshin. Born 1972. Graduated from the Chemistry Department of Moscow State University in 1995. Received PhD degree in 1997. Visiting professor at Thomas Jefferson University and at Georgia University (United States) 1999–2004. Since 2007, Leading Researcher in the Russian Satellite Center of the Trace Element Institute for UNESCO. Over 75 publications in Russian and international science journals on computational biology, chemistry, medicine, and informatics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Torshin, I.Y. On solvability, regularity, and locality of the problem of genome annotation. Pattern Recognit. Image Anal. 20, 386–395 (2010). https://doi.org/10.1134/S1054661810030156

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1054661810030156

Key words

Search

Navigation