이 에피소드의 오디오가 손상되었을 수 있습니다.
How to fix it?
이 에피소드에 관해
Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.08.04.551958v1?rss=1
Authors: Courtney, E., Datta, A., Mathews, D. H., Ward, M.
Abstract:
Determining RNA secondary structure is a core problem in computational biology. Fast algorithms for predicting secondary structure are fundamental to this task. We describe a modified formulation of the Zuker-Stiegler algorithm with coaxial stacking, a stabilizing interaction in which the ends of multi-loops are stacked. In particular, optimal coaxial stacking is computed as part of the dynamic programming state, rather than inline. We introduce a new notion of sparsity, which we call replaceability. The modified formulation along with replaceability allows sparsification to be applied to coaxial stacking as well, which increases the speed of the algorithm. We implemented this algorithm in software we call memerna, which we show to have the fastest exact RNA folding implementation out of several popular RNA folding packages supporting coaxial stacking. We also introduce a new notation for secondary structure which includes coaxial stacking, terminal mismatches, and dangles (CTDs) information.
Copy rights belong to original authors. Visit the link for more info
Podcast created by Paper Player, LLC
http://biorxiv.org/cgi/content/short/2023.08.04.551958v1?rss=1
Authors: Courtney, E., Datta, A., Mathews, D. H., Ward, M.
Abstract:
Determining RNA secondary structure is a core problem in computational biology. Fast algorithms for predicting secondary structure are fundamental to this task. We describe a modified formulation of the Zuker-Stiegler algorithm with coaxial stacking, a stabilizing interaction in which the ends of multi-loops are stacked. In particular, optimal coaxial stacking is computed as part of the dynamic programming state, rather than inline. We introduce a new notion of sparsity, which we call replaceability. The modified formulation along with replaceability allows sparsification to be applied to coaxial stacking as well, which increases the speed of the algorithm. We implemented this algorithm in software we call memerna, which we show to have the fastest exact RNA folding implementation out of several popular RNA folding packages supporting coaxial stacking. We also introduce a new notation for secondary structure which includes coaxial stacking, terminal mismatches, and dangles (CTDs) information.
Copy rights belong to original authors. Visit the link for more info
Podcast created by Paper Player, LLC
영어
미국
이 팟캐스트의 다른 에피소드
Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.08.04.410498v1?rss=1
Authors: Dick, K., Green, J. R.
Abstract:
No. While our experiments ultimately failed, this work was motivated by the seemingly reasonable hypothesis that encoding protein sequences as a fractal-based image in…
Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.07.31.551395v1?rss=1
Authors: Xu, Z.
Abstract:
Background: Idiopathic pulmonary fibrosis (IPF) is a chronic and progressive lung disease characterized by excessive scarring of lung tissue. Recent studies have indicated a potential…
Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.08.01.551468v1?rss=1
Authors: Mukashyaka, P., Sheridan, T. B., Foroughi pour, A., Chuang, J. H.
Abstract:
Deep learning has revolutionized digital pathology, allowing for automatic analysis of hematoxylin and eosin (H&E) stain…
Link to bioRxiv paper:
http://biorxiv.org/cgi/content/short/2023.08.01.551396v1?rss=1
Authors: Liu, S., Yu, J., Ni, N., Wang, Z., Chen, M., Li, Y., Xu, C., Bai, Q., Ding, Y., Wang, C., Zhang, J., Yao, X., Liu, H.
Abstract:
Predicting drug-target interaction (DTI) is a critical and rate-limiting…
면책 조항: 이 페이지에 포함된 팟캐스트와 작품은 PaperPlayer에서 가져온 것입니다. 이 팟캐스트는 소유자의 재산이며 Listen Notes, Inc.와 제휴하거나 보증하지 않습니다.
