BOL

github.com - Scripts for the analysis of HGT in genome sequence data

emboss.sourceforge.net - needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two...

lin-group.cn - iRNAD, for identifying D modification sites in RNA sequence. In this predictor, the RNA samples derived from five species were encoded by nucleotide chemical property and nucleotide density. Support vector machine was utilized to perform the...

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

On Jan 10 2020, while news of the first fatality was barely trickling in, the 29,903 letters constituting the viral genome from an affected individual in Wuhan had already been elucidated (even though a few corrections were made subsequently).

China’s BGI says it can sequence a genome for just $100

github.com - MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin)...

github.com - UniAligner (formerly, TandemAligner) is the first parameter-free algorithm for sequence alignment that introduces a sequence-dependent alignment scoring that automatically changes for any pair of compared sequences. Classical alignment approaches,...

omega.omicsbio.org - Omega found overlaps between reads using a prefix/suffix hash table. The overlap graph of reads was simplified by removing transitive edges and trimming short branches. Unitigs were generated based on minimum cost flow analysis of the overlap graph...

github.com - Miniasm is a very fast OLC-based de novo assembler for noisy long reads. It takes all-vs-all read self-mappings (typically by minimap) as input and outputs an assembly graph in the GFA format. Different from mainstream...