BOL

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.

lh3.github.io - Heng Li posted several issues with the human reference genomes given in these resources and suggests the following compressed FASTA file to be used as hg38/GRCh38 human reference genome. if you map reads to GRCh38 or hg38, use the...

sourceforge.net - Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies. Genome assembly projects typically run multiple algorithms in an attempt to find the single best...