Algorithmic computation of knot polynomials of secondary structure elements of proteins

The classification of protein structures is an important and still outstanding problem. The purpose of this paper is threefold. First, we utilize a relation between the Tutte and homfly polynomial to show that the Alexander-Conway polynomial can be algorithmically computed for a given planar graph. Second, as special cases of planar graphs, we use polymer graphs of protein structures. More precisely, we use three building blocks of the three-dimensional protein structure-alpha-helix, antiparallel beta-sheet, and parallel beta-sheet-and calculate, for their corresponding polymer graphs, the Tutte polynomials analytically by providing recurrence equations for all three secondary structure elements. Third, we present numerical results comparing the results from our analytical calculations with the numerical results of our algorithm-not only to test consistency, but also to demonstrate that all assigned polynomials are unique labels of the secondary structure elements. This paves the way for an automatic classification of protein structures.

IMMUNOCHEMICAL AND CHROMATOGRAPHIC ANALYSES OF A NEUROPEPTIDE FROM THE MONOGENEAN PARASITE, DICLIDOPHORA-MERLANGI - EVOLUTIONARY ASPECTS OF THE NEUROPEPTIDE-Y SUPERFAMILY

1. A neuropeptide exhibiting pancreatic polypeptide-immunoreactivity (PP-IR) has been isolated and characterised from the parasitic platyhelminth, Diclidophora merlangi.

Evolutionary Requirements for Next-Generation Dataflow-Based FPGA System Design

The use of dataflow digital signal processing system modelling
and synthesis techniques has been a fruitful research theme for many years and has yielded many powerful rapid system synthesis and optimisation capabilities. However, recent years have seen the spectrum of languages and techniques splinter in an application specific manner, resulting in an ad-hoc design process which is increasingly dependent on the particular application under development. This poses a major problem for automated toolflows attempting to provide rapid system synthesis for a wide ranges of applications. By analysing a number of dataflow FPGA implementation case studies, this paper shows that despit ethis common traits may be found in current techniques, which fall largely into three classes. Further, it exposes limitations pertaining to their ability to adapt algorith models to implementations for different operating environments and target platforms.