Sciweavers

5 search results - page 1 / 1
» Factorising folds for faster functions
Sort
View
JFP
2010
71views more  JFP 2010»
13 years 3 months ago
Factorising folds for faster functions
Graham Hutton, Mauro Jaskelioff, Andy Gill
BMCBI
2008
123views more  BMCBI 2008»
13 years 5 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
BMCBI
2010
116views more  BMCBI 2010»
13 years 5 months ago
A hybrid approach to protein folding problem integrating constraint programming with local search
Background: The protein folding problem remains one of the most challenging open problems in computational biology. Simplified models in terms of lattice structure and energy func...
Abu Zafer M. Dayem Ullah, Kathleen Steinhöfel
BMCBI
2007
233views more  BMCBI 2007»
13 years 5 months ago
160-fold acceleration of the Smith-Waterman algorithm using a field programmable gate array (FPGA)
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
Isaac T. S. Li, Warren Shum, Kevin Truong
BMCBI
2011
12 years 9 months ago
Structator: fast index-based search for RNA sequence-structure patterns
Background: The secondary structure of RNA molecules is intimately related to their function and often more conserved than the sequence. Hence, the important task of searching dat...
Fernando Meyer, Stefan Kurtz, Rolf Backofen, Sebas...