ID

45645

Beschrijving

Principal Investigator: Arend Sidow, PhD, Stanford University, Stanford, CA, USA MeSH: Liposarcoma https://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?study_id=phs001255 Recently developed methods that utilize partitioning of long genomic DNA fragments, and barcoding of shorter fragments derived from them, have succeeded in retaining long-range information in short sequencing reads. These so-called read cloud approaches represent a powerful, accurate, and cost-effective alternative to single-molecule long-read sequencing. We developed software, GROC-SVs, that takes advantage of read clouds for structural variant detection and assembly. We apply the method to two 10x Genomics data sets, one chromothriptic sarcoma with several spatially separated samples, and one breast cancer cell line, all Illumina-sequenced to high coverage. Comparison to short-fragment data from the same samples, and validation by mate-pair data from a subset of the sarcoma samples, demonstrate substantial improvement in specificity of breakpoint detection compared to short-fragment sequencing, at comparable sensitivity, and vice versa. The embedded long-range information also facilitates sequence assembly of a large fraction of the breakpoints; importantly, consecutive breakpoints that are closer than the average length of the input DNA molecules can be assembled together and their order and arrangement reconstructed, with some events exhibiting remarkable complexity. These features facilitated an analysis of the structural evolution of the sarcoma. In the chromothripsis, rearrangements occurred before copy number amplifications, and using the phylogenetic tree built from point mutation data, we show that single nucleotide variants and structural variants are not correlated. We predict significant future advances in structural variant science using 10x data analyzed with GROC-SVs and other read cloud-specific methods.

Link

dbGaP study = phs001255

Trefwoorden

  1. 14-03-23 14-03-23 - Simon Heim
Houder van rechten

Arend Sidow, PhD, Stanford University, Stanford, CA, USA

Geüploaded op

14 maart 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 phs001255 Molecular Evolution of Cancer

The subject consent file includes subject IDs, consent information, and case control status of the subject for chromothripsis.

pht005990
Beschrijving

pht005990

Alias
UMLS CUI [1,1]
C3846158
Subject ID
Beschrijving

SUBJECT_ID

Datatype

string

Alias
UMLS CUI [1,1]
C2348585
Consent group as determined by DAC
Beschrijving

CONSENT

Datatype

text

Alias
UMLS CUI [1,1]
C0021430
UMLS CUI [1,2]
C0441833
Case control status of the subject for chromothripsis
Beschrijving

AFFECTION_STATUS

Datatype

text

Alias
UMLS CUI [1,1]
C3274646

Similar models

The subject consent file includes subject IDs, consent information, and case control status of the subject for chromothripsis.

Name
Type
Description | Question | Decode (Coded Value)
Datatype
Alias
Item Group
pht005990
C3846158 (UMLS CUI [1,1])
SUBJECT_ID
Item
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
Disease-Specific (Breast Cancer, MDS) (DS-BRCA-MDS) (1)
Item
Case control status of the subject for chromothripsis
text
C3274646 (UMLS CUI [1,1])
Code List
Case control status of the subject for chromothripsis
CL Item
Case (1)
C3274647 (UMLS CUI [1,1])

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