Determine an on-lattice representation for an input biomolecule.
Highlights:
The web server implements a Markov Chain Monte-Carlo algorithm with simulated annealing to compute an approximate fit for either the coarse-grain model or backbone model on either the cubic or face-centered cubic lattice.
LocalMove returns a PDB file as output, as well as dynamic movie of 3D images of intermediate conformations during the computation.
