Sciweavers

10988 search results - page 111 / 2198
» Algorithmic Folding Complexity
Sort
View
132
Voted
SAC
2009
ACM
15 years 9 months ago
GTfold: a scalable multicore code for RNA secondary structure prediction
The prediction of the correct secondary structures of large RNAs is one of the unsolved challenges of computational molecular biology. Among the major obstacles is the fact that a...
Amrita Mathuriya, David A. Bader, Christine E. Hei...
143
Voted
BMCBI
2007
149views more  BMCBI 2007»
15 years 2 months ago
A unified framework for finding differentially expressed genes from microarray experiments
Background: This paper presents a unified framework for finding differentially expressed genes (DEGs) from the microarray data. The proposed framework has three interrelated modul...
Jahangheer S. Shaik, Mohammed Yeasin
BMCBI
2008
114views more  BMCBI 2008»
15 years 2 months ago
Dinucleotide controlled null models for comparative RNA gene prediction
Background: Comparative prediction of RNA structures can be used to identify functional noncoding RNAs in genomic screens. It was shown recently by Babak et al. [BMC Bioinformatic...
Tanja Gesell, Stefan Washietl
ANCS
2005
ACM
15 years 8 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
ADMA
2006
Springer
127views Data Mining» more  ADMA 2006»
15 years 8 months ago
Feature Selection for Complex Patterns
Feature selection is an important data preprocessing step in data mining and pattern recognition. Many algorithms have been proposed in the past for simple patterns that can be cha...
Peter Schenkel, Wanqing Li, Wanquan Liu