Analysis on conservation of disulphide bonds and their structural features in homologous protein domain families

Background: Disulphide bridges are well known to play key roles in stability, folding and functions of proteins. Introduction or deletion of disulphides by site-directed mutagenesis have produced varying effects on stability and folding depending upon the protein and location of disulphide in the 3-D structure. Given the lack of complete understanding it is worthwhile to learn from an analysis of extent of conservation of disulphides in homologous proteins. We have also addressed the question of what structural interactions replaces a disulphide in a homologue in another homologue. Results: Using a dataset involving 34,752 pairwise comparisons of homologous protein domains corresponding to 300 protein domain families of known 3-D structures, we provide a comprehensive analysis of extent of conservation of disulphide bridges and their structural features. We report that only 54% of all the disulphide bonds compared between the homologous pairs are conserved, even if, a small fraction of the non-conserved disulphides do include cytoplasmic proteins. Also, only about one fourth of the distinct disulphides are conserved in all the members in protein families. We note that while conservation of disulphide is common in many families, disulphide bond mutations are quite prevalent. Interestingly, we note that there is no clear relationship between sequence identity between two homologous proteins and disulphide bond conservation. Our analysis on structural features at the sites where cysteines forming disulphide in one homologue are replaced by non-Cys residues show that the elimination of a disulphide in a homologue need not always result in stabilizing interactions between equivalent residues. Conclusion: We observe that in the homologous proteins, disulphide bonds are conserved only to a modest extent. Very interestingly, we note that extent of conservation of disulphide in homologous proteins is unrelated to the overall sequence identity between homologues. The non-conserved disulphides are often associated with variable structural features that were recruited to be associated with differentiation or specialisation of protein function.

Families of asymptotic tensile crack tip stress fields in elastic-perfectly plastic single crystals

In this work, two families of asymptotic near-tip stress fields are constructed in an elastic-ideally plastic FCC single crystal under mode I plane strain conditions. A crack is taken to lie on the (010) plane and its front is aligned along the [(1) over bar 01] direction. Finite element analysis is first used to systematically examine the stress distributions corresponding to different constraint levels. The general framework developed by Rice (Mech Mater 6:317-335, 1987) and Drugan (J Mech Phys Solids 49:2155-2176, 2001) is then adopted to generate low triaxiality solutions by introducing an elastic sector near the crack tip. The two families of stress fields are parameterized by the normalized opening stress (tau(A)(22)/tau(o)) prevailing in the plastic sector in front of the tip and by the coordinates of a point where elastic unloading commences in stress space. It is found that the angular stress variations obtained from the analytical solutions show good agreement with finite element analysis.

ADAMIS: a database for medical information systems

This paper describes the design and implementation of ADAMIS (‘A database for medical information systems’). ADAMIS is a relational database management system for a general hospital environment. Apart from the usual database (DB) facilities of data definition and data manipulation, ADAMIS supports a query language called the ‘simplified medical query language’ (SMQL) which is completely end-user oriented and highly non-procedural. Other features of ADAMIS include provision of facilities for statistics collection and report generation. ADAMIS also provides adequate security and integrity features and has been designed mainly for use on interactive terminals.

Pseudo-time marching schemes for inverse problems in structural health assessment and medical imaging

We propose a self-regularized pseudo-time marching strategy for ill-posed, nonlinear inverse problems involving recovery of system parameters given partial and noisy measurements of system response. While various regularized Newton methods are popularly employed to solve these problems, resulting solutions are known to sensitively depend upon the noise intensity in the data and on regularization parameters, an optimal choice for which remains a tricky issue. Through limited numerical experiments on a couple of parameter re-construction problems, one involving the identification of a truss bridge and the other related to imaging soft-tissue organs for early detection of cancer, we demonstrate the superior features of the pseudo-time marching schemes.

CFD tools in engineering design studies and medical sciences

In the recent time CFD tools have become increasingly useful in the engineering design studies especially in the area of aerospace vehicles. This is largely due to the advent of high speed computing platforms in addition to the development of new efficient algorithms. The algorithms based on kinetic schemes have been shown to be very robust and further meshless methods offer certain advantages over the other methods. Preliminary investigations of blood flow visualization through artery using CFD tool have shown encouraging results which further needs to be verified and validated.

Scheduling parallel batch processors with incompatible job families using ant colony optimization

