scholarly journals SCSsim: an integrated tool for simulating single-cell genome sequencing data

2019 ◽  
Author(s):  
Zhenhua Yu ◽  
Fang Du ◽  
Xuehong Sun ◽  
Ao Li
Keyword(s):  
Single Cell ◽  
High Efficiency ◽  
Detection Efficiency ◽  
Comprehensive Evaluation ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Single Cell Sequencing ◽  
Technical Issues ◽  
Cell Genome ◽  
User Intervention

Abstract Motivation Allele dropout (ADO) and unbalanced amplification of alleles are main technical issues of single-cell sequencing (SCS), and effectively emulating these issues is necessary for reliably benchmarking SCS-based bioinformatics tools. Unfortunately, currently available sequencing simulators are free of whole-genome amplification involved in SCS technique and therefore not suited for generating SCS datasets. We develop a new software package (SCSsim) that can efficiently simulate SCS datasets in a parallel fashion with minimal user intervention. SCSsim first constructs the genome sequence of single cell by mimicking a complement of genomic variations under user-controlled manner, and then amplifies the genome according to MALBAC technique and finally yields sequencing reads from the amplified products based on inferred sequencing profiles. Comprehensive evaluation in simulating different ADO rates, variation detection efficiency and genome coverage demonstrates that SCSsim is a very useful tool in mimicking single-cell sequencing data with high efficiency. Availability and implementation SCSsim is freely available at https://github.com/qasimyu/scssim. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals RobustClone: a robust PCA method for tumor clone and evolution inference from single-cell sequencing data

2020 ◽  
Vol 36 (11) ◽  
pp. 3299-3306
Author(s):  
Ziwei Chen ◽  
Fuzhou Gong ◽  
Lin Wan ◽  
Liang Ma
Keyword(s):  
Single Cell ◽  
Large Scale ◽  
Clonal Evolution ◽  
Low Rank ◽  
Supplementary Information ◽  
Breast Cancer Dataset ◽  
Sequencing Data ◽  
Cancer Dataset ◽  
Single Cell Sequencing ◽  
Model Free

Abstract Motivation Single-cell sequencing (SCS) data provide unprecedented insights into intratumoral heterogeneity. With SCS, we can better characterize clonal genotypes and reconstruct phylogenetic relationships of tumor cells/clones. However, SCS data are often error-prone, making their computational analysis challenging. Results To infer the clonal evolution in tumor from the error-prone SCS data, we developed an efficient computational framework, termed RobustClone. It recovers the true genotypes of subclones based on the extended robust principal component analysis, a low-rank matrix decomposition method, and reconstructs the subclonal evolutionary tree. RobustClone is a model-free method, which can be applied to both single-cell single nucleotide variation (scSNV) and single-cell copy-number variation (scCNV) data. It is efficient and scalable to large-scale datasets. We conducted a set of systematic evaluations on simulated datasets and demonstrated that RobustClone outperforms state-of-the-art methods in large-scale data both in accuracy and efficiency. We further validated RobustClone on two scSNV and two scCNV datasets and demonstrated that RobustClone could recover genotype matrix and infer the subclonal evolution tree accurately under various scenarios. In particular, RobustClone revealed the spatial progression patterns of subclonal evolution on the large-scale 10X Genomics scCNV breast cancer dataset. Availability and implementation RobustClone software is available at https://github.com/ucasdp/RobustClone. Contact [email protected] or [email protected] Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals rCASC: reproducible Classification Analysis of Single Cell sequencing data

2018 ◽  
Author(s):  
Luca Alessandrì ◽  
Marco Beccuti ◽  
Maddalena Arigoni ◽  
Martina Olivero ◽  
Greta Romano ◽  
...  
Keyword(s):  
Single Cell ◽  
Single Cells ◽  
R Package ◽  
Cellular Heterogeneity ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Single Cell Sequencing ◽  
Analysis Workflow ◽  
User Friendly ◽  
Bioinformatics Workflows

AbstractSummarySingle-cell RNA sequencing has emerged as an essential tool to investigate cellular heterogeneity, and highlighting cell sub-population specific signatures. Nowadays, dedicated and user-friendly bioinformatics workflows are required to exploit the deconvolution of single-cells transcriptome. Furthermore, there is a growing need of bioinformatics workflows granting both functional, i.e. saving information about data and analysis parameters, and computation reproducibility, i.e. storing the real image of the computation environment. Here, we present rCASC a modular RNAseq analysis workflow allowing data analysis from counts generation to cell sub-population signatures identification, granting both functional and computation reproducibility.Availability and ImplementationrCASC is part of the reproducible bioinfomatics project. rCASC is a docker based application controlled by a R package available at https://github.com/kendomaniac/rCASC.Supplementary informationSupplementary data are available at rCASC github

