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.

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.

Clinical phenotype and the lack of mutations in the CHRNG, CHRND, and CHRNA1 genes in two Indian families with Escobar syndrome

The objective of this study was to report the clinical phenotype and genetic analysis of two Indian families with Escobar syndrome (ES). The diagnosis of ES in both families was made on the basis of published clinical features. Blood samples were collected from members of both families and used in genomic DNA isolation. The entire coding regions and intron-exon junctions of the ES gene CHRNG (cholinergic receptor, nicotinic, gamma), and two other related genes, CHRND and CHRNA1, were amplified and sequenced to search for mutations in both families. Both families show a typical form of ES. Sequencing of the entire coding regions including the intron-exon junctions of the three genes did not yield any mutations in these families. In conclusion, it is possible that the mutations in these genes are located in the promoter or deep intronic regions that we failed to identify or the ES in these families is caused by mutations in a different gene. The lack of mutations in CHRNG has also been reported in several families, suggesting the possibility of at least one more gene for this syndrome. Clin Dysmorphol 22:54-58 (C) 2013 Wolters Kluwer Health vertical bar Lippincott Williams & Wilkins.

Investigations of Ramachandran disallowed conformations in protein domain families

In peptide and protein structures, occurrence of (phi,psi.) angles in the disallowed region of the Ramachandran map almost always suggests local regions of error or poor accuracy. However, very rarely genuine disallowed conformations occur as noted in the current study in proteins of known structure available at ultra-high resolution (<= 1.2 (A) over circle). In the current work, extent of conservation of genuine disallowed conformations in homologous proteins of known structures has been analyzed. From a dataset of 124 protein domain families, with structure of at least one constituent member in each family available at a resolution of 1.2 (A) over circle or better, we have analyzed the conservation of 221 disallowed conformations. It is observed that the disallowed conformation is only moderately conservedin protein domain families. In the gross dataset no particular residue type adopting disallowed conformation elicit high conservation of residue type though there are alignment positions in the dataset with complete conservation of both the residue type and the disallowed conformation. Conserved disallowed conformation in protein domain families play biologically significant role in roughly 50% of the cases. The residues with the disallowed conformation or its flanking residues are often located within or around the functional site of the protein. (C) 2013 Elsevier B.V. All rights reserved.

Conformational characteristics of asparaginyl residues in proteins

Backbone conformations at 1064 asparaginyl residues in 123 non-homologous, high-resolution X-ray structures of proteins were analysed. Asn adopts conformations in left-handed x-helical region and other partially allowed regions in the Ramachandran map more readily than any other non-glycyl residue. Asn conformational clusters in the (phi,psi) regions of left-handed alpha-helix, right-handed alpha-helix and extended (beta) strands were investigated in detail for their occurrence in various secondary structures, especially in beta-turn regions. Preferences were observed for Asn conformations in different positions in various beta-turn types, including the first and fourth positions of the turn. Asparaginyl residues with extended conformations are found to occur frequently in irregular regions, although they are expected to occur predominantly in extended strands or in the third position of type II beta-turns. Asn conformations at the N-cap positions of helices strongly prefer extended conformation than alpha(L), which seems to be characteristic of non-glycyl residues at that position. In the linkers connecting two extended strands and those connecting an alpha-helix and an extended strand, Asn with alpha(L) or alpha(R) conformation is more favoured than Asn with the beta-conformation. Analysis of Asn-Asn doublets and Asn-X-Asn triplets permitted identification of conformational families in such sequences. Results of this investigation provide useful hints in modelling Asn-rich regions in proteins such as malaria parasite coat protein. (C) Munksgaard 1994.

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

A resource based game theoretical model for military conflicts

A resource interaction based game theoretical model for military conflicts is presented in this paper. The model includes both the spatial decision capability of adversaries (decision regarding movement and subsequent distribution of resources) as well as their temporal decision capability (decision regarding level of allocation of resources for conflict with adversary’s resources). Attrition is decided at present by simple deterministic models. An additional feature of this model is the inclusion of the possibility of a given resource interacting with several resources of the adversary.The decisions of the adversaries is determined by solving for the equilibrium Nash strategies given that the objectives of the adversaries may not be in direct conflict. Examples are given to show the applicability of these models and solution concepts.

