KnotSeeker: Heuristic pseudoknot detection in long RNA sequences
نویسندگان
چکیده
منابع مشابه
Heuristic RNA pseudoknot prediction including intramolecular kissing hairpins.
Pseudoknots are an essential feature of RNA tertiary structures. Simple H-type pseudoknots have been studied extensively in terms of biological functions, computational prediction, and energy models. Intramolecular kissing hairpins are a more complex and biologically important type of pseudoknot in which two hairpin loops form base pairs. They are hard to predict using free energy minimization ...
متن کاملAn RNA Pseudoknot Folding Algorithm Based on Heuristic Searching
The general problem for the prediction of RNA secondary structure with pseudoknots is NP-hard. For a restricted class of pseudoknots, it was traditionally solved by the dynamic programming approach. However, these algorithms are computationally very expensive, when the input sequence or the contained pseudoknot is too long. We present a heuristic algorithm for RNA secondary structures with pseu...
متن کاملP87: The Role of the Long Non-Coding RNA Sequences (LncRNAs) in Neurological Disorders
Precise interpretation of the transcriptome sequences in the several species showed that the major part of genome has been transcribed; however, just a few amounts of the transcription sequences have open-reading frames which are conversed during the evolution. So, it is unlikely that many of the transcribed sequences code the proteins. Among the all human non-coding transcripts, at least 10000...
متن کاملCanonical RNA Pseudoknot Structures
In this paper, we study k-noncrossing, sigma-canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T(k, sigma)([4])(n) denote the number of these structures. We derive exact enumeration results by computing the generating function T(k, sigma)([4])(z) = summation operator(n) T(k, sigma)([4])(n)z(n) and derive the asymptotic formulas T(k, 3)([4])(n) approximate...
متن کاملRNA-LEGO: Combinatorial Design of Pseudoknot RNA
In this paper we enumerate k-noncrossing RNA pseudoknot structures with given minimum stack-length. We show that the numbers of k-noncrossing structures without isolated base pairs are significantly smaller than the number of all k-noncrossing structures. In particular we prove that the number of 3and 4-noncrossing RNA structures with stack-length ≥ 2 is for large n given by 311.2470 4! n(n−1)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RNA
سال: 2008
ISSN: 1355-8382
DOI: 10.1261/rna.968808