Browse
Submit Data
Databases
API
Help

Dataset Information

9 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Ideafix: a decision tree-based method for the refinement of variants in FFPE DNA sequencing data

ABSTRACT: Abstract Increasingly, treatment decisions for cancer patients are being made from next-generation sequencing results generated from formalin-fixed and paraffin-embedded (FFPE) biopsies. However, this material is prone to sequence artefacts that cannot be easily identified. In order to address this issue, we designed a machine learning-based algorithm to identify these artefacts using data from >1 600 000 variants from 27 paired FFPE and fresh-frozen breast cancer samples. Using these data, we assembled a series of variant features and evaluated the classification performance of five machine learning algorithms. Using leave-one-sample-out cross-validation, we found that XGBoost (extreme gradient boosting) and random forest obtained AUC (area under the receiver operating characteristic curve) values >0.86. Performance was further tested using two independent datasets that resulted in AUC values of 0.96, whereas a comparison with previously published tools resulted in a maximum AUC value of 0.92. The most discriminating features were read pair orientation bias, genomic context and variant allele frequency. In summary, our results show a promising future for the use of these samples in molecular testing. We built the algorithm into an R package called Ideafix (DEAmination FIXing) that is freely available at https://github.com/mmaitenat/ideafix.

SUBMITTER: Tellaetxe-Abete M

PROVIDER: S-EPMC8557387 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

A study on fast calling variants from next-generation sequencing data using decision tree.

Project description:BACKGROUND:The rapid development of next-generation sequencing (NGS) technology has continuously been refreshing the throughput of sequencing data. However, due to the lack of a smart tool that is both fast and accurate, the analysis task for NGS data, especially those with low-coverage, remains challenging. RESULTS:We proposed a decision-tree based variant calling algorithm. Experiments on a set of real data indicate that our algorithm achieves high accuracy and sensitivity for SNVs and indels and shows good adaptability on low-coverage data. In particular, our algorithm is obviously faster than 3 widely used tools in our experiments. CONCLUSIONS:We implemented our algorithm in a software named Fuwa and applied it together with 4 well-known variant callers, i.e., Platypus, GATK-UnifiedGenotyper, GATK-HaplotypeCaller and SAMtools, to three sequencing data sets of a well-studied sample NA12878, which were produced by whole-genome, whole-exome and low-coverage whole-genome sequencing technology respectively. We also conducted additional experiments on the WGS data of 4 newly released samples that have not been used to populate dbSNP.

| S-EPMC5907718 | biostudies-literature

Validation and refinement of cropland data layer using a spatial-temporal decision tree algorithm.

Project description:Space-based crop identification and acreage estimation have played a significant role in agricultural studies in recent years, due to the development of Remote Sensing technology. The Cropland Data Layer (CDL), which was developed by the U.S. Department of Agriculture (USDA), has been widely used in agricultural studies and achieved massive success in recent years. Although the CDL's accuracy assessments report high overall accuracy on various crops classifications, misclassification is still common and easy to discern from visual inspection. This study is aimed to identify and resolve inaccurate crop classification in CDL. A decision tree method was employed to find questionable pixels and refine them with spatial and temporal crop information. The refined data was then evaluated with high-resolution satellite images and official acreage estimates from USDA. Two validation experiments were also developed to examine the data at both the pixel and county level. Data generated from this research was published online in two repositories, while both applications allow users to download the entire dataset at no cost.

| S-EPMC8891360 | biostudies-literature

Decision tree-based method for integrating gene expression, demographic, and clinical data to determine disease endotypes.

Project description:BackgroundComplex diseases are often difficult to diagnose, treat and study due to the multi-factorial nature of the underlying etiology. Large data sets are now widely available that can be used to define novel, mechanistically distinct disease subtypes (endotypes) in a completely data-driven manner. However, significant challenges exist with regard to how to segregate individuals into suitable subtypes of the disease and understand the distinct biological mechanisms of each when the goal is to maximize the discovery potential of these data sets.ResultsA multi-step decision tree-based method is described for defining endotypes based on gene expression, clinical covariates, and disease indicators using childhood asthma as a case study. We attempted to use alternative approaches such as the Student's t-test, single data domain clustering and the Modk-prototypes algorithm, which incorporates multiple data domains into a single analysis and none performed as well as the novel multi-step decision tree method. This new method gave the best segregation of asthmatics and non-asthmatics, and it provides easy access to all genes and clinical covariates that distinguish the groups.ConclusionsThe multi-step decision tree method described here will lead to better understanding of complex disease in general by allowing purely data-driven disease endotypes to facilitate the discovery of new mechanisms underlying these diseases. This application should be considered a complement to ongoing efforts to better define and diagnose known endotypes. When coupled with existing methods developed to determine the genetics of gene expression, these methods provide a mechanism for linking genetics and exposomics data and thereby accounting for both major determinants of disease.

