- Full text PDF available (2)
- This year (0)
- Last five years (1)
BACKGROUND A common approach to the protein folding problem involves computer simulation of folding using lattice models of amino acid sequences. Key factors for good performance in such models are the correct choice of the temperature and the average interaction energy between residues. In order to push the lattice approach to its limit it is important to… (More)
Let ex (D; H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is nite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex (D; H) = O(D 2 ex (D; P m)). Constructively, ex (D; qP m) = (qD 2 ex (D; P m)) if q > 1 and m > 2 (((qD 2) if m = 2). For H =… (More)
A graph is H-free if it has no induced subgraph isomorphic to H.
UNLABELLED Insect-resistant films containing a microencapsulated insect-repelling agent were developed to protect food products from the Indian meal moth (Plodia interpunctella). Cinnamon oil (CO), an insect repelling agent, was encapsulated with gum arabic, whey protein isolate (WPI)/maltodextrin (MD), or poly(vinyl alcohol) (PVA). A low-density… (More)