CATCH is a Python package for designing probe sets to use for nucleic acid capture of diverse sequence.
- Comprehensive coverage: CATCH accepts any collection of unaligned sequences — typically whole genomes of all known genetic diversity of one or more microbial species. It designs oligo sequences that guarantee coverage of this diversity, enabling rapid design of exhaustive probe sets for customizable targets.
- Compact designs: CATCH can design with a specified constraint on the number of oligos (e.g., array size). It searches a space of probe sets, which may pool many species, to find an optimal design. This allows its designs to scale well with known genetic diversity, and also supports cost-effective applications.
- Flexibility: CATCH supports applications beyond whole genome enrichment, such as differential identification of species. It allows blacklisting sequence from the design (e.g., background in microbial enrichment), supports customized models of hybridization, enables weighting the sensitivity for different species, and more.
CATCH requires:
Installing CATCH with pip (or conda), as described below, will install NumPy and SciPy if they are not already installed.
An easy way to setup CATCH is to clone the repository and install with pip:
git clone https://github.com/broadinstitute/catch.git
cd catch
pip install --user -e .We distribute viral sequence data with CATCH, which can be used as input to probe design. We use Git LFS to version and store this data. If you wish to use this data, you'll need to install Git LFS. After installing it, you can download the viral sequence data by running:
git lfs install
git lfs pullfrom inside the catch project directory.
Note that having this data might be helpful, but is not necessary for using CATCH.
CATCH uses Python's unittest framework.
Some of these tests require you to have downloaded viral sequence data.
To execute all tests, run:
python -m unittest discoverCATCH is also available through the conda package manager as part of the bioconda channel. If you use conda, the easiest way to install CATCH is by running:
conda install -c bioconda catchNote that this installation method does not distribute viral sequence data with the package, but CATCH can still be run with your own input data.
Designing with one choice of parameters (design.py)
The main program to design probes is design.py.
To see details on all the arguments that the program accepts, run:
design.py --helpdesign.py requires one or more datasets that specify input sequence data to target, as well as a path to which the probe sequences are written:
design.py [dataset] [dataset ...] -o OUTPUTEach dataset can be one of several input formats:
- A path to a FASTA file.
- An NCBI taxonomy ID, for which sequences will be automatically downloaded.
This is specified as
download:TAXIDwhere TAXID is the taxonomy ID. CATCH will fetch all accessions (representing whole genomes) for this taxonomy and download the sequences. For viruses, NCBI taxonomy IDs can be found via the Taxonomy Browser. - If you downloaded viral sequence data, a label for one of 550+ viral datasets (e.g.,
human_immunodeficiency_virus_1orzika) distributed as part of this package. Each of these datasets includes all available whole genomes (genome neighbors) in NCBI's viral genome data for a species that has human as a host, as of Oct. 2018.
The probe sequences are written to OUTPUT in FASTA format.
Below is a summary of some useful arguments to design.py:
-pl PROBE_LENGTH/-ps PROBE_STRIDE: Design probes to be PROBE_LENGTH nt long, and generate candidate probes using a stride of PROBE_STRIDE nt. (Default: 100 and 50.)-m MISMATCHES: Tolerate up to MISMATCHES mismatches when determining whether a probe covers a target sequence. (Also, see-l/--lcf-thresand--island-of-exact-matchfor adjusting hybridization criteria.) Higher values lead to fewer probes. (Default: 0.)-c COVERAGE: Guarantee that at least COVERAGE of each target genome is captured by probes, where COVERAGE is either a fraction of a genome or a number of nucleotides. Higher values lead to more probes. (Default: 1.0 — i.e., whole genome.)-e COVER_EXTENSION: Assume that a probe will capture both the region of the sequence to which it hybridizes, as well as COVER_EXTENSION nt on each side of that. Higher values lead to fewer probes. (Default: 0.)--identify: Design probes to perform differential identification. This is typically used with small values of COVERAGE and >1 specifieddatasets. Probes are designed such that eachdatasetshould be captured by probes that are unlikely to hybridize to otherdatasets.--blacklist-genomes dataset [dataset ...]: Design probes to be unlikely to hybridize to any of these datasets. (Also, see-mt/--mismatches-tolerant,-lt/--lcf-thres-tolerant, and--island-of-exact-match-tolerantfor this and for--identify.)--add-adapters: Add PCR adapters to the ends of each probe sequence. This selects adapters to add to probe sequences so as to minimize overlap among probes that share an adapter, allowing probes with the same adapter to be amplified together. (See--adapter-aand--adapter-btoo.)--custom-hybridization-fn PATH FN: Specify a function, for CATCH to dynamically load, that implements a custom model of hybridization between a probe and target sequence. Seedesign.py --helpfor details on the expected input and output of this function. If not set, CATCH uses its default model of hybridization based on-m/--mismatches,-l/--lcf-thres, and--island-of-exact-match. (Relatedly, see--custom-hybridization-fn-tolerant.)--filter-with-lsh-hamming FILTER_WITH_LSH_HAMMING/--filter-with-lsh-minhash FILTER_WITH_LSH_MINHASH: Use locality-sensitive hashing to reduce the space of candidate probes. This can significantly improve runtime and memory requirements when the input is especially large and diverse. Seedesign.py --helpfor details on using these options and downsides.--cluster-and-design-separately CLUSTER_AND_DESIGN_SEPARATELY: Cluster input sequences prior to design by computing their MinHash signatures and comparing them. Then, design probes separately on each cluster and merge the resulting probes. Like the--filter-with-{hamming,minhash}arguments, this is another option to improve runtime and memory requirements on large and diverse input. CLUSTER_AND_DESIGN_SEPARATELY gives the inter-cluster distance threshold for merging clusters, expressed as average nucleotide dissimilarity (1-ANI). Seedesign.py --helpfor details and, relatedly, see the--cluster-from-fragmentsargument.
Pooling across many runs (pool.py)
While design.py requires particular choices of parameter values, pool.py is a program to find optimal hybridization parameters that can vary across many input, under a specified limit on the total number of probes (e.g., synthesis array size).
It does this by searching over a space of probe sets to solve a constrained optimization problem.
To see details on all the arguments that the program accepts, run:
pool.py --helpYou need to run design.py on each dataset over a grid of parameters values that spans a reasonable domain.
Then, create a table that provides a probe count for each dataset and choice of parameters (TSV, in a format like this).
Now, you can use this table as input:
pool.py INPUT_TSV TARGET_PROBE_COUNT OUTPUT_TSVwhere INPUT_TSV is a path to the table described above, TARGET_PROBE_COUNT is a constraint on the number of probes to allow in the pool, and OUTPUT_TSV is a path to a file to which the program will write the optimal parameter values.
Below are two arguments that generalize the search:
--loss-coeffs COEFF [COEFF ...]: Specify coefficients on parameters in the objective function. This allows you to adjust how conservative each parameter is treated relative to others. (Default: 1 for mismatches and 1/100 for cover extension.)--dataset-weights WEIGHTS_TSV: Assign a weight for each dataset to use in the objective function, where WEIGHTS_TSV is a path to a table that provides a weight for each dataset. This allows you to seek that probes in the pooled design be more sensitive for some taxa than others. (Default: 1 for all datasets.)
Each run of pool.py may yield a different output based on the (random) initial guess.
We recommend running this multiple times and selecting the output that has the smallest loss, which is written to standard output at the end of the program.
Example of running design.py
Below is an example of designing probes to target a single taxon.
design.py download:64320 -pl 75 -m 2 -l 60 -e 50 -o zika-probes.fasta --verboseThis will download whole genomes of Zika virus (NCBI taxonomy ID 64320) and design probes that:
- are 75 nt long (
-pl 75) - capture the entirety of each genome under a model that a probe hybridizes to a region if the longest common substring, up to 2 mismatches (
-m 2), between a probe and target is at least 60 nt (-l 60) - assume 50 nt on each side of the hybridization is captured as well (
-e 50)
and will save them to zika-probes.fasta.
It will provide detailed output during runtime (--verbose) and yield about 600 probes.
Note that using -l 75 here will run significantly faster, but results in more probes.
Also, note that the input can be zika to use the zika dataset distributed with CATCH, or a path to any custom FASTA file.
Example of running pool.py
Here is a table listing probe counts used in the design of the V-WAfr probe set. It provides counts for each dataset and combination of two parameters (mismatches and cover extension) that were varied in the design. Below is an example of designing that probe set using this table as input.
pool.py num-probes.V-WAfr.201506.tsv 90000 params.V-Wafr.201506.tsv --round-params 1 10This will search for parameters that yield at most 90,000 probes across the datasets, and will output those to params.V-Wafr.201506.tsv.
Because the search is over a continuous space, here we use --round-params 1 10 to set each value of the mismatches parameter to an integer and each value of the cover extension parameter to a multiple of 10 while still meeting the constraint on probe count.
The pooled design yields about 89,950 probes, depending on the initial guess.
We welcome contributions to CATCH. This can be in the form of an issue or pull request. If you have questions, please create an issue or email Hayden Metsky <hayden@mit.edu>.
For details on how CATCH works, please refer to our publication in Nature Biotechnology. If you find CATCH useful to your work, please cite our paper as:
- Metsky HC and Siddle KJ et al. Capturing sequence diversity in metagenomes with comprehensive and scalable probe design. Nature Biotechnology, 37(2), 160–168 (2019). doi: 10.1038/s41587-018-0006-x
CATCH is licensed under the terms of the MIT license.