bioquik package
Submodules
bioquik.cli module
- bioquik.cli.count(patterns: str = <typer.models.OptionInfo object>, seq_dir: Path = <typer.models.OptionInfo object>, workers: int = <typer.models.OptionInfo object>, out_dir: Path = <typer.models.OptionInfo object>, json_out: bool = <typer.models.OptionInfo object>, plot: bool = <typer.models.OptionInfo object>) None[source]
bioquik.fasta_worker module
Per-file FASTA motif counter (intended for parallel use via concurrent.futures).
bioquik.fmindex module
FM-index backed by pydivsufsort and WaveletTree.
bioquik.motifs module
Pattern → motif expansion utilities.
bioquik.plotter module
bioquik.processor module
bioquik.reports module
bioquik.validate module
bioquik.wavelettree module
Succinct binary-recursive wavelet tree with rank-support.
- class bioquik.wavelettree.WaveletTree(data: bytes, alphabet: bytes, *, sample_rate: int = 32)[source]
Bases:
objectWavelet tree over a bytes sequence providing rank1 queries.
The implementation stores a bitvector at each internal node and samples prefix ranks every sample_rate bits (default = 32) for O(1) rank queries. Memory usage ≈ n log σ bits.
- alphabet
- bitvec
- left
- length
- prefix_ranks
- right
- sample_rate
Module contents
Top-level package for bioquik.
- class bioquik.FMIndex(seq: str, *, sa_sample_rate: int = 32)[source]
Bases:
objectSuccinct FM-index supporting count and locate queries.
- C
- alphabet
- bwt
- sa_sample_rate
- sa_samples: Dict[int, int]
- seq
- seq_b
- wt
- class bioquik.WaveletTree(data: bytes, alphabet: bytes, *, sample_rate: int = 32)[source]
Bases:
objectWavelet tree over a bytes sequence providing rank1 queries.
The implementation stores a bitvector at each internal node and samples prefix ranks every sample_rate bits (default = 32) for O(1) rank queries. Memory usage ≈ n log σ bits.
- alphabet
- bitvec
- left
- length
- prefix_ranks
- right
- sample_rate
- bioquik.build_pattern_to_motifs(patterns: list[str]) Dict[str, List[str]][source]
Return mapping pattern→[motifs] using N as wildcard stand-in.