Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
-
Updated
Apr 29, 2024 - C
Algorithm for ultra-scale multiple sequence alignments (3M protein sequences in 5 minutes and 24 GB of RAM)
Mutual Information Tools for protein Sequence analysis in Julia
PARS is a python package for browsing and downloading files deposed in Pfam and Rfam databases (e.g. sequences, alignments, hmm). It has implemented classes dedicated to Pfam data like: PfamFamily or PfamClan. PARS is compatible with Biopython modules, but also is extended by HMMER wrapper which enables convenient usage of downloaded HMM files. …
Co-occurrence of enzyme domains
PFAM's micro service to assist to Mistic2.
A Bio2BEL package for PFAM (https://pfam.xfam.org/)
Set of tools for protein sequence enrichment and protein domain finding
Mapping domain co-occurrence networks with emphasis on c-d-GMP binding domains.
Scripts to calculate sequence similarity networks (SSNs) and clustering of protein sequences.
Snakemake pipeline for searching genomic sequences for those encoding proteins containing domains of choice
Minimal benchmark test to compare zstd (zstandard) compression with gzip for the datafile Pfam-A.full.gz
CroMaSt (Cross Mapper of domain Structural instances) is an automated iterative workflow to clarify domain definition by cross-mapping of domain structural instances between domain databases.
Method for retrieving and visualising the protein domains of any protein coding isoform and of different genomes. Enables joint visualisations representing alternative splicing events.
A deepchain-app to predict protein family 🔬
Add a description, image, and links to the pfam topic page so that developers can more easily learn about it.
To associate your repository with the pfam topic, visit your repo's landing page and select "manage topics."