Sciweavers

282 search results - page 45 / 57
» On predicting secondary structure transition
Sort
View
ISMB
1994
13 years 9 months ago
Optimally Parsing a Sequence into Different Classes Based on Multiple Types of Evidence
Weconsider the problem of parsing a sequence into different classes of subsequences.Twocommonexamplesare finding the exons and introns in genomicsequences and identifying the seco...
Gary D. Stormo, David Haussler
TCBB
2010
114views more  TCBB 2010»
13 years 6 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...
RECOMB
2006
Springer
14 years 7 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 1 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
JCB
2006
215views more  JCB 2006»
13 years 7 months ago
Protein Fold Recognition Using Segmentation Conditional Random Fields (SCRFs)
Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e., segmentation con...
Yan Liu 0002, Jaime G. Carbonell, Peter Weigele, V...