BOL

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

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

mulan.dcode.org - Mulan performs multiple (2 or more) sequence alignments with an efficient and rapid "full local" alignment strategy that ensures a recapitulation of evolutionary sequence rearrangements (such as inversions and reshuffling) in any of the species. It...

Horizontal gene transfer (HGT), the “non-sexual movement of genetic material between two organisms” , is relatively common in prokaryotes and single-celled eukaryotes, but a number of factors combine to make it far rarer in...

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

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

ftp.genomics.org.cn - An efficient tool called Connecting Overlapped Pair-End (COPE) reads, to connect overlapping pair-end reads using k-mer frequencies. We evaluated our tool on 30× simulated pair-end reads from Arabidopsis thaliana with 1% base error. COPE...

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.