0 Bedömningar

ID

45538

Beskrivning

Principal Investigator: Baylor Hopkins Center for Mendelian Genomics, Baylor College of Medicine, Houston, TX, USA MeSH: Mendelian Conditions,Alstrom Syndrome,Arrhythmogenic Right Ventricular Dysplasia,Syndactyly,Craniofacial Abnormalities,Neurofibromatoses,Ullrich congenital muscular dystrophy,Aortic Aneurysm, Thoracic,Rubinstein-Taybi Syndrome,Acne Inversa,Achondroplasia,Exostoses, Multiple Hereditary,Arthrogryposis, Renal Dysfunction, And Cholestasis,Van Den Ende-Gupta Syndrome,BO Syndrome 3,SMDCRD,Loeys-Dietz Syndrome, Type 1a,Cardiomyopathy, Dilated,OI, Type VI,Sotos Syndrome,Charcot-Marie-Tooth Disease,Microcephaly https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs000711 The Centers for Mendelian Genomics project uses next-generation sequencing and computational approaches to discover the genes and variants that underlie Mendelian conditions. By discovering genes that cause Mendelian conditions, we will expand our understanding of their biology to facilitate diagnosis and new treatments.

Länk

dbGaP study = phs000711

Nyckelord

  1. 2022-12-29 2022-12-29 - Simon Heim
Rättsinnehavare

Baylor Hopkins Center for Mendelian Genomics, Baylor College of Medicine, Houston, TX, USA

Uppladdad den

29 december 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 phs000711 Baylor Hopkins Center for Mendelian Genomics (BH CMG)

    The pedigree data table contains family relationships in the format of family IDs, subject IDs, father IDs, mother IDs, subject's sex, and monozygotic twin IDs.

    pht003721
    Beskrivning

    pht003721

    Alias
    UMLS CUI [1,1]
    C3846158
    Family ID
    Beskrivning

    FAMID

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C3669174
    Unique Subject ID
    Beskrivning

    SUBJID

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C2348585
    Mother's Subject ID
    Beskrivning

    MOTHER

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C3669352
    UMLS CUI [1,2]
    C0030761
    Father's Subject ID
    Beskrivning

    FATHER

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C3669177
    UMLS CUI [1,2]
    C0030761
    Sex
    Beskrivning

    SEX

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C0079399
    Twin ID for monozygotic twins and multiples. An MZ_TWIN_ID is not provided for dizygotic twins or multiples.
    Beskrivning

    MZ_TWIN_ID

    Datatyp

    string

    Alias
    UMLS CUI [1,1]
    C0041427
    UMLS CUI [1,2]
    C2348585
    UMLS CUI [1,3]
    C0030761

    Similar models

    The pedigree data table contains family relationships in the format of family IDs, subject IDs, father IDs, mother IDs, subject's sex, and monozygotic twin IDs.

    Name
    Typ
    Description | Question | Decode (Coded Value)
    Datatyp
    Alias
    Item Group
    pht003721
    C3846158 (UMLS CUI [1,1])
    FAMID
    Item
    Family ID
    string
    C3669174 (UMLS CUI [1,1])
    SUBJID
    Item
    Unique Subject ID
    string
    C2348585 (UMLS CUI [1,1])
    MOTHER
    Item
    Mother's Subject ID
    string
    C3669352 (UMLS CUI [1,1])
    C0030761 (UMLS CUI [1,2])
    FATHER
    Item
    Father's Subject ID
    string
    C3669177 (UMLS CUI [1,1])
    C0030761 (UMLS CUI [1,2])
    SEX
    Item
    Sex
    string
    C0079399 (UMLS CUI [1,1])
    MZ_TWIN_ID
    Item
    Twin ID for monozygotic twins and multiples. An MZ_TWIN_ID is not provided for dizygotic twins or multiples.
    string
    C0041427 (UMLS CUI [1,1])
    C2348585 (UMLS CUI [1,2])
    C0030761 (UMLS CUI [1,3])

    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