BOL

github.com - git clone https://github.com/lh3/minimap2 cd minimap2 && make # long sequences against a reference genome ./minimap2 -a test/MT-human.fa test/MT-orang.fa > test.sam # create an index first and then map ./minimap2 -d MT-human.mmi...

www2.decipher.codes - DECIPHER is a software toolset that can be used for deciphering and managing biological sequences efficiently using the R programming language. The R package is distributed as platform independent source code under the GPL...

github.com - Kalign is a fast multiple sequence alignment program for biological sequences. Align sequences and output the alignment in MSF format: kalign -i BB11001.tfa -f msf -o out.msf Align sequences and output the alignment in clustal format: kalign...

academic.oup.com - With a large number of metagenomic datasets becoming available, eukaryotic metagenomics emerged as a new challenge. The proper classification of eukaryotic nuclear and organellar genomes is an essential step toward a better understanding of...

github.com - Jaeger is a tool that utilizes homology-free machine learning to identify phage genome sequences that are hidden within metagenomes. It is capable of detecting both phages and prophages within metagenomic assemblies.

milkweedgenome.org - Some of the useful bioinformatics scripts. For example ... contig-stats.pl is a Perl script that will automatically describe features of a sequence assembly. http://milkweedgenome.org/?q=scripts

BINC sample question paper round THREE ...

Solved with perl http://rosalind.info/problems/1a/ #Find the most frequent k-mers in a string.#Given: A DNA string Text and an integer k.#Return: All most frequent k-mers in Text (in any order).use strict;use warnings;my...

The question at http://rosalind.info/problems/1d/ Script are moved to http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl