2191 search results - page 416 / 439 » Improving the Efficiency of Non-Deterministic Computations |
BMCBI
2010
13 years 9 months ago
2010
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...
BMCBI
2008
13 years 9 months ago
2008
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
BMCBI
2008
13 years 9 months ago
2008
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
CAD
2008
Springer
13 years 9 months ago
2008
Springer
The main difficulty associated with a collaborative design process is understanding the product data exchanged during design. Efficient and effective coordination of design activi...
BMCBI
2006
13 years 9 months ago
2006
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...