github.com - gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command lines. They compare the performance of gapFinisher against two other published gap filling tools PBJelly and...
github.com - gapFinisher to process SSPACE-LongRead output to fill gaps after the scaffolding. gapFinisher is based on the controlled use of a previously published gap filling tool FGAP and works on all standard Linux/UNIX command...
github.com - SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes...
github.com - Collection of Python libraries to parse bioinformatics files, or perform computation related to assembly, annotation, and comparative genomics.
github.com - MitoHiFi v3.2 is a python pipeline distributed under MIT License !
MitoHiFi was first developed to assemble the mitogenomes for a wide range of species in the Darwin Tree of Life Project...
github.com - SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes...
majiq.biociphers.org -
Ability to detect, quantify, and visualize complex and de-novo splicing variations from RNASeq.
MAJIQ’s accuracy compares favorably to other algorithms.
MAJIQ 2 is *way* faster, more memory and I/O efficient
New visualization (VOILA...
portal.nersc.gov - geNomad is a tool that identifies virus and plasmid genomes from nucleotide sequences. It provides state-of-the-art classification performance and can be used to quickly find mobile genetic elements from genomes, metagenomes, or metatranscriptomes.
github.com - LTR_Finder is an efficient program for finding full-length LTR retrotranspsons in genome sequences.
The Program first constructs all exact match pairs by a suffix-array based algorithm and extends them to long highly similar pairs. Then...