| S-EPMC4228284 | biostudies-literature

Gradient Boosting Decision Tree-Based Method for Predicting Interactions Between Target Genes and Drugs.

Project description:Determining the target genes that interact with drugs-drug-target interactions-plays an important role in drug discovery. Identification of drug-target interactions through biological experiments is time consuming, laborious, and costly. Therefore, using computational approaches to predict candidate targets is a good way to reduce the cost of wet-lab experiments. However, the known interactions (positive samples) and the unknown interactions (negative samples) display a serious class imbalance, which has an adverse effect on the accuracy of the prediction results. To mitigate the impact of class imbalance and completely exploit the negative samples, we proposed a new method, named DTIGBDT, based on gradient boosting decision trees, for predicting candidate drug-target interactions. We constructed a drug-target heterogeneous network that contains the drug similarities based on the chemical structures of drugs, the target similarities based on target sequences, and the known drug-target interactions. The topological information of the network was captured by random walks to update the similarities between drugs or targets. The paths between drugs and targets could be divided into multiple categories, and the features of each category of paths were extracted. We constructed a prediction model based on gradient boosting decision trees. The model establishes multiple decision trees with the extracted features and obtains the interaction scores between drugs and targets. DTIGBDT is a method of ensemble learning, and it effectively reduces the impact of class imbalance. The experimental results indicate that DTIGBDT outperforms several state-of-the-art methods for drug-target interaction prediction. In addition, case studies on Quetiapine, Clozapine, Olanzapine, Aripiprazole, and Ziprasidone demonstrate the ability of DTIGBDT to discover potential drug-target interactions.

| S-EPMC6555260 | biostudies-literature

Use of FFPE-derived DNA in next generation sequencing: DNA extraction methods.

Project description:Archival tissues represent a rich resource for clinical genomic studies, particularly when coupled with comprehensive medical records. Use of these in next generation sequencing (NGS) is a priority. Nine formalin-fixed paraffin-embedded (FFPE) DNA extraction methods were evaluated using twelve FFPE samples of varying tissue types. Quality assessment included total yield, percent dsDNA, fragment analysis and multiplex PCR. After assessment, three tissue types from four FFPE DNA methods were selected for NGS downstream evaluation, targeted and whole exome sequencing. In addition, two low input library protocols were evaluated for WES. Analysis revealed average coverage across the target regions for WES was ~20-30X for all four FFPE DNA extraction methods. For the targeted panels, the highest molecular tag coverage was obtained with the Kingfisher FFPE extraction method. The genotype concordance was 99% for the commonly called variant positions between all four extraction methods with the targeted PCR NGS panel and 96% with WES. Assessing quality of extracted DNA aids in selecting the optimal NGS approach, and the choice of both DNA extraction and library preparation approaches can impact the performance of archival tissue in NGS.

| S-EPMC6459541 | biostudies-literature

A critical spotlight on the paradigms of FFPE-DNA sequencing.

Project description:In the late 19th century, formalin fixation with paraffin-embedding (FFPE) of tissues was developed as a fixation and conservation method and is still used to this day in routine clinical and pathological practice. The implementation of state-of-the-art nucleic acid sequencing technologies has sparked much interest for using historical FFPE samples stored in biobanks as they hold promise in extracting new information from these valuable samples. However, formalin fixation chemically modifies DNA, which potentially leads to incorrect sequences or misinterpretations in downstream processing and data analysis. Many publications have concentrated on one type of DNA damage, but few have addressed the complete spectrum of FFPE-DNA damage. Here, we review mitigation strategies in (I) pre-analytical sample quality control, (II) DNA repair treatments, (III) analytical sample preparation and (IV) bioinformatic analysis of FFPE-DNA. We then provide recommendations that are tested and illustrated with DNA from 13-year-old liver specimens, one FFPE preserved and one fresh frozen, applying target-enriched sequencing. Thus, we show how DNA damage can be compensated, even when using low quantities (50 ng) of fragmented FFPE-DNA (DNA integrity number 2.0) that cannot be amplified well (Q129 bp/Q41 bp = 5%). Finally, we provide a checklist called 'ERROR-FFPE-DNA' that summarises recommendations for the minimal information in publications required for assessing fitness-for-purpose and inter-study comparison when using FFPE samples.

