翻訳と辞書 Words near each other ・ Pseudojana perspicuifascia ・ Pseudojana roepkei ・ Pseudojana vitalisi ・ Pseudojudomia ・ Pseudojuloides ・ Pseudojuloides kaleidos ・ Pseudokadyella ・ Pseudokamikiria ・ Pseudokamikiria gressitti ・ Pseudokamikiria klapperichi ・ Pseudokamosia ・ Pseudokerana ・ Pseudokerremansia ・ Pseudokiefferiella ・ Pseudoklossia ・ Pseudoknot ・ Pseudokoleps ・ Pseudolabis ・ Pseudolabrus ・ Pseudolachnostylis ・ Pseudolachnum ・ Pseudolaelaps ・ Pseudolaelia ・ Pseudolagarobasidium ・ Pseudolagosuchus ・ Pseudolaguvia ・ Pseudolaguvia tenebricosa ・ Pseudolais ・ Pseudolampetis ・ Pseudolarentia Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Pseudoknot ： ウィキペディア英語版 Pseudoknot __NOTOC__ A pseudoknot is a nucleic acid secondary structure containing at least two stem-loop structures in which half of one stem is intercalated between the two halves of another stem. The pseudoknot was first recognized in the turnip yellow mosaic virus in 1982. Pseudoknots fold into knot-shaped three-dimensional conformations but are not true topological knots. ==Prediction and identification== The structural configuration of pseudoknots does not lend itself well to bio-computational detection due to its context-sensitivity or “overlapping” nature. The base pairing in pseudoknots is not well nested; that is, base pairs occur that "overlap" one another in sequence position. This makes the presence of pseudoknots in RNA sequences more difficult to predict by the standard method of dynamic programming, which use a recursive scoring system to identify paired stems and consequently, most cannot detect non-nested base pairs. The newer method of stochastic context-free grammars suffers from the same problem. Thus, popular secondary structure prediction methods like (Mfold ) and (Pfold ) will not predict pseudoknot structures present in a query sequence; they will only identify the more stable of the two pseudoknot stems. It is possible to identify a limited class of pseudoknots using dynamic programming, but these methods are not exhaustive and scale worse as a function of sequence length than non-pseudoknotted algorithms.〔Rivas E, Eddy S. (1999). "A dynamic programming algorithm for RNA structure prediction including pseudoknots". ''J Mol Biol'' 285(5): 2053–2068.〕〔Dirks, R.M. Pierce N.A. (2004) An algorithm for computing nucleic acid base-pairing probabilities including pseudoknots. "J Computation Chemistry". 25:1295-1304, 2004.〕 The general problem of predicting lowest free energy structures with pseudoknots has been shown to be NP-complete.〔Lyngsø RB, Pedersen CN. (2000). "RNA pseudoknot prediction in energy-based models". ''J Comput Biol'' 7(3–4): 409–427.〕〔Lyngsø, R. B. (2004). Complexity of pseudoknot prediction in simple models. Paper presented at the ICALP.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pseudoknot」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.