𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Greedy Algorithm for Decomposing Convex Structuring Elements

✍ Scribed by Ronaldo Fumio Hashimoto; Junior Barrera

Book ID
110426299
Publisher
Springer US
Year
2003
Tongue
English
Weight
270 KB
Volume
18
Category
Article
ISSN
0924-9907

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A greedy algorithm for convex geometries
A greedy algorithm for convex geometries
✍ Kenji Kashiwabara; Yoshio Okamoto 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dual of antimatroids. We consider functions deÿned on the sets of the extreme points of a convex geometry. Faigle-Kern (Math. Programming 72 (1996) 195-206) presented a greedy algorithm to linear program

Improved greedy algorithm for protein st
Improved greedy algorithm for protein structure reconstruction
✍ Pierre Tuffery; Frédéric Guyon; Philippe Derreumaux 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

## Abstract This article concerns the development of an improved greedy algorithm for protein structure reconstruction. Our stochastic greedy algorithm, which attempts to locate the ground state of an approximate energy function, exploits the fact that protein structures consist of overlapping stru