Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
Primer3-py is a Python-abstracted API for the popular Primer3 library. The intention is to provide a simple and reliable interface for automated oligo analysis and design.
Primer3-py also includes bindings for the Primer3 primer design engine if you’d prefer to use an established pipeline. The IO parameters mirror those of the original Primer3, but you don’t have to deal with messy and slow file IO for your automated workflows.
Spoa (SIMD POA) is a c++ implementation of the partial order alignment (POA) algorithm, which is used to generate consensus sequences. It supports three alignment modes: local (Smith-Waterman), global (Needleman-Wunsch) and semi-global alignment (overlap), and three gap modes: linear, affine and convex (piecewise affine).
This package provides a tool to extract assembly statistics from FASTA and FASTQ files.
diemPy is a computational tool designed to polarize genomic data for hybrid zone analysis. The package implements an expectation-maximization (EM) algorithm to determine the optimal polarization of genetic markers, enabling researchers to identify and analyze patterns of introgression and hybridization in genomic datasets.
The IQ-TREE software was created as the successor of IQPNNI and TREE-PUZZLE (thus the name IQ-TREE). IQ-TREE was motivated by the rapid accumulation of phylogenomic data, leading to a need for efficient phylogenomic software that can handle a large amount of data and provide more complex models of sequence evolution. To this end, IQ-TREE can utilize multicore computers and distributed parallel computing to speed up the analysis. IQ-TREE automatically performs checkpointing to resume an interrupted analysis.
As input IQ-TREE accepts all common sequence alignment formats including PHYLIP, FASTA, Nexus, Clustal and MSF. As output IQ-TREE will write a self-readable report file (name suffix .iqtree), a NEWICK tree file (.treefile) which can be visualized by tree viewer programs such as FigTree, Dendroscope or iTOL.
Key features of IQ-TREE:
Fast and effective stochastic algorithm to reconstruct phylogenetic trees by maximum likelihood;
An ultrafast bootstrap approximation (UFBoot) to assess branch supports;
An ultrafast and automatic model selection (ModelFinder);
A flexible simulator (AliSim) which can simulate sequence alignments under more realistic models than Seq-Gen and INDELible;
Several fast branch tests like SH-aLRT and aBayes test and tree topology tests like the approximately unbiased (AU) test.
This package provides IQ-TREE version 2.
This package contains a set of common Perl utilities for generating consistent Vcf headers. It primarily exists to prevent code duplication between some other projects.
Anvi’o is a comprehensive platform that brings together many aspects of today’s computational strategies of data-enabled microbiology, including genomics, metagenomics, metatranscriptomics, pangenomics, metapangenomics, phylogenomics, and microbial population genetics in an integrated and easy-to-use fashion through extensive interactive visualization capabilities.
This package primarily exists to prevent code duplication between some other projects, specifically AscatNGS and Battenburg.
Bioparser is a C++ header only parsing library for several bioinformatics formats (FASTA/Q, MHAP/PAF/SAM), with support for zlib compressed files.
This package provides a new way of computing bootstrap supports in large phylogenies.
This packages provides a collection of small and efficient programs for performing some common and uncommon tasks with FASTQ files.
CAT and BAT are pipelines for the taxonomic classification of long DNA sequences and MAGs of both known and (highly) unknown microorganisms, as generated by contemporary metagenomics studies. The core algorithm of both programs involves gene calling, mapping of predicted ORFs against the nr protein database, and voting-based classification of the entire contig / MAG based on classification of the individual ORFs. CAT and BAT can be run from intermediate steps if files are formated appropriately.
hiddenDomains is a suite of programs used to identify significant enrichment of ChIP-seq reads that span large domains, like HK27me3. The input data can be in BAM format, or in a tab-delimited 'reads per bin' format described below. The output is a BED formatted file the lists the enriched domains and their posterior probabilities.
Easel is an ANSI C code library developed by the Eddy/Rivas laboratory at Harvard. Easel supports our work on computational analysis of biological sequences using probabilistic models. Easel is used by HMMER, the profile hidden Markov model software that underlies several protein and DNA sequence family databases such as Pfam, and by Infernal, the profile stochastic context-free grammar software that underlies the Rfam RNA family database. Easel aims to make similar applications more robust and easier to develop, by providing a set of reusable, documented, and well-tested functions.
CMAPLE is a C++ reimplementation of MAPLE - a novel likelihood-based phylogenetic inference method for pandemic-scale epidemiological genomic data.
Primer3 is a widely used program for designing PCR primers. PCR is an essential and ubiquitous tool in genetics and molecular biology. Primer3 can also design hybridization probes and sequencing primers.
This package provides a phylogeny dating method using least-squares algorithms and criteria.
The IQ-TREE software was created as the successor of IQPNNI and TREE-PUZZLE (thus the name IQ-TREE). IQ-TREE was motivated by the rapid accumulation of phylogenomic data, leading to a need for efficient phylogenomic software that can handle a large amount of data and provide more complex models of sequence evolution. To this end, IQ-TREE can utilize multicore computers and distributed parallel computing to speed up the analysis. IQ-TREE automatically performs checkpointing to resume an interrupted analysis.
As input IQ-TREE accepts all common sequence alignment formats including PHYLIP, FASTA, Nexus, Clustal and MSF. As output IQ-TREE will write a self-readable report file (name suffix .iqtree), a NEWICK tree file (.treefile) which can be visualized by tree viewer programs such as FigTree, Dendroscope or iTOL.
Key features of IQ-TREE:
Fast and effective stochastic algorithm to reconstruct phylogenetic trees by maximum likelihood;
An ultrafast bootstrap approximation (UFBoot) to assess branch supports;
An ultrafast and automatic model selection (ModelFinder);
A flexible simulator (AliSim) which can simulate sequence alignments under more realistic models than Seq-Gen and INDELible;
Several fast branch tests like SH-aLRT and aBayes test and tree topology tests like the approximately unbiased (AU) test.
This package provides IQ-TREE version 2.
SHARC is a pipeline for somatic SV calling and filtering from tumor-only Nanopore sequencing data. It performs mapping, SV calling, SV filtering, random forest classification, blacklist filtering and SV prioritization, followed by automated primer design for PCR amplicons of 80-120 bp that are useful to track cancer ctDNA molecules in liquid biopsies.
This package is used to apply filtering on raw VCF calls generated using CaVEMan.