๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

โœ Scribed by Berry, A.; Krueger, R.; Simonet, G.

Book ID
118197672
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
327 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The minimized dead-end elimination crite
The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles
โœ Ivelin Georgiev; Ryan H. Lilien; Bruce R. Donald ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 668 KB

## Abstract One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonlyโ€observed lowโ€energy sideโ€chain conformations, further increases the comple

[Lecture Notes in Computer Science] Inte
[Lecture Notes in Computer Science] Intelligent Data Engineering and Automated Learning - IDEAL 2011 Volume 6936 || Finding First-Order Minimal Unsatisfiable Cores with a Heuristic Depth-First-Search Algorithm
โœ Yin, Hujun; Wang, Wenjia; Rayward-Smith, Victor ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 181 KB

This book constitutes the refereed proceedings of the 12th International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2011, held in Norwich, UK, in September 2011. The 59 revised full papers presented were carefully reviewed and selected from numerous submissions for incl