Non-Syndromic Hearing Impairment in India: High Allelic Heterogeneity among Mutations in TMPRSS3, TMC1, USHIC, CDH23 and TMIE

Mutations in the autosomal genes TMPRSS3, TMC1, USHIC, CDH23 and TMIE are known to cause hereditary hearing loss. To study the contribution of these genes to autosomal recessive, non-syndromic hearing loss (ARNSHL) in India, we examined 374 families with the disorder to identify potential mutations. We found four mutations in TMPRSS3, eight in TMC1, ten in USHIC, eight in CDH23 and three in TMIE. Of the 33 potentially pathogenic variants identified in these genes, 23 were new and the remaining have been previously reported. Collectively, mutations in these five genes contribute to about one-tenth of ARNSHL among the families examined. New mutations detected in this study extend the allelic heterogeneity of the genes and provide several additional variants for structure-function correlation studies. These findings have implications for early DNA-based detection of deafness and genetic counseling of affected families in the Indian subcontinent.

Minimizing total weighted tardiness on heterogeneous batch processors with incompatible job families

In this paper, we address a scheduling problem for minimizing total weighted tardiness. The background for the paper is derived from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real-life scenarios like unequal release times, incompatible job families, nonidentical job sizes, heterogeneous batch processors, and allowance for job splitting have been considered. We have developed a mathematical model which takes into account dynamic starting conditions. The problem considered in this study is NP-hard in nature, and hence heuristic algorithms have been proposed to address it. For real-life large-size problems, the performance of the proposed heuristic algorithms is evaluated using the method of estimated optimal solution available in literature. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal statistically estimated solutions in very reasonable computational time.

Mud-packing frog: A novel breeding behaviour and parental care in a stream dwelling new species of Nyctibatrachus (Amphibia, Anura, Nyctibatrachidae)

Reproductive modes are diverse and unique in anurans. Selective pressures of evolution, ecology and environment are attributed to such diverse reproductive modes. Globally forty different reproductive modes in anurans have been described to date. The genus Nyctibatrachus has been recently revised and belongs to an ancient lineage of frog families in the Western Ghats of India. Species of this genus are known to exhibit mountain associated clade endemism and novel breeding behaviours. The purpose of this study is to present unique reproductive behaviour, oviposition and parental care in a new species Nyctibatrachus kumbara sp. nov. which is described in the paper. Nyctibatrachus kumbara sp. nov. is a medium sized stream dwelling frog. It is distinct from the congeners based on a suite of morphological characters and substantially divergent in DNA sequences of the mitochondrial 16S rRNA gene. Males exhibit parental care by mud packing the egg clutch. Such parental care has so far not been described from any other frog species worldwide. Besides this, we emphasize that three co-occurring congeneric species of Nyctibatrachus, namely N. jog, N. kempholeyensis and Nyctibatrachus kumbara sp. nov. from the study site differ in breeding behaviour, which could represent a case of reproductive character displacement. These three species are distinct in their size, call pattern, reproductive behaviour, maximum number of eggs in a clutch, oviposition and parental care, which was evident from the statistical analysis. The study throws light on the reproductive behaviour of Nyctibatrachus kumbara sp. nov. and associated species to understand the evolution and adaptation of reproductive modes of anurans in general, and Nyctibatrachus in particular from the Western Ghats.

As(3)p: A Fast Algorithm to Search Structurally Similar Protiens

Protein structure comparison is essential for understanding various aspects of protein structure, function and evolution. It can be used to explore the structural diversity and evolutionary patterns of protein families. In view of the above, a new algorithm is proposed which performs faster protein structure comparison using the peptide backbone torsional angles. It is fast, robust, computationally less expensive and efficient in finding structural similarities between two different protein structures and is also capable of identifying structural repeats within the same protein molecule.

