Computing similarity between RNA structures

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

32 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)111-132
Journal / PublicationTheoretical Computer Science
Volume276
Issue number1-2
Publication statusPublished - 6 Apr 2002

Abstract

The primary structure of a ribonucleic acid (RNA) molecule is a sequence of nucleotides (bases) over the four-letter alphabet {A,C,G,U}. The secondary or tertiary structure of an RNA is a set of base-pairs (nucleotide pairs) which forms bonds between A-U and C-G. For secondary structures, these bonds have been traditionally assumed to be one to one and non-crossing. This paper considers a notion of similarity between two RNA molecule structures taking into account the primary, the secondary and the tertiary structures. We show that, for tertiary structures, it is Max SNP-hard for both minimization and maximization versions. We show a stronger result for the maximization version where it cannot be approximated within ratio 2logδn in polynomial time, unless NP ⊆ DTIME[2poly logn]. We then present an algorithm that can be used for practical application. Our algorithm will produce an optimal solution for the case where at least one of the RNA involved is of a secondary structure. We also show an approximation algorithm.

Research Area(s)

  • Inapproximability, Molecular biology, RNA structures, Similarity

Citation Format(s)

Computing similarity between RNA structures. / Ma, Bin; Wang, Lusheng; Zhang, Kaizhong.

In: Theoretical Computer Science, Vol. 276, No. 1-2, 06.04.2002, p. 111-132.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review