ID

45293

Beskrivning

Principal Investigator: Charles Roberts, MD, PhD, Dana Farber Cancer Institute, Boston MA, USA MeSH: Rhabdoid Tumor https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs000508 In this study, we sequenced the exomes of 35 rhabdoid tumors, highly aggressive cancers of early childhood. This study is part of a larger effort to characterize pediatric cancers as part of the Slim Initiative for Genomic Medicine (SIGMA) project.

Länk

https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs000508

Nyckelord

  1. 16.10.22 16.10.22 - Tabea Kampen
  2. 17.10.22 17.10.22 - Dr. Christian Niklas
Rättsinnehavare

Charles Roberts, MD, PhD, Dana Farber Cancer Institute, Boston MA, USA

Uppladdad den

16. Oktober 2022

DOI

För en begäran logga in.

Licens

Creative Commons BY 4.0

Modellkommentarer :

Här kan du kommentera modellen. Med hjälp av pratbubblor i Item-grupperna och Item kan du lägga in specifika kommentarer.

Itemgroup-kommentar för :

Item-kommentar för :


Inga kommentarer

Du måste vara inloggad för att kunna ladda ner formulär. Var vänlig logga in eller registrera dig utan kostnad.

dbGaP phs000508 Genomic Sequencing of Pediatric Rhaboid Cancers

Similar models

Subject ID and consent group of participants with rhabdoid tumors and involved in the "Genomic Sequencing of Pediatric Rhaboid Cancers" project.

Name
Typ
Description | Question | Decode (Coded Value)
Datatyp
Alias
Item Group
pht002809
SUBJID
Item
De-identified subject ID
string
C2348585 (UMLS CUI [1,1])
Item
Consent group as determined by DAC
text
C0021430 (UMLS CUI [1,1])
C0441833 (UMLS CUI [1,2])
Code List
Consent group as determined by DAC
CL Item
Pediatric Cancer Research (PCR) (1)
C1521725 (UMLS CUI [1,1])
C0006826 (UMLS CUI [1,2])
C0008972 (UMLS CUI [1,3])
CL Item
Disease-Specific (Cancer, NPU, MDS) (DS-CA-NPU-MDS) (2)
C0011900 (UMLS CUI [1,1])
C2348235 (UMLS CUI [1,2])

Använd detta formulär för feedback, frågor och förslag på förbättringar.

Fält markerade med * är obligatoriska.

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