scholarly journals Reconstructing and counting genomic fragments through tagmentation-based haploid phasing

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Patrick P. T. Leong ◽  
Aleksandar Mihajlović ◽  
Nadežda Bogdanović ◽  
Luka Breberina ◽  
Larry Xi
Keyword(s):  
Single Cell ◽  
Copy Number ◽  
Sequencing Data ◽  
Single Cell Sequencing ◽  
Copy Numbers ◽  
Heterogeneous Nature ◽  
Discrete Nature ◽  
Cell Genome ◽  
Copy Number Changes ◽  
Single Cell Genome

AbstractSingle-cell sequencing provides a new level of granularity in studying the heterogeneous nature of cancer cells. For some cancers, this heterogeneity is the result of copy number changes of genes within the cellular genomes. The ability to accurately determine such copy number changes is critical in tracing and understanding tumorigenesis. Current single-cell genome sequencing methodologies infer copy numbers based on statistical approaches followed by rounding decimal numbers to integer values. Such methodologies are sample dependent, have varying calling sensitivities which heavily depend on the sample’s ploidy and are sensitive to noise in sequencing data. In this paper we have demonstrated the concept of integer-counting by using a novel bioinformatic algorithm built on our library construction chemistry in order to detect the discrete nature of the genome.

scholarly journals SCSit: A high-efficiency preprocessing tool for single-cell sequencing data from SPLiT-seq

2021 ◽  
Author(s):  
Mei-Wei Luan ◽  
Jia-Lun Lin ◽  
Ye-Fan Wang ◽  
Yu-Xiao Liu ◽  
Chuan-Le Xiao ◽  
...  
Keyword(s):  
Single Cell ◽  
High Efficiency ◽  
Sequencing Data ◽  
Single Cell Sequencing

Using single-cell cytometry to illustrate integrated multi-perspective evaluation of clustering algorithms using Pareto fronts

2021 ◽  
Author(s):  
Givanna H Putri ◽  
Irena Koprinska ◽  
Thomas M Ashhurst ◽  
Nicholas J C King ◽  
Mark N Read
Keyword(s):  
Single Cell ◽  
Performance Metrics ◽  
Clustering Algorithms ◽  
Latin Hypercube Sampling ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Evaluation Protocol ◽  
Benchmark Datasets ◽  
Pareto Fronts ◽  
Parameter Values

Abstract Motivation Many ‘automated gating’ algorithms now exist to cluster cytometry and single-cell sequencing data into discrete populations. Comparative algorithm evaluations on benchmark datasets rely either on a single performance metric, or a few metrics considered independently of one another. However, single metrics emphasize different aspects of clustering performance and do not rank clustering solutions in the same order. This underlies the lack of consensus between comparative studies regarding optimal clustering algorithms and undermines the translatability of results onto other non-benchmark datasets. Results We propose the Pareto fronts framework as an integrative evaluation protocol, wherein individual metrics are instead leveraged as complementary perspectives. Judged superior are algorithms that provide the best trade-off between the multiple metrics considered simultaneously. This yields a more comprehensive and complete view of clustering performance. Moreover, by broadly and systematically sampling algorithm parameter values using the Latin Hypercube sampling method, our evaluation protocol minimizes (un)fortunate parameter value selections as confounding factors. Furthermore, it reveals how meticulously each algorithm must be tuned in order to obtain good results, vital knowledge for users with novel data. We exemplify the protocol by conducting a comparative study between three clustering algorithms (ChronoClust, FlowSOM and Phenograph) using four common performance metrics applied across four cytometry benchmark datasets. To our knowledge, this is the first time Pareto fronts have been used to evaluate the performance of clustering algorithms in any application domain. Availability and implementation Implementation of our Pareto front methodology and all scripts and datasets to reproduce this article are available at https://github.com/ghar1821/ParetoBench. Supplementary information Supplementary data are available at Bioinformatics online.

484 Bioturing browser: interactively explore public single cell sequencing data

2020 ◽  
Vol 8 (Suppl 3) ◽  
pp. A520-A520
Author(s):  
Son Pham ◽  
Tri Le ◽  
Tan Phan ◽  
Minh Pham ◽  
Huy Nguyen ◽  
...  
Keyword(s):  
Single Cell ◽  
Immune Cell ◽  
Expression Profiles ◽  
Meta Analysis ◽  
Cell Types ◽  
Sequencing Data ◽  
Single Cell Sequencing ◽  
Data Formats ◽  
Cancer Types ◽  
Cell Data

