chlorobox.mpimp-golm.mpg.de - OrganellarGenomeDRAW converts annotations in the GenBank or EMBL/ENA format into graphical maps. The input has to be a GenBank or EMBL/ENA flat file wherase the output can vary among several types of files....
github.com - Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.
https://genomes.atcc.org/ - The ATCC Genome Portal (AGP, https://genomes.atcc.org/) is a database of authenticated genomes for bacteria, fungi, protists, and viruses held in ATCC’s biorepository. It now includes 3,938 assemblies (253% increase) produced under ISO...
github.com - LAMSA (Long Approximate Matches-based Split Aligner) is a novel split alignment approach with faster speed and good ability of handling SV events. It is well-suited to align long reads (over thousands of base-pairs).
LAMSA takes takes the...
github.com - #Running TULIP (The Uncorrected Long-read Integration Process), version 0.4 late 2016 (European eel)
TULIP currently consists of to Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional...
github.com - TULIP currently consists of two Perl scripts, tulipseed.perl and tulipbulb.perl. These are very much intended as prototypes, and additional components and/or implementations are likely to follow.
Tulipseed takes as input alignments files of long...
github.com - PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends...
bitbucket.org - S-plot2 creates an interactive, two-dimensional heatmap capturing the similarities and dissimilarities in nucleotide usage between genomic sequences (partial or complete). In S-plot2, whole eukaryotic chromosomes and smaller prokaryotic genomes can...
code.google.com - lideSort-BPR ( b reak p oint r eads) is based on a fast algorithm for all-against-all comparisons of short reads and theoretical analyses of the number of neighboring reads. When applied to a dataset with a sequencing...