Placenta praevia: Preach and perception

Placenta praevia is a known obstetric condition that causes complications to mother and fetus. This study was done to evaluate the knowledge of placenta praevia amongst the obstetric patients. A cross sectional study was carried out in Hospital Ipoh, Perak among 323 antenatal and postnatal patients. Socio-demographic parameters (ie age, race, parity, occupation, educational level) and history of placenta praevia were studied in relation to level of knowledge and attitude towards placenta praevia. Twenty (6.2%) from 323 women had current or past history of placenta praevia. Three had history of placenta praevia while 17 had current placenta praevia with prevalence of 5.3%. The mean score of knowledge achieved by patients was 11.8 which indicated overall poor knowledge. Occupation, level of education and history of placenta praevia were found to have a relationship with level of knowledge regarding placenta praevia in all obstetric patients. There was a significant relationship between attitude of patients with current and history of placenta praevia to level of knowledge regarding placenta praevia. (p=0.037, <0.05). In conclusion, the knowledge and attitude towards placenta praevia among obstetric patients in Hospital Ipoh was better in those who had higher education status, white-collar occupation and currently pregnant with placenta praevi

Pan-cancer analysis of whole genomes

Cancer is driven by genetic change, and the advent of massively parallel sequencing has enabled systematic documentation of this variation at the whole-genome scale(1-3). Here we report the integrative analysis of 2,658 whole-cancer genomes and their matching normal tissues across 38 tumour types from the Pan-Cancer Analysis of Whole Genomes (PCAWG) Consortium of the International Cancer Genome Consortium (ICGC) and The Cancer Genome Atlas (TCGA). We describe the generation of the PCAWG resource, facilitated by international data sharing using compute clouds. On average, cancer genomes contained 4-5 driver mutations when combining coding and non-coding genomic elements; however, in around 5% of cases no drivers were identified, suggesting that cancer driver discovery is not yet complete. Chromothripsis, in which many clustered structural variants arise in a single catastrophic event, is frequently an early event in tumour evolution; in acral melanoma, for example, these events precede most somatic point mutations and affect several cancer-associated genes simultaneously. Cancers with abnormal telomere maintenance often originate from tissues with low replicative activity and show several mechanisms of preventing telomere attrition to critical levels. Common and rare germline variants affect patterns of somatic mutation, including point mutations, structural variants and somatic retrotransposition. A collection of papers from the PCAWG Consortium describes non-coding mutations that drive cancer beyond those in the TERT promoter(4); identifies new signatures of mutational processes that cause base substitutions, small insertions and deletions and structural variation(5,6); analyses timings and patterns of tumour evolution(7); describes the diverse transcriptional consequences of somatic mutation on splicing, expression levels, fusion genes and promoter activity(8,9); and evaluates a range of more-specialized features of cancer genomes(8,10-18).Peer reviewe

Blotto game-based low-complexity fair multiuser subcarrier allocation for uplink OFDMA networks

This article presents a subcarrier allocation scheme based on a Blotto game (SABG) for orthogonal frequency-division multiple access (OFDMA) networks where correlation between adjacent subcarriers is considered. In the proposed game, users simultaneously compete for subcarriers using a limited budget. In order to win as many good subcarriers as possible in this game, users are required to wisely allocate their budget. Efficient power and budget allocation strategies are derived for users for obtaining optimal throughput. By manipulating the total budget available for each user, competitive fairness can be enforced for the SABG. In addition, the conditions to ensure the existence and uniqueness of Nash equilibrium (NE) for the SABG are also established. An low-complexity algorithm that ensures convergence to NE is proposed. Simulation results show that the proposed low-complexity SABG can allocate resources fairly and efficiently for both uncorrelated and correlated fading channels