110 search results - page 22 / 22 » Faster Algorithms for Optimal Multiple Sequence Alignment Ba... |
BMCBI
2010
13 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
ACMSE
2009
ACM
14 years 1 months ago
2009
ACM
An algorithm is proposed for the purpose of optimizing the availability of files to an operating system prior to their being required during execution by a running system. This al...
ECCV
2008
Springer
14 years 5 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
BMCBI
2006
13 years 7 months ago
2006
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
ALMOB
2006
13 years 7 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...