A novel multiplex PCR-RFLP method for simultaneous detection of the MTHFR 677 C > T, eNOS +894 G > T and - eNOS -786 T > C variants among Malaysian Malays

Background Hyperhomocysteinemia as a consequence of the MTHFR 677 C > T variant is associated with cardiovascular disease and stroke. Another factor that can potentially contribute to these disorders is a depleted nitric oxide level, which can be due to the presence of eNOS +894 G > T and eNOS −786 T > C variants that make an individual more susceptible to endothelial dysfunction. A number of genotyping methods have been developed to investigate these variants. However, simultaneous detection methods using polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) analysis are still lacking. In this study, a novel multiplex PCR-RFLP method for the simultaneous detection of MTHFR 677 C > T and eNOS +894 G > T and eNOS −786 T > C variants was developed. A total of 114 healthy Malay subjects were recruited. The MTHFR 677 C > T and eNOS +894 G > T and eNOS −786 T > C variants were genotyped using the novel multiplex PCR-RFLP and confirmed by DNA sequencing as well as snpBLAST. Allele frequencies of MTHFR 677 C > T and eNOS +894 G > T and eNOS −786 T > C were calculated using the Hardy Weinberg equation. Methods The 114 healthy volunteers were recruited for this study, and their DNA was extracted. Primer pair was designed using Primer 3 Software version 0.4.0 and validated against the BLAST database. The primer specificity, functionality and annealing temperature were tested using uniplex PCR methods that were later combined into a single multiplex PCR. Restriction Fragment Length Polymorphism (RFLP) was performed in three separate tubes followed by agarose gel electrophoresis. PCR product residual was purified and sent for DNA sequencing. Results The allele frequencies for MTHFR 677 C > T were 0.89 (C allele) and 0.11 (T allele); for eNOS +894 G > T, the allele frequencies were 0.58 (G allele) and 0.43 (T allele); and for eNOS −786 T > C, the allele frequencies were 0.87 (T allele) and 0.13 (C allele). Conclusions Our PCR-RFLP method is a simple, cost-effective and time-saving method. It can be used to successfully genotype subjects for the MTHFR 677 C > T and eNOS +894 G > T and eNOS −786 T > C variants simultaneously with 100% concordance from DNA sequencing data. This method can be routinely used for rapid investigation of the MTHFR 677 C > T and eNOS +894 G > T and eNOS −786 T > C variants.

Investigation of the 1758G>C and 2880A>G variants within the NCOA3 gene in a breast cancer affected Australian population

NCOA3 is a known low to moderate-risk breast cancer susceptibility gene, amplified in 5–10% and over expressed in about 60% of breast tumours. Additionally, this over expression is associated with Tamoxifen resistance and poor prognosis. Previously, two variants of NCOA3, 1758G > C and 2880A > G have been associated with breast cancer in two independent populations. Here we assessed the influence of the two NCOA3 variants on breast cancer risk by genotyping an Australian case–control study population. 172 cases and 178 controls were successfully genotyped for the 1758G > C variant and 186 cases and 182 controls were successfully genotyped for the 2880A > G variant using high-resolution melt analysis (HRM). The genotypes of the 1758G > C variant were validated by sequencing. χ2 tests were performed to determine if significant differences exist in the genotype and allele frequencies between the cases and controls. χ2 analysis returned no statistically significant difference (p > 0.05) for genotype frequencies between cases and controls for 1758G > C (χ2 = 0.97, p = 0.6158) or 2880A > G (χ2 = 2.09, p = 0.3516). Similarly, no statistical difference was observed for allele frequencies for 1758G > C (χ2 = 0.07, p = 0.7867) or 2880A > G (χ2 = 0.04, p = 0.8365). Haplotype analysis of the two SNPs also showed no difference between the cases and the controls (p = 0.9585). Our findings in an Australian Caucasian population composed of breast cancer sufferers and an age matched control population did not support the findings of previous studies demonstrating that these markers play a significant role in breast cancer susceptibility. Here, no significant difference was detected between breast cancer patients and healthy matched controls by either the genotype or allele frequencies for the investigated variants (all p ≥ 0.05). While an association of the two variants and breast cancer was not detected in our case–control study population, exploring these variants in a larger population of the same kind may obtain results in concordance with previous studies. Given the importance of NCOA3 and its involvement in biological processes involved in breast cancer and the possible implications variants of the gene could have on the response to Tamoxifen therapy, NCOA3 remains a candidate for further investigations.