BackgroundSingle-cell sequencing technology has opened an unprecedented ability to interrogate cancer. It reveals significant insights into the intratumoral heterogeneity, metastasis, therapeutic resistance, which facilitates target discovery and validation in cancer treatment. With rapid advancements in throughput and strategies, a particular immuno-oncology study can produce multi-omics profiles for several thousands of individual cells. This overflow of single-cell data poses formidable challenges, including standardizing data formats across studies, performing reanalysis for individual datasets and meta-analysis.MethodsN/AResultsWe present BioTuring Browser, an interactive platform for accessing and reanalyzing published single-cell omics data. The platform is currently hosting a curated database of more than 10 million cells from 247 projects, covering more than 120 immune cell types and subtypes, and 15 different cancer types. All data are processed and annotated with standardized labels of cell types, diseases, therapeutic responses, etc. to be instantly accessed and explored in a uniform visualization and analytics interface. Based on this massive curated database, BioTuring Browser supports searching similar expression profiles, querying a target across datasets and automatic cell type annotation. The platform supports single-cell RNA-seq, CITE-seq and TCR-seq data. BioTuring Browser is now available for download at www.bioturing.com.ConclusionsN/A

scholarly journals Effective clustering for single cell sequencing cancer data

2019 ◽  
Author(s):  
Simone Ciccolella ◽  
Murray Patterson ◽  
Paola Bonizzoni ◽  
Gianluca Della Vedova
Keyword(s):  
Single Cell ◽  
Categorical Data ◽  
Euclidean Distance ◽  
Missing Values ◽  
False Negative ◽  
Ground Truth ◽  
Sequencing Data ◽  
Large Space ◽  
Cancer Data ◽  
Single Cell Sequencing

AbstractBackgroundSingle cell sequencing (SCS) technologies provide a level of resolution that makes it indispensable for inferring from a sequenced tumor, evolutionary trees or phylogenies representing an accumulation of cancerous mutations. A drawback of SCS is elevated false negative and missing value rates, resulting in a large space of possible solutions, which in turn makes infeasible using some approaches and tools. While this has not inhibited the development of methods for inferring phylogenies from SCS data, the continuing increase in size and resolution of these data begin to put a strain on such methods.One possible solution is to reduce the size of an SCS instance — usually represented as a matrix of presence, absence and missing values of the mutations found in the different sequenced cells — and infer the tree from this reduced-size instance. Previous approaches have used k-means to this end, clustering groups of mutations and/or cells, and using these means as the reduced instance. Such an approach typically uses the Euclidean distance for computing means. However, since the values in these matrices are of a categorical nature (having the three categories: present, absent and missing), we explore techniques for clustering categorical data — commonly used in data mining and machine learning — to SCS data, with this goal in mind.ResultsIn this work, we present a new clustering procedure aimed at clustering categorical vector, or matrix data — here representing SCS instances, called celluloid. We demonstrate that celluloid clusters mutations with high precision: never pairing too many mutations that are unrelated in the ground truth, but also obtains accurate results in terms of the phylogeny inferred downstream from the reduced instance produced by this method.Finally, we demonstrate the usefulness of a clustering step by applying the entire pipeline (clustering + inference method) to a real dataset, showing a significant reduction in the runtime, raising considerably the upper bound on the size of SCS instances which can be solved in practice.AvailabilityOur approach, celluloid: clustering single cell sequencing data around centroids is available at https://github.com/AlgoLab/celluloid/ under an MIT license.

scholarly journals K-mer counting with low memory consumption enables fast clustering of single-cell sequencing data without read alignment

2019 ◽  
Author(s):  
Christina Huan Shi ◽  
Kevin Y. Yip
Keyword(s):  
Single Cell ◽  
State Of The Art ◽  
Rna Seq ◽  
Sequencing Data ◽  
Memory Consumption ◽  
Analysis Pipeline ◽  
Cell Clusters ◽  
Single Cell Sequencing ◽  
Sequencing Errors ◽  
Full Analysis

AbstractK-mer counting has many applications in sequencing data processing and analysis. However, sequencing errors can produce many false k-mers that substantially increase the memory requirement during counting. We propose a fast k-mer counting method, CQF-deNoise, which has a novel component for dynamically identifying and removing false k-mers while preserving counting accuracy. Compared with four state-of-the-art k-mer counting methods, CQF-deNoise consumed 49-76% less memory than the second best method, but still ran competitively fast. The k-mer counts from CQF-deNoise produced cell clusters from single-cell RNA-seq data highly consistent with CellRanger but required only 5% of the running time at the same memory consumption, suggesting that CQF-deNoise can be used for a preview of cell clusters for an early detection of potential data problems, before running a much more time-consuming full analysis pipeline.

Sign in / Sign up

Export Citation Format

Share Document