Search

Interaction graphs provide an important qualitative modeling approach for System Biology. This paper presents a novel approach for construction of interaction graph with the help of Boolean function decomposition. Each decomposition part (Consisting of 2-bits) of the Boolean functions has some important significance. In the dynamics of a biological system, each variable or node is nothing but gene or protein. Their regulation has been explored in terms of interaction graphs which are generated by Boolean functions. In this paper, different classes of Boolean functions with regards to Interaction Graph with biologically significant properties have been adumbrated., Comment: 11 pages, 6 figures

Intricate comparison between two given tertiary structures of proteins is as important as the comparison of their functions. Several algorithms have been devised to compute the similarity and dissimilarity among protein structures. But, these algorithms compare protein structures by structural alignment of the protein backbones which are usually unable to determine precise differences. In this paper, an attempt has been made to compute the similarities and dissimilarities among 3D protein structures using the fundamental mathematical morphology operations and fractal geometry which can resolve the problem of real differences. In doing so, two techniques are being used here in determining the superficial structural (global similarity) and local similarity in atomic level of the protein molecules. This intricate structural difference would provide insight to Biologists to understand the protein structures and their functions more precisely.

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where only one affine Boolean function belongs to each class. Two different methods are proposed to achieve this classification. The first method is a recursive procedure that uses the Cartesian product of sets starting from the set of 1-variable Boolean function and in the second method classification is achieved through a set of invariant bit positions with respect to an affine function belonging to that class. The invariant bit positions also provide information concerning the size and symmetry properties of the classes/sub-classes, such that the members of classes/sub-classes satisfy certain similar properties., Comment: 12 pages