A5044684807- Single-cell and spatial transcriptomics
- Advanced Graph Theory Research
- Limits and Structures in Graph Theory
- CRISPR and Genetic Engineering
- graph theory and CDMA systems
- Finite Group Theory Research
- Genetic Associations and Epidemiology
- Graph Labeling and Dimension Problems
- Interconnection Networks and Systems
- Coding theory and cryptography
- Advanced biosensing and bioanalysis techniques
- Cell Image Analysis Techniques
- Computational Geometry and Mesh Generation
- Stochastic processes and statistical mechanics
- Genomics and Rare Diseases
Duke University
2024-2025
Applied Genetic Technologies (United States)
2025
Beijing Technology and Business University
2024
Beijing Jiaotong University
2021-2024
Highlights•CRISPR barnyard screens characterize the distribution of ambient gRNAs•CRISPR identify factors influencing abundance gRNAs•CLEANSER is open-source software that assigns gRNAs to cells in perturb-seq screens•CLEANSER demonstrates increased accuracy calling hits published datasetsSummarySingle-cell RNA sequencing CRISPR (perturb-seq) enable high-throughput investigation genome, allowing for characterization thousands genomic perturbations on gene expression. Ambient gRNAs, which are...
Recent technological developments in single-cell RNA-seq CRISPR screens enable high-throughput investigation of the genome. Through transduction a gRNA library to cell population followed by transcriptomic profiling scRNA-seq, it is possible characterize effects thousands genomic perturbations on global gene expression. A major source noise scRNA-seq are ambient gRNAs, which contaminating gRNAs that likely originate from other cells. If not properly filtered, can result an excess false...
Abstract The 5‐even subgraph cycle double cover conjecture (5‐CDC conjecture) asserts that every bridgeless graph has a cover. A shortest even of is family subgraphs which all the edges and sum their lengths minimum. It conjectured an with total length at most . In this paper, we study those two conjectures for weak oddness 2 cubic graphs present sufficient condition such to have 5‐CDC containing member many vertices. As corollary, show satisfying 4‐even ‐cover We also girth least 30 thus it
Abstract It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such each edge contained in exactly two of them . Let be a permutation with 2‐factor A circuit ‐alternating if matching ‐linked it contains an length at most 12. proved this paper ‐ linked Berge–Fulkerson colorable As application, the conjecture verified for some families snarks constructed Abreu et al., Brinkmann Hägglund al.