BOL

www.ncbi.nlm.nih.gov - Mulan: Multiple-sequence local alignment and visualization for studying function and evolution Mulan (http://mulan.dcode.org/), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional...

github.com - GFA (Graphical Fragment Assembly) is an emerging standard format for representing sequence graphs. Although it was originally conceived as a format for sequence assembly (hence the name), and this remains its core application, it is more general,...

https://proksee.ca/ - Proksee is an expert system for genome assembly, annotation and visualization. To begin using Proksee, provide a complete genome sequence, sequencing reads or a CGView/Proksee map JSON file.

github.com - NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes  NGenomeSyn [multiple (N) Genome Synteny], for publication-ready visualization of syntenic relationships of...

www.seqan.de - STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X...

github.com - Syri compares alignments between two chromosome-level assemblies and identifies synteny and structural rearrangements.

mitra.stanford.edu - https://www.nature.com/articles/s41467-020-17155-yServer Infrastructure: File Server: dhara: Synology 3614 Storage Appliance 4 Core Xeon 108TB disk storage 10Gb ethernet to SCG3 Access atx: dhara:5000 Has btsync server (try it - its much...

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

sourceforge.net - Sept. 20, 2017 Version 3.1 released. Major upgrade. Version 3.1 fixes the problems with SNP annotation that arose when NCBI discontinued use of GI numbers. Please read carefully the Preface (page 3) and the File of annotated genomes section (pages...

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.