A memory efficient algorithm for structural alignment of RNAs with embedded simple pseudoknots

Thomas Wong*, Y. S. Chiu, T. W. Lam, S. M. Yiu

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Citations (Scopus)

    Abstract

    In this paper, we consider the problem of structural alignment of a target RNA sequence of length n and a query RNA sequence of length m with known secondary structure that may contain embedded simple pseduoknots. The best known algorithm for solving this problem (Dost et al. [13]) runs in O(mn4) time with space complexity of O(mn3), which requires too much memory making it infeasible for comparing ncRNAs (non-coding RNAs) with length several hundreds or more. We propose a memory efficient algorithm to solve the same problem. We reduce the space complexity to O(mn2 + n3) while maintaining the same time complexity of Dost et al.'s algorithm. Experimental reslts show that our algorithm is feasible for comparing ncRNAs of length more than 500. Availability: The source code of our program is available upon request.

    Original languageEnglish
    Title of host publicationProceedings of 6th Asia-Pacific Bioinformatics Conference, APBC 2008
    Pages89-100
    Number of pages12
    Publication statusPublished - 2008
    Event6th Asia-Pacific Bioinformatics Conference, APBC 2008 - Kyoto, Japan
    Duration: 14 Jan 200817 Jan 2008

    Publication series

    NameSeries on Advances in Bioinformatics and Computational Biology
    Volume6
    ISSN (Print)1751-6404

    Conference

    Conference6th Asia-Pacific Bioinformatics Conference, APBC 2008
    Country/TerritoryJapan
    CityKyoto
    Period14/01/0817/01/08

    Fingerprint

    Dive into the research topics of 'A memory efficient algorithm for structural alignment of RNAs with embedded simple pseudoknots'. Together they form a unique fingerprint.

    Cite this