posted on 2003-05-01, 00:00authored byChristopher J. Langmead, Sumit Kumar Jha
We explore the use of bit-vector decision procedures for the
analysis of protein folding pathways. We argue that the protein folding problem is not identical to the classical probabilistic model checking
problem in verification. Motivated by the different nature of the protein
folding problem, we present a translation of the protein folding pathways
analysis problem into a bounded model checking framework with bit vector decision procedures.We also present initial results of our experiments
using the UCLID bit-vector decision procedure.
History
Publisher Statement
The original publication is available at www.springerlink.com