Genetic analysis of self-associating immunoglobulin G rheumatoid factors from two rheumatoid synovia implicates an antigen-driven response.

Although much has been learned about the molecular basis of immunoglobulin M (IgM) rheumatoid factors (RFs) in healthy individuals and in patients with mixed cryoglobulinemia and rheumatoid arthritis, little is known about the genetic origins of the potentially pathogenic IgG RFs in the inflamed rheumatoid synovia of patients. Recently, we generated from unmanipulated synovium B cells several hybridomas that secreted self-associating IgG RFs. To delineate the genetic origins of such potentially pathogenic RFs, we adapted the anchored polymerase chain reaction to rapidly clone and characterize the expressed Ig V genes for the L1 and the D1 IgG RFs. Then, we identified the germline counterparts of the expressed L1 IgG RF V genes. The results showed that the L1 heavy chain was encoded by a Vh gene that is expressed preferentially during early ontogenic development, and that is probably located within 240 kb upstream of the Jh locus. The overlap between this RF Vh gene and the restricted fetal antibody repertoire is reminiscent of the natural antibody-associated Vh genes, and suggests that at least part of the "potential pathogenic" IgG RFs in rheumatoid synovium may derive from the "physiological" natural antibody repertoire in a normal immune system. Indeed, the corresponding germline Vh gene for L1 encodes the heavy chain of an IgM RF found in a 19-wk-old fetal spleen. Furthermore, the comparisons of the expressed RF V genes and their germline counterparts reveal that the L1 heavy and light chain variable regions had, respectively, 16 and 7 somatic mutations, which resulted in eight and four amino acid changes. Strikingly, all eight mutations in the complementarity determining regions of the V gene-encoded regions were replacement changes, while only 6 of 11 mutations in the framework regions caused amino acid changes. Combined with L1's high binding affinity toward the Fc fragment, these results suggest strongly that the L1 IgG RF must have been driven by the Fc antigen

Virtual Biopsy in Soft Tissue Sarcoma. How Close Are We?

A shift in radiology to a data-driven specialty has been unlocked by synergistic developments in imaging biomarkers (IB) and computational science. This is advancing the capability to deliver "virtual biopsies" within oncology. The ability to non-invasively probe tumour biology both spatially and temporally would fulfil the potential of imaging to inform management of complex tumours; improving diagnostic accuracy, providing new insights into inter- and intra-tumoral heterogeneity and individualised treatment planning and monitoring. Soft tissue sarcomas (STS) are rare tumours of mesenchymal origin with over 150 histological subtypes and notorious heterogeneity. The combination of inter- and intra-tumoural heterogeneity and the rarity of the disease remain major barriers to effective treatments. We provide an overview of the process of successful IB development, the key imaging and computational advancements in STS including quantitative magnetic resonance imaging, radiomics and artificial intelligence, and the studies to date that have explored the potential biological surrogates to imaging metrics. We discuss the promising future directions of IBs in STS and illustrate how the routine clinical implementation of a virtual biopsy has the potential to revolutionise the management of this group of complex cancers and improve clinical outcomes

Improving Phrap-Based Assembly of the Rat Using “Reliable” Overlaps

The assembly methods used for whole-genome shotgun (WGS) data have a major impact on the quality of resulting draft genomes. We present a novel algorithm to generate a set of “reliable” overlaps based on identifying repeat k-mers. To demonstrate the benefits of using reliable overlaps, we have created a version of the Phrap assembly program that uses only overlaps from a specific list. We call this version PhrapUMD. Integrating PhrapUMD and our “reliable-overlap” algorithm with the Baylor College of Medicine assembler, Atlas, we assemble the BACs from the Rattus norvegicus genome project. Starting with the same data as the Nov. 2002 Atlas assembly, we compare our results and the Atlas assembly to the 4.3 Mb of rat sequence in the 21 BACs that have been finished. Our version of the draft assembly of the 21 BACs increases the coverage of finished sequence from 93.4% to 96.3%, while simultaneously reducing the base error rate from 4.5 to 1.1 errors per 10,000 bases. There are a number of ways of assessing the relative merits of assemblies when the finished sequence is available. If one views the overall quality of an assembly as proportional to the inverse of the product of the error rate and sequence missed, then the assembly presented here is seven times better. The UMD Overlapper with options for reliable overlaps is available from the authors at http://www.genome.umd.edu. We also provide the changes to the Phrap source code enabling it to use only the reliable overlaps

Burden of upper gastrointestinal symptoms in patients prescribed dabigatran for stroke prevention

BACKGROUND: Dabigatran, a non-vitamin K antagonist oral anticoagulant, has been shown to prevent stroke in patients with non-valvular atrial fibrillation. Nonetheless, studies show that 10%-30% of those prescribed dabigatran experience dyspepsia that may eventually lead to discontinuation of therapy and loss of clinical benefit. AIM: To evaluate the gastrointestinal tolerability of dabigatran utilizing a validated questionnaire, as well as determining subsequent non-compliance and drug discontinuation. METHOD: This is an observational study. All patients were assessed by a validated questionnaire, Hong Kong dyspepsia index, prior to drug prescription and again 4 weeks later. RESULTS: In this study, 115 patients with non-valvular atrial fibrillation (mean age: 74.6 ± 11.4 years; mean CHA2DS2-VASc score was 3.39 ± 1.59) were prescribed dabigatran. At baseline, the mean Hong Kong dyspepsia index was 12.9 ± 1.6 and nine patients had significant dyspepsia (Hong Kong dyspepsia index ⩾ 16). After 4 weeks, the mean Hong Kong dyspepsia index was similar at 12.6 ± 1.9 (p = 0.23). There was no change in Hong Kong dyspepsia index after initiation of dabigatran in 59 (51.3%) patients, and improvement in 37 (32.2%). Only 19 (16.5%) patients had worsening of Hong Kong dyspepsia index, and among these 19 patients, only 1 patient (0.9%) discontinued dabigatran due to significant dyspepsia. CONCLUSION: Worsening of dyspepsia with dabigatran 110 mg twice daily was uncommon with correct drug administration and clear instructions provided. Systematic assessment of dyspeptic symptoms using a validated questionnaire (i.e. Hong Kong dyspepsia index) before and after treatment initiation allows a more objective comparison of dyspeptic symptoms

A Framework for Certified Self-Stabilization

We propose a general framework to build certified proofs of distributed self-stabilizing algorithms with the proof assistant Coq. We first define in Coq the locally shared memory model with composite atomicity, the most commonly used model in the self-stabilizing area. We then validate our framework by certifying a non trivial part of an existing silent self-stabilizing algorithm which builds a $k$-hop dominating set of the network. We also certified a quantitative property related to the output of this algorithm. Precisely, we show that the computed $k$-hop dominating set contains at most $\lfloor \frac{n-1}{k+1} \rfloor + 1$ nodes, where $n$ is the number of nodes in the network. To obtain these results, we also developed a library which contains general tools related to potential functions and cardinality of sets

Need Polynomial Systems Be Doubly-Exponential?

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of zeros of a zero-dimensional system is singly-exponential in the number of variables. How should this contradiction be reconciled? We first note that [Mayr and Ritscher, 2013] shows that the doubly exponential nature of Gr\"{o}bner bases is with respect to the dimension of the ideal, not the number of variables. This inspires us to consider what can be done for Cylindrical Algebraic Decomposition which produces a doubly-exponential number of polynomials of doubly-exponential degree. We review work from ISSAC 2015 which showed the number of polynomials could be restricted to doubly-exponential in the (complex) dimension using McCallum's theory of reduced projection in the presence of equational constraints. We then discuss preliminary results showing the same for the degree of those polynomials. The results are under primitivity assumptions whose importance we illustrate.Comment: Extended Abstract for ICMS 2016 Presentation. arXiv admin note: text overlap with arXiv:1605.0249

Computational Analysis of HIV-1 Resistance Based on Gene Expression Profiles and the Virus-Host Interaction Network

A very small proportion of people remain negative for HIV infection after repeated HIV-1 viral exposure, which is called HIV-1 resistance. Understanding the mechanism of HIV-1 resistance is important for the development of HIV-1 vaccines and Acquired Immune Deficiency Syndrome (AIDS) therapies. In this study, we analyzed the gene expression profiles of CD4+ T cells from HIV-1-resistant individuals and HIV-susceptible individuals. One hundred eighty-five discriminative HIV-1 resistance genes were identified using the Minimum Redundancy-Maximum Relevance (mRMR) and Incremental Feature Selection (IFS) methods. The virus protein target enrichment analysis of the 185 HIV-1 resistance genes suggested that the HIV-1 protein nef might play an important role in HIV-1 infection. Moreover, we identified 29 infection information exchanger genes from the 185 HIV-1 resistance genes based on a virus-host interaction network analysis. The infection information exchanger genes are located on the shortest paths between virus-targeted proteins and are important for the coordination of virus infection. These proteins may be useful targets for AIDS prevention or therapy, as intervention in these pathways could disrupt communication with virus-targeted proteins and HIV-1 infection

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs

