IDEAS home Printed from https://ideas.repec.org/a/bpj/sagmbi/v15y2016i5p381-400n2.html
   My bibliography  Save this article

Search of latent periodicity in amino acid sequences by means of genetic algorithm and dynamic programming

Author

Listed:
  • Pugacheva Valentina

    (Institute of Bioengineering, Research Center of Biotechnology of the Russian Academy of Sciences, Leninsky Ave. 33, bld. 2, 119071 Moscow, Russian Federation)

  • Korotkov Alexander
  • Korotkov Eugene

    (National Research Nuclear University “MEPhI”, Kashirskoe shosse, 31. Moscow 115409, Russian Federation)

Abstract

The aim of this study was to show that amino acid sequences have a latent periodicity with insertions and deletions of amino acids in unknown positions of the analyzed sequence. Genetic algorithm, dynamic programming and random weight matrices were used to develop a new mathematical algorithm for latent periodicity search. A multiple alignment of periods was calculated with help of the direct optimization of the position-weight matrix without using pairwise alignments. The developed algorithm was applied to analyze amino acid sequences of a small number of proteins. This study showed the presence of latent periodicity with insertions and deletions in the amino acid sequences of such proteins, for which the presence of latent periodicity was not previously known. The origin of latent periodicity with insertions and deletions is discussed.

Suggested Citation

  • Pugacheva Valentina & Korotkov Alexander & Korotkov Eugene, 2016. "Search of latent periodicity in amino acid sequences by means of genetic algorithm and dynamic programming," Statistical Applications in Genetics and Molecular Biology, De Gruyter, vol. 15(5), pages 381-400, October.
  • Handle: RePEc:bpj:sagmbi:v:15:y:2016:i:5:p:381-400:n:2
    DOI: 10.1515/sagmb-2015-0079
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/sagmb-2015-0079
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.

    File URL: https://libkey.io/10.1515/sagmb-2015-0079?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bpj:sagmbi:v:15:y:2016:i:5:p:381-400:n:2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Peter Golla (email available below). General contact details of provider: https://www.degruyter.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.