Abstract
Fundamental relations and symmetry rules of the genetic information organization in DNA were studied. DNA symmetry was used to construct an optimal symmetric code with respect to amino acid polarity, with noise immunity much higher than that of a standard genetic code. It is well known that various diseases are associated with pointwise mutations of nucleotides in genes. Bayesian procedures allow for use of the standard and symmetric codes for genetic diseases diagnosis. Markov model of higher orders with hidden states was used to build simple algorithms for gene fragment prediction.
Similar content being viewed by others
References
Baisnée, P.-F., Hampson, S., Baldi, P.: Why are complementary DNA strands symmetric? Bioinformatics 18(2), 1021–1033 (2002)
Dong, Q., Cuticchia, A.J.: Compositional symmetries in complete genomes. Bioinformatics 17(6), 557–559 (2001)
Gupal, A.M., Ostrovsky, A.V.: Using compositions of Markov models to determine functional gene fragments. Cybern. Syst. Anal. 49(5), 692–698 (2013)
Gupal, A.M., Sergienko, I.V.: Optimal Pattern Recognition Procedures. Naukova Dumka, Kyiv (2008) (in Russian)
Gupal, A.M., Sergienko, I.V.: Symmetry rules in DNA. Dokl. Akad. Nauk 445(1), 25–27 (2012)
Gupal, A.M., Sergienko, I.V.: Symmetry in DNA. Methods of Pattern Recognition. Naukova Dumka, Kyiv (2016) (in Russian)
Gupal, A.M., Vagis, A.A.: Complementarity principles of bases in DNA chromosomes. J. Autom. Inf. Sci. 37(10), 24–28 (2005)
Gupal, A.M., Gupal, N.A., Ostrovsky, A.V.: Symmetry and properties of genetic information in DNA. J. Autom. Inf. Sci. 43(6), 40–48 (2011)
Majoros, W.H., Pertea, M., Salzberg, S.L.: Tigrscan and glimmerhmm: two open source ab initio eukaryotic gene-finders. Bioinformatics 20(16), 2878–2879 (2004)
Majoros, W.H., Pertea, M., Delcher, A.L., Salzberg, S.L.: Efficient decoding algorithms for generalized hidden Markov model gene finders. BMC Bioinf. 6(1), 16 (2005)
Prabhu, V.V.: Symmetry observations in long nucleotide sequences. Nucleic Acids Res. 21(12), 2797–2800 (1993)
Sergienko, I.V., Gupal, A.M., Ostrovsky, A.V.: Recognition of DNA gene fragments using hidden Markov models. Cybern. Syst. Anal. 48(3), 369–377 (2012)
Sergienko, I.V., Gupal, A.M., Ostrovsky, A.V.: Noise immunity of genetic codes and optimal codes. Dokl. Akad. Nauk 453(5), 492–495 (2013)
Sergienko, I.V., Gupal, A.M., Ostrovsky, A.V.: Noise immunity of genetic codes to point mutations. Cybern. Syst. Anal. 50(5), 663–669 (2014)
Sergienko, I.V., Gupal, A.M., Vagis, A.A.: Symmetric code and genetic mutations. Cybern. Syst. Anal. 52(2), 240–246 (2016)
Stanke, M., Waack, S.: Gene prediction with a hidden Markov model and a new intron submodel. Bioinformatics 19(Suppl. 2), 215–225 (2003)
Winters-Hilt, S.: Hidden Markov model variants and their application. BMC Bioinf. 7(2), 1–14 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Biletskyy, B.O., Gupal, A.M. (2017). Symmetry in DNA: Methods of Pattern Recognition Based on Hidden Markov Models. In: Butenko, S., Pardalos, P., Shylo, V. (eds) Optimization Methods and Applications . Springer Optimization and Its Applications, vol 130. Springer, Cham. https://doi.org/10.1007/978-3-319-68640-0_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-68640-0_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68639-4
Online ISBN: 978-3-319-68640-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)