Guide assignment in single-cell CRISPR screens using crispat

crispat is implemented in python, the source code, installation instructions and tutorials can be found at https://github.com/velten-group/crispat and it can be installed from PyPI (https://pypi.org/project/crispat/). Code to reproduce all findings in this paper is available at https://github.com/velten-group/crispat_analysis, as well as at https://zenodo.org/records/13373265.

Authors

Institutions

Publication Details

Journal
Bioinformatics
Published
2024-09-01
DOI
https://doi.org/10.1093/bioinformatics/btae535
Citations
6
Primary Topic
CRISPR and Genetic Engineering
Type
article
Field-Weighted Citation Impact
1.40

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Guide assignment in single-cell CRISPR screens using crispat

Jana M. Braunger, Britta Velten
6 citations
Bioinformatics
CRISPR and Genetic Engineering
1.40
article

Guide assignment in single-cell CRISPR screens using crispat

Jana M. Braunger, Britta Velten
article en
6 citations

Abstract

crispat is implemented in python, the source code, installation instructions and tutorials can be found at https://github.com/velten-group/crispat and it can be installed from PyPI (https://pypi.org/project/crispat/). Code to reproduce all findings in this paper is available at https://github.com/velten-group/crispat_analysis, as well as at https://zenodo.org/records/13373265.

BioinformaticsVol. 40(9)
Heidelberg University (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 19%
CRISPR and Genetic Engineering
1.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.