De-DUFing the DUFs: Deciphering distant evolutionary relationships of Domains of Unknown Function using sensitive homology detection methods

Background: In the post-genomic era where sequences are being determined at a rapid rate, we are highly reliant on computational methods for their tentative biochemical characterization. The Pfam database currently contains 3,786 families corresponding to ``Domains of Unknown Function'' (DUF) or ``Uncharacterized Protein Family'' (UPF), of which 3,087 families have no reported three-dimensional structure, constituting almost one-fourth of the known protein families in search for both structure and function. Results: We applied a `computational structural genomics' approach using five state-of-the-art remote similarity detection methods to detect the relationship between uncharacterized DUFs and domain families of known structures. The association with a structural domain family could serve as a start point in elucidating the function of a DUF. Amongst these five methods, searches in SCOP-NrichD database have been applied for the first time. Predictions were classified into high, medium and low-confidence based on the consensus of results from various approaches and also annotated with enzyme and Gene ontology terms. 614 uncharacterized DUFs could be associated with a known structural domain, of which high confidence predictions, involving at least four methods, were made for 54 families. These structure-function relationships for the 614 DUF families can be accessed on-line at http://proline.biochem.iisc.ernet.in/RHD_DUFS/. For potential enzymes in this set, we assessed their compatibility with the associated fold and performed detailed structural and functional annotation by examining alignments and extent of conservation of functional residues. Detailed discussion is provided for interesting assignments for DUF3050, DUF1636, DUF1572, DUF2092 and DUF659. Conclusions: This study provides insights into the structure and potential function for nearly 20 % of the DUFs. Use of different computational approaches enables us to reliably recognize distant relationships, especially when they converge to a common assignment because the methods are often complementary. We observe that while pointers to the structural domain can offer the right clues to the function of a protein, recognition of its precise functional role is still `non-trivial' with many DUF domains conserving only some of the critical residues. It is not clear whether these are functional vestiges or instances involving alternate substrates and interacting partners. Reviewers: This article was reviewed by Drs Eugene Koonin, Frank Eisenhaber and Srikrishna Subramanian.

DETERMINISTIC ALGORITHMS FOR MATCHING AND PACKING PROBLEMS BASED ON REPRESENTATIVE SETS

In this work, we study the well-known r-DIMENSIONAL k-MATCHING ((r, k)-DM), and r-SET k-PACKING ((r, k)-SP) problems. Given a universe U := U-1 ... U-r and an r-uniform family F subset of U-1 x ... x U-r, the (r, k)-DM problem asks if F admits a collection of k mutually disjoint sets. Given a universe U and an r-uniform family F subset of 2(U), the (r, k)-SP problem asks if F admits a collection of k mutually disjoint sets. We employ techniques based on dynamic programming and representative families. This leads to a deterministic algorithm with running time O(2.851((r-1)k) .vertical bar F vertical bar. n log(2)n . logW) for the weighted version of (r, k)-DM, where W is the maximum weight in the input, and a deterministic algorithm with running time O(2.851((r-0.5501)k).vertical bar F vertical bar.n log(2) n . logW) for the weighted version of (r, k)-SP. Thus, we significantly improve the previous best known deterministic running times for (r, k)-DM and (r, k)-SP and the previous best known running times for their weighted versions. We rely on structural properties of (r, k)-DM and (r, k)-SP to develop algorithms that are faster than those that can be obtained by a standard use of representative sets. Incorporating the principles of iterative expansion, we obtain a better algorithm for (3, k)-DM, running in time O(2.004(3k).vertical bar F vertical bar . n log(2)n). We believe that this algorithm demonstrates an interesting application of representative families in conjunction with more traditional techniques. Furthermore, we present kernels of size O(e(r)r(k-1)(r) logW) for the weighted versions of (r, k)-DM and (r, k)-SP, improving the previous best known kernels of size O(r!r(k-1)(r) logW) for these problems.