## Abstract A loop closureβbased sequential algorithm, PRODA\_MATCH, was developed to match catalytic residues onto a scaffold for enzyme design __in silico__. The computational complexity of this algorithm is polynomial with respect to the number of active sites, the number of catalytic residues,
A computational algorithm for selecting robust designs in safety and quality critical processes
β Scribed by S. Mukhopadhyay; D. Chakraborty
- Book ID
- 107704365
- Publisher
- Springer-Verlag
- Year
- 2011
- Tongue
- English
- Weight
- 401 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0976-8386
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Lncs Volumes 2073 And 2074 Contain The Proceedings Of The International Conference On Computational Science, Iccs 2001, Held In San Francisco, California, May 27-31, 2001. The Two Volumes Consist Of More Than 230 Contributed And Invited Papers That Reflect The Aims Of The Conference To Bring Togethe
It is our great pleasure to welcome you to the proceedings of the 10th annual event of the International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP). ICA3PP is recognized as the main regular event covering the many dimensions of parallel algorithms and architectures,