BLASTn output format 6
BLASTn maps DNA against DNA, for example gene sequences against a reference genomeblastn -query genes.ffn -subject genome.fna -outfmt 6
BLASTn tabular output format 6
Column headers:qseqid sseqid pident...
www.kegg.jp - KOALA (KEGG Orthology And Links Annotation) is KEGG's internal annotation tool for K number assignment of KEGG GENES using SSEARCH computation. BlastKOALA and GhostKOALA assign K numbers to the user's sequence data...
github.com - A comparative genome scaffolding tool based on MUMmer
mScaffolder scaffolds a genome using an existing high quality genome as the reference. It aligns the two genomes using nucmer utility from MUMmer and then orders and orients the contigs of the...
There are many tools to perform gap filling using Illumina short reads, for example "GapFiller: a de novo assembly approach to fill the gap within paired reads" or "Toward almost closed genomes with GapFiller". There are also some tools like...
http://wilkox.org/gggenes - Install the stable version of gggenes from CRAN:
install.packages("gggenes")
If you want the development version, install it from GitHub:
devtools::install_github("wilkox/gggenes")
More at https://github.com/wilkox/gggenes
fujiwara/perl-queue-q4pg-lite - simple message queue using PostgreSQL.
formbuilder/formbuilder - Perl CGI::FormBuilder module for generating, validating, and processing HTML forms
fastly/fastly-perl - Fastly perl...
The scholarship is designed for Indian students from all fields and streams of study, enrolled in an Indian institution at the Bachelors or Master’s degree level, who wish to undertake a study exchange semester programme in France (for a period of...
github.com - HISAT2 is a fast and sensitive alignment program for mapping next-generation sequencing reads (both DNA and RNA) to a population of human genomes (as well as to a single reference genome). Based on an extension of BWT for...
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...