G-protein β3 subunit gene (GNB3) variant in causation of essential hypertension

Essential hypertensives display enhanced signal transduction through pertussis toxin-sensitive G proteins. The T allele of a C825T variant in exon 10 of the G protein β3 subunit gene (GNB3) induces formation of a splice variant (Gβ3-s) with enhanced activity. The T allele of GNB3 was shown recently to be associated with hypertension in unselected German patients (frequency=0.31 versus 0.25 in control). To confirm and extend this finding in a different setting, we performed an association study in Australian white hypertensives. This involved an extensively examined cohort of 110 hypertensives, each of whom were the offspring of 2 hypertensive parents, and 189 normotensives whose parents were both normotensive beyond age 50 years. Genotyping was performed by polymerase chain reaction and digestion with BseDI, which either cut (C allele) or did not cut (T allele) the 268-bp polymerase chain reaction product. T allele frequency in the hypertensive group was 0.43 compared with 0.25 in the normotensive group (χ2=22; P=0.00002; odds ratio=2.3; 95% CI=1.7 to 3.3). The T allele tracked with higher pretreatment blood pressure: diastolic=105±7, 109±16, and 128±28 mm Hg (mean±SD) for CC, CT, and 7T, respectively (P=0.001 by 1-way ANOVA). Blood pressures were higher in female hypertensives with a T allele (P=0.006 for systolic and 0.0003 for diastolic by ANOVA) than they were in male hypertensives. In conclusion, the present study of a group with strong family history supports a role for a genetically determined, physiologically active splice variant of the G protein β3 subunit gene in the causation of essential hypertension.

An efficient algorithm for the detection of Eden

In this paper, a polynomial time algorithm is presented for solving the Eden problem for graph cellular automata. The algorithm is based on our neighborhood elimination operation which removes local neighborhood configurations which cannot be used in a pre-image of a given configuration. This paper presents a detailed derivation of our algorithm from first principles, and a detailed complexity and accuracy analysis is also given. In the case of time complexity, it is shown that the average case time complexity of the algorithm is \Theta(n^2), and the best and worst cases are \Omega(n) and O(n^3) respectively. This represents a vast improvement in the upper bound over current methods, without compromising average case performance.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Review : "Genetic Privacy: A challenge to Medico-Legal Norms" by Laurie, G

The discovery by Watson and Crick of the structure of DNA is one of the great scientific discoveries. In the period since that discovery new areas of genetic research have opened up which hold out the hope of developing treatments or cures for many illnesses and diseases. Yet with these discoveries have also come an array of ethical and legal dilemmas about the use of genetic information and concerns about the potential for those with genetic diseases or conditions to be stigmatised and discriminated against. The discussion about the developments in genetic science has become increasingly, a debate about the use of genetic information within our society. Graeme Laurie’s book, Genetic Privacy: A Challenge to Medico-Legal Norms, guides the reader through the complexities of these debates by considering what we mean by privacy and asking whether our existing concepts are adequate to meet the challenges posed by the new genetics.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Role of the N-terminal region in G protein-coupled receptor functions : negative modulation revealed by 5-HT2B receptor polymorphisms

