. The exact number of different protein dimers composing hexamers is related to the size of a given capsid, labeled by its T-number. Simple rules determining these numbers for each value of T are deduced and certain consequences are discussed. Keywords: Capsid growth; Self-organized agglomeration; Symmetry 1

Abstract not found

. The exact number of different protein dimers composing hexamers is related to the size of a given capsid, labeled by its T-number. Simple rules determining these numbers for each value of T are deduced and certain consequences are discussed. Keywords: Capsid growth; Self-organized agglomeration; Symmetry 1

. This paper shows that the current existing calculation method can generate different results that are algebraically equivalence. However, analysis of the combinatorial meanings of this calculation method shows significant flaw of the measure, which also explains why it does not satisfy Weyuker

Abstract. In this article we provide a review of Protection Motivation Theory with a focus on the interaction effects and combinatorial rules, in order to resolve conflicting findings in the literature. Our review suggests that perceived cost is the main driver of persuasion. We propose

This paper presents a simple and efficient association rule induction algorithm, the Combinatorial Rule Model (CRM), which has been applied to discover knowledge in health care databases, for data quality improvement purposes. In spite of being adapted from an exhaustive search system, its cost

of linear equations for the unknown elasticities is derived [ The constraints imposed on this linear system imply that modulations of more than one enzyme are not necessarily independent [ Simple combinatorial rules are described for identifying without using any algebra the set of independent modulations

We begin with a review of the basic concepts associated with admissible W-graphs, following the lecture notes of last year [S1] and the more detailed recent paper [S2]. We assume throughout that W is a finite Weyl group, with distinguished generators

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications

a method based on successive passes over the database. We give an improved algorithm for the problem. The method is based on careful combinatorial analysis of the information obtained in previous passes; this makes it possible to eliminate unnecessary candidate rules. Experiments on a university