Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Extracting constrained 2-interval subsets in 2-interval sets
Blin G., Fertin G., Vialette S. Theoretical Computer Science385 (1-3):241-263,2007.Type:Article
Date Reviewed: Feb 29 2008

Ribonucleic acid (RNA) is a very special organic molecule. Understanding the structural repertoire of RNA secondary motifs is a very hot and active research area. Many people have come up with different novel representations for RNA secondary structures, and they have used them to classify or to find missing motifs.

The authors have used based pairing to introduce the idea of 2-intervals. If we consider RNA as a line consisting of contiguous bases A, C, G, and U, then an interval is a contiguous base on this line, and a 2-interval is the disjoint union of two intervals on this line. Given a collection of 2-intervals D, for which two 2-intervals that do not intersect at any point can be in precedence order (<), allowed to nest, or allowed to cross, the authors define a model R based on the above three. The problem of finding the largest 2-interval pattern in a set of 2-intervals D, with respect to a given abstract model R, is called the 2-interval pattern problem (2-IPP).

In this paper, the authors focus on the three special cases of the 2-IPP: the 2-intervals of the solution subset need to be pairwise nested; the 2-intervals in a solution can only be nested or crossing, and all the intervals involved in the 2-interval set D are disjoint; and the 2-intervals in a solution can only be nested or in precedence, and all the intervals involved in the 2-interval set D have the same length. The 2-IPP complexity results are summarized in Table 1 of the paper.

I think this is a very good paper for pattern matching over RNA secondary structures.

Reviewer:  Manish Gupta Review #: CR135317 (0901-0076)
Bookmark and Share
  Featured Reviewer  
 
Pattern Matching (F.2.2 ... )
 
 
Computations On Discrete Structures (F.2.2 ... )
 
 
Interval Arithmetic (G.1.0 ... )
 
 
Pattern Analysis (I.5.2 ... )
 
 
Design Methodology (I.5.2 )
 
 
General (G.1.0 )
 
  more  
Would you recommend this review?
yes
no
Other reviews under "Pattern Matching": Date
Deterministic sampling
Vishkin U. SIAM Journal on Computing 20(1): 22-40, 1991. Type: Article
Jun 1 1992
Two-way string-matching
Crochemore M., Perrin D. (ed) Journal of the ACM 38(3): 650-674, 1991. Type: Article
Sep 1 1992
On the exact complexity of string matching: lower bounds
Galil Z., Giancarlo R. SIAM Journal on Computing 20(6): 1008-1020, 1991. Type: Article
Jan 1 1993
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy