University of British Columbia

About: University of British Columbia is a education organization based out in Vancouver, British Columbia, Canada. It is known for research contribution in the topics: Population & Health care. The organization has 89939 authors who have published 209679 publications receiving 9226862 citations. The organization is also known as: UBC & The University of British Columbia.

Reciprocal Rewards Stabilize Cooperation in the Mycorrhizal Symbiosis

Abstract: Plants and their arbuscular mycorrhizal fungal symbionts interact in complex underground networks involving multiple partners. This increases the potential for exploitation and defection by individuals, raising the question of how partners maintain a fair, two-way transfer of resources. We manipulated cooperation in plants and fungal partners to show that plants can detect, discriminate, and reward the best fungal partners with more carbohydrates. In turn, their fungal partners enforce cooperation by increasing nutrient transfer only to those roots providing more carbohydrates. On the basis of these observations we conclude that, unlike many other mutualisms, the symbiont cannot be "enslaved." Rather, the mutualism is evolutionarily stable because control is bidirectional, and partners offering the best rate of exchange are rewarded.

Oncogenically active MYD88 mutations in human lymphoma

Abstract: The activated B-cell-like (ABC) subtype of diffuse large B-cell lymphoma (DLBCL) remains the least curable form of this malignancy despite recent advances in therapy. Constitutive nuclear factor (NF)-κB and JAK kinase signalling promotes malignant cell survival in these lymphomas, but the genetic basis for this signalling is incompletely understood. Here we describe the dependence of ABC DLBCLs on MYD88, an adaptor protein that mediates toll and interleukin (IL)-1 receptor signalling, and the discovery of highly recurrent oncogenic mutations affecting MYD88 in ABC DLBCL tumours. RNA interference screening revealed that MYD88 and the associated kinases IRAK1 and IRAK4 are essential for ABC DLBCL survival. High-throughput RNA resequencing uncovered MYD88 mutations in ABC DLBCL lines. Notably, 29% of ABC DLBCL tumours harboured the same amino acid substitution, L265P, in the MYD88 Toll/IL-1 receptor (TIR) domain at an evolutionarily invariant residue in its hydrophobic core. This mutation was rare or absent in other DLBCL subtypes and Burkitt's lymphoma, but was observed in 9% of mucosa-associated lymphoid tissue lymphomas. At a lower frequency, additional mutations were observed in the MYD88 TIR domain, occurring in both the ABC and germinal centre B-cell-like (GCB) DLBCL subtypes. Survival of ABC DLBCL cells bearing the L265P mutation was sustained by the mutant but not the wild-type MYD88 isoform, demonstrating that L265P is a gain-of-function driver mutation. The L265P mutant promoted cell survival by spontaneously assembling a protein complex containing IRAK1 and IRAK4, leading to IRAK4 kinase activity, IRAK1 phosphorylation, NF-κB signalling, JAK kinase activation of STAT3, and secretion of IL-6, IL-10 and interferon-β. Hence, the MYD88 signalling pathway is integral to the pathogenesis of ABC DLBCL, supporting the development of inhibitors of IRAK4 kinase and other components of this pathway for the treatment of tumours bearing oncogenic MYD88 mutations.

The development of psychological contract breach and violation: a longitudinal study

Abstract: This study examines factors affecting employees' perceptions that their psychological contract has been breached by their organization, and factors affecting whether this perception will cause employees to experience feelings of contract violation. Data were obtained from 147 managers just prior to their beginning of new job (time 1) and 18 months later (time 2). It was found that perceived contract breach at time 2 was more likely when organizational performance and self-reported employee performance were low, the employee had not experienced a formal socialization process, the employee had little interaction with organizational agents prior to hire, the employee had a history of psychological contract breach with former employers, and the employee had many employment alternatives at the time of hire. Furthermore, perceived breach was associated with more intense feelings of violation when employees both attributed the breach to purposeful reneging by the employer and felt unfairly treated in the process. Theoretical and practical implications of these results are discussed. Copyright © 2000 John Wiley & Sons, Ltd.

The IntAct molecular interaction database in 2012

Abstract: IntAct is an open-source, open data molecular interaction database populated by data either curated from the literature or from direct data depositions. Two levels of curation are now available within the database, with both IMEx-level annotation and less detailed MIMIx-compatible entries currently supported. As from September 2011, IntAct contains approximately 275,000 curated binary interaction evidences from over 5000 publications. The IntAct website has been improved to enhance the search process and in particular the graphical display of the results. New data download formats are also available, which will facilitate the inclusion of IntAct's data in the Semantic Web. IntAct is an active contributor to the IMEx consortium (http://www.imexconsortium.org). IntAct source code and data are freely available at http://www.ebi.ac.uk/intact.

Scalable Nearest Neighbor Algorithms for High Dimensional Data

Abstract: For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbor matches to high dimensional vectors that represent the training data. We propose new algorithms for approximate nearest neighbor matching and evaluate and compare them with previous algorithms. For matching high dimensional features, we find two algorithms to be the most efficient: the randomized k-d forest and a new algorithm proposed in this paper, the priority search k-means tree. We also propose a new algorithm for matching binary features by searching multiple hierarchical clustering trees and show it outperforms methods typically used in the literature. We show that the optimal nearest neighbor algorithm and its parameters depend on the data set characteristics and describe an automated configuration procedure for finding the best algorithm to search a particular data set. In order to scale to very large data sets that would otherwise not fit in the memory of a single machine, we propose a distributed nearest neighbor matching framework that can be used with any of the algorithms described in the paper. All this research has been released as an open source library called fast library for approximate nearest neighbors (FLANN), which has been incorporated into OpenCV and is now one of the most popular libraries for nearest neighbor matching.