ID

45088

Beskrivning

Principal Investigator: Mark Purdue, Division of Cancer Epidemiology and Genetics, National Cancer Institute, National Institutes of Health, Department Health and Human Services, Bethesda, MD, USA MeSH: Carcinoma, Renal Cell,Kidney Neoplasms https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs000351 The National Cancer Institute (NCI) genome-wide association study (GWAS) of renal cell carcinoma (RCC) was conducted to investigate common genetic variants associated with RCC risk. The GWAS includes 1,453 RCC cases and 3,531 controls of European background from 4 studies (3 cohort, 1 case-control), scanned using the Illumina InfiniumHumanHap 550, 610 and 660W chips. This project was supported by the Intramural Research Program of the National Institutes of Health and NCI. Data from this GWAS were pooled with those from another GWAS of RCC (2,639 cases and 5,392 controls) conducted in Europe by the International Agency for Research on Cancer and the Centre National de Gènotypage. Findings from this collaboration are described in an upcoming report (Purdue et al. Nature Genetics 2011;43(1):60-65; PMID: 21131975). Only data from the NCI scan are included in this dbGaP submission.

Länk

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

Nyckelord

  1. 2022-08-20 2022-08-20 - Simon Heim
  2. 2022-10-12 2022-10-12 - Adrian Schulz
Rättsinnehavare

Mark Purdue, Division of Cancer Epidemiology and Genetics, National Cancer Institute, National Institutes of Health, Department Health and Human Services, Bethesda, MD, USA

Uppladdad den

20 augusti 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 :

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

dbGaP phs000351 NCI Genome-Wide Association Study of Renal Cell Carcinoma

Eligibility Criteria

Inclusion and exclusion criteria
Beskrivning

Inclusion and exclusion criteria

Inclusion criteria:
Beskrivning

Inclusion criteria

Datatyp

boolean

Alias
UMLS CUI [1,1]
C1512693
Non-Hispanic Caucasian race
Beskrivning

Non-Hispanic Caucasian race

Datatyp

boolean

Alias
UMLS CUI [1,1]
C1512693
UMLS CUI [1,2]
C1518424
UMLS CUI [1,3]
C0043157
Adequate consent for GWAS
Beskrivning

Adequate consent for GWAS

Datatyp

boolean

Alias
UMLS CUI [1,1]
C1512693
UMLS CUI [1,2]
C0021430
Cases: diagnosis of pathologically confirmed renal cancer (International Classification of Diseases for Oncology, Second Edition, Topography C64).
Beskrivning

Cases: diagnosis of pathologically confirmed renal cancer (International Classification of Diseases for Oncology, Second Edition, Topography C64).

Datatyp

boolean

Alias
UMLS CUI [1,1]
C1706256
UMLS CUI [1,2]
C1271092
UMLS CUI [1,3]
C0740457

Similar models

Eligibility Criteria

Name
Typ
Description | Question | Decode (Coded Value)
Datatyp
Alias
Item Group
Inclusion and exclusion criteria
Inclusion criteria
Item
Inclusion criteria:
boolean
C1512693 (UMLS CUI [1,1])
Non-Hispanic Caucasian race
Item
Non-Hispanic Caucasian race
boolean
C1512693 (UMLS CUI [1,1])
C1518424 (UMLS CUI [1,2])
C0043157 (UMLS CUI [1,3])
Adequate consent for GWAS
Item
Adequate consent for GWAS
boolean
C1512693 (UMLS CUI [1,1])
C0021430 (UMLS CUI [1,2])
Cases: diagnosis of pathologically confirmed renal cancer (International Classification of Diseases for Oncology, Second Edition, Topography C64).
Item
Cases: diagnosis of pathologically confirmed renal cancer (International Classification of Diseases for Oncology, Second Edition, Topography C64).
boolean
C1706256 (UMLS CUI [1,1])
C1271092 (UMLS CUI [1,2])
C0740457 (UMLS CUI [1,3])

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