Skip NavigationSkip to Content

A new algorithm for computing similarity between RNA structures

  1. Author:
    Collins, G. D.
    Le, S. Y.
    Zhang, K. Z.
  2. Author Address

    Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada. Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada. NCI, Lab Expt & Comp Biol, NIH, Frederick, MD 21702 USA. Zhang KZ Univ Western Ontario, Dept Comp Sci, London, ON N6A 5B7, Canada.
    1. Year: 2001
  1. Journal: Information Sciences
    1. 139
    2. 1-2
    3. Pages: 59-77
  2. Type of Article: Article
  1. 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 form bonds between A-U and C-G. For secondary structures, these bonds have been traditionally assumed to be one-to-one and non-crossing. We consider the edit distance between two RNA structures. This is a notion of similarity, introduced in [Proceedings of the Tenth Symposium on Combinatorial Pattern Matching, Lecture Notes in Computer Science, vol. 1645, Springer, Berlin, 1999, p. 281], between two RNA molecule structures taking into account the primary, the secondary and the tertiary structures. In general this problem is NP-hard for tertiary structures. In this paper, we consider this notion under some constraints. We present an algorithm and then show how to use this algorithm for practical applications. (C) 2001 Elsevier Science Inc. All rights reserved.

    See More

External Sources

  1. No sources found.

Library Notes

  1. No notes added.
NCI at Frederick

You are leaving a government website.

This external link provides additional information that is consistent with the intended purpose of this site. The government cannot attest to the accuracy of a non-federal site.

Linking to a non-federal site does not constitute an endorsement by this institution or any of its employees of the sponsors or the information and products presented on the site. You will be subject to the destination site's privacy policy when you follow the link.

ContinueCancel