Crates.io | rust-gc-count |
lib.rs | rust-gc-count |
version | 0.1.0 |
source | src |
created_at | 2023-08-02 08:55:51.098461 |
updated_at | 2023-08-02 08:55:51.098461 |
description | GC and sequence utilities |
homepage | https://github.com/andrewyatz/rust-gc-count |
repository | https://github.com/andrewyatz/rust-gc-count |
max_upload_size | |
id | 932528 |
size | 41,141 |
cargo build --release
target/release/gccount --input in.fa --output out.wig
A tool for generating wiggle files of GC from DNA written in Rust.
Calculate GC and write into a wiggle file
Usage: gccount [OPTIONS] --input <INPUT> --output <OUTPUT>
Options:
--input <INPUT> FASTA formatted file (can be gziped) to calculate GC from
--output <OUTPUT> Output wiggle file. One file will be produced
--window <WINDOW> Window size to calculate GC over [default: 5]
--omit-tail Remove any trailing sequence and do not calcualte GC. Default behaviour is to retain the leftover sequence. GC is calculated over the remaining sequence length
--write-chrom-sizes Write a chrom.sizes file into the current directory. Use --chrom-sizes-path to configure location
--chrom-sizes-path <CHROM.SIZES> Path of the chrom.sizes file. Defaults to chrom.sizes [default: chrom.sizes]
--verbose Be verbose
-h, --help Print help
-V, --version Print version
target/release/checksumseq --input in.fa --output chrom.file
Another binary for calculating sequence lengths and checksums from a file. The resulting file is formted as tab separated with the following columns:
The resulting file can be used as a chrom.sizes
file too.
Iterates through a FASTA file calclating checksums and sequence length
Usage: checksumseq [OPTIONS]
Options:
--input <INPUT> FASTA formatted file to calculate checksums from (- mean STDIN). Reads gzipped FASTA if the filename ends with .gz (including bgzip files) [default: -]
--output <OUTPUT> Output file (- means STDOUT). Each line is tab separated reporting "ID Length sha512t24u md5" [default: -]
--verbose Be verbose
-h, --help Print help
-V, --version Print version
The code developed here has not been extensively tested but has been verified as producing correct and expected output.