<p>Abstract</p> <p>Background</p> <p>Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly problem fall into two broad categories <b>- </b>based on the data structures which they employ. The first class uses an overlap/string graph and the second type uses a de Bruijn graph. However with the recent advances in short read sequencing technology, de Bruijn graph based algorithms seem to play a vital role in practice. Efficient algorithms for building these massive de Bruijn graphs are very essential in large sequencing projects based on short reads. In an earlier work, an <it>O</it>(<it>n/p</it>) time parallel algorithm has been given for this problem. Here <it>n </it>is the size of the input and <it>p </it>is the number of processors. This algorithm enumerates all possible bi-directed edges which can overlap with a node and ends up generating Θ(<it>n</it>Σ) messages (Σ being the size of the alphabet).</p> <p>Results</p> <p>In this paper we present a Θ(<it>n/p</it>) time parallel algorithm with a communication complexity that is equal to that of parallel sorting and is not sensitive to Σ. The generality of our algorithm makes it very easy to extend it even to the out-of-core model and in this case it has an optimal I/O complexity of <inline-formula><m:math name="1471-2105-11-560-i1" xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mrow><m:mo>Θ</m:mo><m:mo stretchy="false">(</m:mo><m:mfrac><m:mrow><m:mi>n</m:mi><m:mi>log</m:mi><m:mo stretchy="false">(</m:mo><m:mi>n</m:mi><m:mo>/</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow><m:mrow><m:mi>B</m:mi><m:mi>log</m:mi><m:mo stretchy="false">(</m:mo><m:mi>M</m:mi><m:mo>/</m:mo><m:mi>B</m:mi><m:mo stretchy="false">)</m:mo></m:mrow></m:mfrac><m:mo stretchy="false">)</m:mo></m:mrow></m:math></inline-formula> (<it>M </it>being the main memory size and <it>B </it>being the size of the disk block). We demonstrate the scalability of our parallel algorithm on a SGI/Altix computer. A comparison of our algorithm with the previous approaches reveals that our algorithm is faster <b>- </b>both asymptotically and practically. We demonstrate the scalability of our sequential out-of-core algorithm by comparing it with the algorithm used by VELVET to build the bi-directed de Bruijn graph. Our experiments reveal that our algorithm can build the graph with a constant amount of memory, which clearly outperforms VELVET. We also provide efficient algorithms for the bi-directed chain compaction problem.</p> <p>Conclusions</p> <p>The bi-directed de Bruijn graph is a fundamental data structure for any sequence assembly program based on Eulerian approach. Our algorithms for constructing Bi-directed de Bruijn graphs are efficient in parallel and out of core settings. These algorithms can be used in building large scale bi-directed de Bruijn graphs. Furthermore, our algorithms do not employ any all-to-all communications in a parallel setting and perform better than the prior algorithms. Finally our out-of-core algorithm is extremely memory efficient and can replace the existing graph construction algorithm in VELVET.</p

Semiparametric Multivariate Accelerated Failure Time Model with Generalized Estimating Equations

The semiparametric accelerated failure time model is not as widely used as the Cox relative risk model mainly due to computational difficulties. Recent developments in least squares estimation and induced smoothing estimating equations provide promising tools to make the accelerate failure time models more attractive in practice. For semiparametric multivariate accelerated failure time models, we propose a generalized estimating equation approach to account for the multivariate dependence through working correlation structures. The marginal error distributions can be either identical as in sequential event settings or different as in parallel event settings. Some regression coefficients can be shared across margins as needed. The initial estimator is a rank-based estimator with Gehan's weight, but obtained from an induced smoothing approach with computation ease. The resulting estimator is consistent and asymptotically normal, with a variance estimated through a multiplier resampling method. In a simulation study, our estimator was up to three times as efficient as the initial estimator, especially with stronger multivariate dependence and heavier censoring percentage. Two real examples demonstrate the utility of the proposed method

Lower NPAS3 expression during the later stages of abnormal lung development in rat congenital diaphragmatic hernia

Purpose Congenital diaphragmatic hernia (CDH) is characterized by a developmental defect in the diaphragm, pulmonary hypoplasia and pulmonary hypertension. NPAS3 is a PAS domain transcription factor regulating Drosophila tracheogenesis. NPAS3 null mice develop pulmonary hypoplasia in utero and die after birth due to respiratory failure. We aimed to evaluate NPAS3 expres- sion during normal and abnormal lung development due to CDH. Methods CDH was induced by administering 100 mg/ml nitrofen to time-pregnant dams on embryonic day (E) 9 of gestation. Lungs were isolated on E15, E18 and E21 and NPAS3 localization was determined by immunohisto- chemistry and quantified using Western blotting. Results We found that only E21 hypoplastic CDH lungs have reduced expression of NPAS3 in the terminal sac- cules. Western blotting confirmed the down-regulation of NPAS3 protein in the nitrofen-induced hypoplastic lungs. Conclusions We demonstrate for the first time that ni- trofen-induced hypoplastic CDH lungs have reduced NPAS3 expression in the terminal saccules during the later stages of abnormal lung development. Our findings suggest that NPAS3 is associated with pulmonary hypoplasia in CDH.Supported by the Children’s Hospital Research Institute of Manitoba; RK is the recipient of a Career Enhancement Award from the Canadian Child Health Clinician Scientist Program and a New Investigator Salary Award from the Canadian Institutes of Health Research, Manitoba Lung Association and the Children’s Hospital Research Institute