The putative role of the N-terminal region of rhodopsin-like 7 transmembrane biogenic amine receptors in agonist-induced signaling has not yet been clarified despite recent advances in 7 transmembrane receptor structural biology. Given the existence of N-terminal nonsynonymous polymorphisms (R6G;E42G) within the HTR2B gene in a drug-abusing population, we assessed whether these polymorphisms affect 5-hydroxytryptamine 2B (5-HT2B) receptor in vitro pharmacologic and coupling properties in transfected COS-7 cells. Modification of the 5-HT2B receptor N terminus by the R6G;E42G polymorphisms increases such agonist signaling pathways as inositol phosphate accumulation as assessed by either classic or operational models. The N-terminal R6G;E42G mutations of the 5-HT2B receptor also increase cell proliferation and slow its desensitization kinetics compared with the wild-type receptor, further supporting a role for the N terminus in transduction efficacy. Furthermore, by coexpressing a tethered wild-type 5-HT2B receptor N terminus with a 5-HT2B receptor bearing a N-terminal deletion, we were able to restore original coupling. This reversion to normal activity of a truncated 5-HT2B receptor by coexpression of the membrane-tethered wild-type 5-HT2B receptor N terminus was not observed using a membrane-tethered 5-HT2B receptor R6G;E42G N terminus. These data suggest that the N terminus exerts a negative control over basal as well as agonist-stimulated receptor activity that is lost in the R6G;E42G mutant. Our findings reveal a new and unanticipated role of the 5-HT2B receptor N terminus as a negative modulator, affecting both constitutive and agonist-stimulated activity. Moreover, our data caution against excluding the N terminus and extracellular loops in structural studies of this 7 transmembrane receptor family

Graph theory based representation of building information models for access control applications

Building information models are increasingly being utilised for facility management of large facilities such as critical infrastructures. In such environments, it is valuable to utilise the vast amount of data contained within the building information models to improve access control administration. The use of building information models in access control scenarios can provide 3D visualisation of buildings as well as many other advantages such as automation of essential tasks including path finding, consistency detection, and accessibility verification. However, there is no mathematical model for building information models that can be used to describe and compute these functions. In this paper, we show how graph theory can be utilised as a representation language of building information models and the proposed security related functions. This graph-theoretic representation allows for mathematically representing building information models and performing computations using these functions.

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any t

Commentary on the article by Swanenburg et al. ‘Validity and reliability of a German version of the Neck Disability Index (NDI-G)’

We commend Swanenburg et al. (2013) on translation, development, and clinimetric analysis of the NDI-G. However, the dual-factor structure with factor analysis and the high level of internal consistency (IC) highlighted in their discussion were not emphasized in the abstract or conclusion. These points may imply some inconsistencies with the final conclusions since determination of stable point estimates with the study's small sample are exceedingly difficult.

Development of brain structural connectivity between ages 12 and 30: A 4-Tesla diffusion imaging study in 439 adolescents and adults

Understanding how the brain matures in healthy individuals is critical for evaluating deviations from normal development in psychiatric and neurodevelopmental disorders. The brain's anatomical networks are profoundly re-modeled between childhood and adulthood, and diffusion tractography offers unprecedented power to reconstruct these networks and neural pathways in vivo. Here we tracked changes in structural connectivity and network efficiency in 439 right-handed individuals aged 12 to 30 (211 female/126 male adults, mean age=23.6, SD=2.19; 31 female/24 male 12 year olds, mean age=12.3, SD=0.18; and 25 female/22 male 16 year olds, mean age=16.2, SD=0.37). All participants were scanned with high angular resolution diffusion imaging (HARDI) at 4 T. After we performed whole brain tractography, 70 cortical gyral-based regions of interest were extracted from each participant's co-registered anatomical scans. The proportion of fiber connections between all pairs of cortical regions, or nodes, was found to create symmetric fiber density matrices, reflecting the structural brain network. From those 70 × 70 matrices we computed graph theory metrics characterizing structural connectivity. Several key global and nodal metrics changed across development, showing increased network integration, with some connections pruned and others strengthened. The increases and decreases in fiber density, however, were not distributed proportionally across the brain. The frontal cortex had a disproportionate number of decreases in fiber density while the temporal cortex had a disproportionate number of increases in fiber density. This large-scale analysis of the developing structural connectome offers a foundation to develop statistical criteria for aberrant brain connectivity as the human brain matures.