ID

45673

Beschrijving

Principal Investigator: Kwok-wai Lo, Chinese University of Hong Kong, Hong Kong, China MeSH: Nasopharyngeal Neoplasms https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs001244 Nasopharyngeal carcinoma (NPC) is an aggressive head and neck cancer characterized by Epstein-Barr virus (EBV) infection and dense lymphocyte infiltration. The scarcity of NPC genomic data hinders the understanding of NPC biology, disease progression, and rational therapy design. Here, we performed whole-exome sequencing (WES) on 111 micro-dissected EBV-positive NPCs, with 15 cases subjected to further whole-genome sequencing (WGS), to determine its mutational landscape. We identified enrichment for genomic aberrations of multiple negative regulators of the NF-kB pathway in a total of 41% of cases including CYLD, TRAF3, NFKBIA and NLRC5. Functional analysis confirmed novel inactivating CYLD mutations as drivers for NPC cell growth. The EBV oncoprotein latent member protein 1 (LMP1) functions to constitutively activate NF-kB signaling, and we observed mutual exclusivity among somatic NF-kB pathway aberrations and LMP1-overexpression, suggesting that NF-kB activation is selected for by both somatic and viral events during NPC pathogenesis.

Link

dbGaP study = phs001244

Trefwoorden

  1. 06-04-23 06-04-23 - Simon Heim
Houder van rechten

Kwok-wai Lo, Chinese University of Hong Kong, Hong Kong, China

Geüploaded op

6 april 2023

DOI

Voor een aanvraag inloggen.

Licentie

Creative Commons BY 4.0

Model Commentaren :

Hier kunt u commentaar leveren op het model. U kunt de tekstballonnen bij de itemgroepen en items gebruiken om er specifiek commentaar op te geven.

Itemgroep Commentaren voor :

Item Commentaren voor :

U moet ingelogd zijn om formulieren te downloaden. AUB inloggen of schrijf u gratis in.

dbGaP phs001244 Nasopharynx Cancer Whole Exome Sequencing

Similar models

Gebruik dit formulier voor feedback, vragen en verbeteringsvoorstellen.

Velden gemarkeerd met een * zijn verplicht.

Do you need help on how to use the search function? Please watch the corresponding tutorial video for more details and learn how to use the search function most efficiently.

Watch Tutorial