| S-EPMC10415133 | biostudies-literature

BiMM tree: A decision tree method for modeling clustered and longitudinal binary outcomes.

Project description:Clustered binary outcomes are frequently encountered in clinical research (e.g. longitudinal studies). Generalized linear mixed models (GLMMs) for clustered endpoints have challenges for some scenarios (e.g. data with multi-way interactions and nonlinear predictors unknown a priori). We develop an alternative, data-driven method called Binary Mixed Model (BiMM) tree, which combines decision tree and GLMM within a unified framework. Simulation studies show that BiMM tree achieves slightly higher or similar accuracy compared to standard methods. The method is applied to a real dataset from the Acute Liver Failure Study Group.

| S-EPMC7202553 | biostudies-literature

CUDT: a CUDA based decision tree algorithm.

Project description:Decision tree is one of the famous classification methods in data mining. Many researches have been proposed, which were focusing on improving the performance of decision tree. However, those algorithms are developed and run on traditional distributed systems. Obviously the latency could not be improved while processing huge data generated by ubiquitous sensing node in the era without new technology help. In order to improve data processing latency in huge data mining, in this paper, we design and implement a new parallelized decision tree algorithm on a CUDA (compute unified device architecture), which is a GPGPU solution provided by NVIDIA. In the proposed system, CPU is responsible for flow control while the GPU is responsible for computation. We have conducted many experiments to evaluate system performance of CUDT and made a comparison with traditional CPU version. The results show that CUDT is 5 ∼ 55 times faster than Weka-j48 and is 18 times speedup than SPRINT for large data set.

| S-EPMC4130321 | biostudies-other

A life-threatening arrhythmia detection method based on pulse rate variability analysis and decision tree.

Project description:Extreme bradycardia (EB), extreme tachycardia (ET), ventricular tachycardia (VT), and ventricular flutter (VF) are the four types of life-threatening arrhythmias, which are symptoms of cardiovascular diseases. Therefore, in this study, a method of life-threatening arrhythmia recognition is proposed based on pulse rate variability (PRV). First, noise and interference are wiped out from the arterial blood pressure (ABP), and the PRV signal is extracted. Then, 19 features are extracted from the PRV signal, and 15 features with highly important and significant variation were selected by random forest (RF). Finally, the back-propagation neural network (BPNN), extreme learning machine (ELM), and decision tree (DT) are used to build, train, and test classifiers to detect life-threatening arrhythmias. The experimental data are obtained from the MIMIC/Fantasia and the 2015 Physiology Net/CinC Challenge databases. The experimental results show that the DT classifier has the best average performance with accuracy and kappa coefficient (kappa) of 98.76 ± 0.08% and 97.59 ± 0.15%, which are higher than those of the BPNN (accuracy = 94.85 ± 1.33% and kappa = 89.95 ± 2.62%) and ELM (accuracy = 95.05 ± 0.14% and kappa = 90.28 ± 0.28%) classifiers. The proposed method shows better performance in identifying four life-threatening arrhythmias compared to existing methods and has potential to be used for home monitoring of patients with life-threatening arrhythmias.

| S-EPMC9614148 | biostudies-literature

New method for global alignment of 2 DNA sequences by the tree data structure.

Project description:We introduce a new approach to investigate problem of DNA sequence alignment. The method consists of three parts: (i) simple alignment algorithm, (ii) extension algorithm for largest common substring, (iii) graphical simple alignment tree (GSA tree). The approach firstly obtains a graphical representation of scores of DNA sequences by the scoring equation R(0)*R-S(0)*S-T(0)*(a+bk). Then a GSA tree is constructed to facilitate solving the problem for global alignment of 2 DNA sequences. Finally we give several practical examples to illustrate the utility and practicality of the approach.

| S-EPMC7094160 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data