BOL

wiki.bits.vib.be - NGS data are just a bunch of sequences, you have no idea which region in the genome each sequences comes from, which gene it represents...To know that you have to align the sequences to the reference sequence. The reference sequence is in most cases...

www.isical.ac.in - Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a...

github.com - xmatchview and xmatchview-conifer are imaging tools for comparing the synteny between DNA sequences. It allows users to align 2 DNA sequences in fasta format using cross_match and displays the alignment in a variety of image formats. xmatchview and...

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...

It's been a while since I last installed BLAT and when I went to the download directory at UCSC: http://users.soe.ucsc.edu/~kent/src/ I found that the latest blast is now version 35 and that the code to download was: blatSrc35.zip....

github.com - Running Lastz (https://github.com/lastz/lastz) in parallel mode. This program is for single computer with multiple core processors. When the query file format is fasta, you can specify many threads to process it. It can reduce run time linearly,...

Only 4.4 percent DNA difference between Tiger and house cats

sourceforge.net - Opera (Optimal Paired-End Read Assembler) is a sequence assembly program (http://en.wikipedia.org/wiki/Sequence_assembly ). It uses information from paired-end or long reads to optimally order and orient contigs assembled from...

When you have both Illumina and Nanopore data, then SPAdes remains a good option for hybrid assembly - SPAdes was used to produce the B fragilis assembly by Mick Watson’s group. Again, running spades.py will show you the...

In graph theory, a string graph is an intersection graph of curves in the plane; each curve is called a "string". String graphs were first proposed by E. W. Myers in a 2005 publication.