IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3854646.html
   My bibliography  Save this article

Discovery of DNA Motif Utilising an Integrated Strategy Based on Random Projection and Particle Swarm Optimization

Author

Listed:
  • Hongwei Ge
  • Jinghong Yu
  • Liang Sun
  • Zhen Wang
  • Yao Yao

Abstract

During the process of gene expression and regulation, the DNA genetic information can be transferred to protein by means of transcription. The recognition of transcription factor binding sites can help to understand the evolutionary relations among different sequences. Thus, the problem of recognition of transcription factor binding sites, i.e., motif recognition, plays an important role for understanding the biological functions or meanings of sequences. However, when the established search space processes much noise subsequences, many optimization algorithms tend to be trapped into local optimum. In order to solve this problem, a particle swarm optimization and random projection-based algorithm (PSORPS) is proposed for recognizing DNA motifs. First, a random projection strategy is employed to filter the noise subsequences for constructing the objective space. Moreover, the sequence segments distributed in the majority of DNA sequences can be obtained and used for the population initialization of PSO. Then, the motifs of DNA sequences can be automatically searched by using a designed PSO algorithm in the constructed l -mer objective space. Finally, to alleviate the base deviation and further improve the recognition accuracy, the two operators of associated drift and independent drift are performed on the optimization results obtained by PSO. The experiments are conducted on real-world biological datasets, and the experimental results verify the effectiveness of the proposed algorithm.

Suggested Citation

  • Hongwei Ge & Jinghong Yu & Liang Sun & Zhen Wang & Yao Yao, 2019. "Discovery of DNA Motif Utilising an Integrated Strategy Based on Random Projection and Particle Swarm Optimization," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-12, May.
  • Handle: RePEc:hin:jnlmpe:3854646
    DOI: 10.1155/2019/3854646
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3854646.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3854646.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/3854646?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:3854646. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.