Sciweavers

418 search results - page 21 / 84
» Parallel Computation in Biological Sequence Analysis
Sort
View
BMCBI
2008
128views more  BMCBI 2008»
13 years 7 months ago
Finding sequence motifs with Bayesian models incorporating positional information: an application to transcription factor bindin
Background: Biologically active sequence motifs often have positional preferences with respect to a genomic landmark. For example, many known transcription factor binding sites (T...
Nak-Kyeong Kim, Kannan Tharakaraman, Leonardo Mari...
BMCBI
2010
95views more  BMCBI 2010»
13 years 7 months ago
Quantifying the relationship between sequence and three-dimensional structure conservation in RNA
Background: In recent years, the number of available RNA structures has rapidly grown reflecting the increased interest on RNA biology. Similarly to the studies carried out two de...
Emidio Capriotti, Marc A. Martí-Renom
CF
2008
ACM
13 years 9 months ago
Cell-SWat: modeling and scheduling wavefront computations on the cell broadband engine
This paper contributes and evaluates a model and a methodology for implementing parallel wavefront algorithms on the Cell Broadband Engine. Wavefront algorithms are vital in sever...
Ashwin M. Aji, Wu-chun Feng, Filip Blagojevic, Dim...
RECOMB
2003
Springer
14 years 8 months ago
Maximum entropy modeling of short sequence motifs with applications to RNA splicing signals
We propose a framework for modeling sequence motifs based on the maximum entropy principle (MEP). We recommend approximating short sequence motif distributions with the maximum en...
Gene W. Yeo, Christopher B. Burge
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
13 years 11 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos