• DocumentCode
    3382136
  • Title

    Approximating algorithm for RNA structure prediction including pseudoknots

  • Author

    Zhendong Liu ; Yuxiao Dong ; Hengwu Li ; Huijian Han

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Shandong Jianzhu Univ., Jinan, China
  • fYear
    2011
  • fDate
    15-16 Aug. 2011
  • Firstpage
    325
  • Lastpage
    329
  • Abstract
    RNA structure and tertiary structure could be represented by a set of nested arcs and a set of crossing arcs. Based on the relative stability of the stems in RNA molecules, an approximating algorithm is presented to predict RNA pseudoknotted structure, the algorithm takes O(n3) time and O(n) space, the algorithm outperforms other known algorithms in predicting accuracy. This algorithm not only reduces the time complexity to O(n3), but also widens the maximum length of the sequence. The preliminary experimental test on the RNA subsequences in PseudoBase confirm that the algorithm has good sensitivity and specificity, and are among the most reasonable in the literature.
  • Keywords
    approximation theory; biology computing; computational complexity; macromolecules; organic compounds; stability; RNA molecules; RNA pseudoknotted structure prediction approximation algorithm; tertiary structure; time complexity; Accuracy; Algorithm design and analysis; Approximation algorithms; Complexity theory; Heuristic algorithms; Prediction algorithms; RNA; Approximating algorithm; NP-complete; RNA structure; Stem;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Automation and Logistics (ICAL), 2011 IEEE International Conference on
  • Conference_Location
    Chongqing
  • ISSN
    2161-8151
  • Print_ISBN
    978-1-4577-0301-0
  • Electronic_ISBN
    2161-8151
  • Type

    conf

  • DOI
    10.1109/ICAL.2011.6024736
  • Filename
    6024736