Sciweavers

335 search results - page 47 / 67
» Solving the Hamiltonian path problem with a light-based comp...
Sort
View
BIOINFORMATICS
2008
119views more  BIOINFORMATICS 2008»
13 years 11 months ago
Optimal design of thermally stable proteins
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
Ryan M. Bannen, Vanitha Suresh, George N. Phillips...
JCO
2011
113views more  JCO 2011»
13 years 5 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
BMCBI
2005
114views more  BMCBI 2005»
13 years 10 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
IPPS
2000
IEEE
14 years 3 months ago
Using Logs to Increase Availability in Real-Time Main-Memory Database
Abstract. Real-time main-memory databases are useful in real-time environments. They are often faster and provide more predictable execution of transactions than disk-based databas...
Tiina Niklander, Kimmo E. E. Raatikainen
DAC
2008
ACM
14 years 12 months ago
Robust chip-level clock tree synthesis for SOC designs
A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to differ...
Anand Rajaram, David Z. Pan