Computational identification of three-way junctions in folded RNAs: a case study in Arabidopsis.
Three-way junctions in folded RNAs have been investigated both experimentally and computationally. The interest in their analysis stems from the fact that they have significantly been found to possess a functional role. In recent work, three-way junctions have been categorized into families depending on the relative lengths of the segments linking the three helices. Here, based on ideas originating from computational geometry, an algorithm is proposed for detecting three-way junctions in data sets of genes that are related to a metabolic pathway of interest. In its current implementation, the algorithm relies on a moving window that performs energy minimization folding predictions, and is demonstrated on a set of genes that are involved in purine metabolism in plants. The pattern matching algorithm can be extended to other organisms and other metabolic cycles of interest in which three-way junctions have been or will be discovered to play an important role. In the test case presented here with, the computational prediction of a three-way junction in Arabidopsis that was speculated to have an interesting functional role is verified experimentally.
Cohen
Adaya
A
Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel.
Bocobza
Samuel
S
Veksler
Isana
I
Gabdank
Idan
I
Barash
Danny
D
Aharoni
Asaph
A
Shapira
Michal
M
Kedem
Klara
K
D000465:Algorithms; D017360:Arabidopsis / Q000235:genetics*; D001483:Base Sequence; D019295:Computational Biology / Q000379:methods; D005057:Eukaryotic Cells; D008969:Molecular Sequence Data; D009690:Nucleic Acid Conformation; D011387:Prokaryotic Cells; D012313:RNA / Q000737:chemistry* / Q000235:genetics; D015203:Reproducibility of Results
D012313:RNA