The present work concerns with the static scheduling of jobs to parallel identical batch processors with incompatible job families for minimizing the total weighted tardiness. This scheduling problem is applicable in burn-in operations and wafer fabrication in semiconductor manufacturing. We decompose the problem into two stages: batch formation and batch scheduling, as in the literature. The Ant Colony Optimization (ACO) based algorithm called ATC-BACO algorithm is developed in which ACO is used to solve the batch scheduling problems. Our computational experimentation shows that the proposed ATC-BACO algorithm performs better than the available best traditional dispatching rule called ATC-BATC rule.

A Genetic Study of Immunoglobulin E and Atopic Disease Based on Families Ascertained through Asthmatic Children

In order to investigate the modes of inheritance of serum immunoglobulin E (IgE) levels and atopic disease, serum IgE levels and data on allergic disease were obtained from 42 families ascertained through asthmatic children visiting an allergy clinic. Although the mean IgE levels were elevated (mean 637 U/ml), the prevalence of atopic disease in this population was surprisingly low. When the data were analyzed using complex segregation analysis, no major locus could be detected. Moreover, the polygenic heritability was unexpectedly small even though the correlation between serum IgE levels and the liability to atopic disease was around 0.4. Given this unusual set of findings, it is postulated that parasitic infections in this population have (in accordance with well-established results of parasitic disease) caused both elevated levels of serum IgE and a decreased prevalence of allergic disease with the possible masking of the various genetic components of serum IgE levels and atopic disease.

Minimizing total completion time on a batch processing machine with job families

We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry

Germline BRCA1 mutation analysis in Indian breast/ovarian cancer families

Most of the predisposition to hereditary breast and ovarian cancer has been attributed to inherited defects in two tumor suppressor genes BRCA1 and BRCA2. To explore the contribution of BRCA1 mutations to hereditary breast cancer among Indian women, we examined the coding sequence of the BRCA1 gene in 14 breast cancer patients with a positive family history of breast and/or ovarian cancer. Mutation analysis was carried out using conformation sensitive gel electrophoresis (CSGE) followed by sequencing. Three mutations (21%) in the BRCA1 gene were identified. Two of them are novel mutations of which one is a missense mutation in exon 7 near the RING finger domain, while the other is a one base pair deletion in exon 11 which results in protein truncation. The third mutation, 185delAG, has been previously described in Ashkenazi Jewish families. To our knowledge this is the first report of a study of germline BRCA1 mutation analysis in familial breast cancer in India. Our data from 14 different families suggests a lower prevalence but definite involvement of germline mutations in the BRCA1 gene among Indian women with breast cancer and a family history of breast cancer.

Two new families of low-correlation interleaved QAM sequence

Two families of low correlation QAM sequences are presented here. In a CDMA setting, these sequences have the ability to transport a large amount of data as well as enable variable-rate signaling on the reverse link. The first family Á2SQ - B2− is constructed by interleaving 2 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ≥ 2. Over 16-QAM, the normalized maximum correlation [`(q)]maxmax is bounded above by <~1.17 ÖNUnknown control sequence '\lesssim' , where N is the period of the sequences in the family. This upper bound on [`(q)]maxmax is the lowest among all known sequence families over 16-QAM.The second family Á4SQ4 is constructed by interleaving 4 selected QAM sequences. This family is defined over M 2-QAM, where M = 2 m , m ≥ 3, i.e., 64-QAM and beyond. The [`(q)]maxmax for sequences in this family over 64-QAM is upper bounded by <~1.60 ÖNUnknown control sequence '\lesssim' . For large M, [`(q)]max <~1.64 ÖNUnknown control sequence '\lesssim' . These upper bounds on [`(q)]maxmax are the lowest among all known sequence families over M 2-QAM, M = 2 m , m ≥ 3.

OOCs, Partial Relative Difference Families and a Conjecture of Golomb

The cyclic difference sets constructed by Singer are also examples of perfect distinct difference sets (DDS). The Bose construction of distinct difference sets, leads to a relative difference set. In this paper we introduce the concept of partial relative DDS and prove that an optical orthogonal code (OOC) construction due to Moreno et. al., is a partial relative DDS. We generalize the concept of ideal matrices previously introduced by Kumar and relate it to the concepts of this paper. Another variation of ideal matrices is introduced in this paper: Welch ideal matrices of dimension n by (n - 1). We prove that Welch ideal matrices exist only for n prime. Finally, we recast an old conjecture of Golomb on the Welch construction of Costas arrays using the concepts of this paper. This connection suggests that our construction of partial relative difference sets is in a sense, unique