BOL

github.com - Cactus is a reference-free whole-genome multiple alignment program. The principal algorithms are described here: https://doi.org/10.1101/gr.123356.111 Cactus uses substantial resources. For primate-sized genomes (3 gigabases each), you should...

github.com - The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage ofhomologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in...

bioinformatics.um6p.ma - AlignStatPlot, a new R package and online tool that is well-documented and easy-to usefor MSA and post-MSA analysis. This tool performs both traditional and cutting-edge analy-ses on sequencing data and generates new visualisation methods for MSA...

github.com - Alvis, a simple command line tool that can generate visualisations for a number of common alignment analysis tasks. Alvis is a fast and portable tool that accepts input in a variety of alignment formats and will output production ready vector...

gitlab.mbb.univ-montp2.fr - CroCo is a program to detect cross contamination events in assembled transcriptomes using sequencing reads to determine the true origin of every transcripts.Such cross contaminations can be expected if several RNA-Seq experiments were prepared...

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.