Careful encoding of graph entities allows odgi to efficiently compute and transform pangenomes with minimal overheads. odgi implements a dynamic data structure that leveraged multi-core CPUs and can be updated on the fly.

The edges and path steps are recorded as deltas between the current node id and the target node id, where the node id corresponds to the rank in the global array of nodes. Graphs built from biological data sets tend to have local partial order and, when sorted, the deltas be small. This allows them to be compressed with a variable length integer representation, resulting in a small in-memory footprint at the cost of packing and unpacking.

The RAM and computational savings are substantial. In partially ordered regions of the graph, most deltas will require only a single byte.

Address of the bookmark: https://github.com/pangenome/odgi

Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.

All the data on extant species displayed in this browser are from Ensembl.

Summary statistics of Genomicus version 105.01: (view species tree in pdf or newick)

Address of the bookmark: https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl

Canu is a hierachical assembly pipeline which runs in four steps:

• Detect overlaps in high-noise sequences using MHAP
• Generate corrected sequence consensus
• Trim corrected sequences
• Assemble trimmed corrected sequences

Read the documentation

New release https://github.com/marbl/canu/releases

Address of the bookmark: https://github.com/marbl/canu

Features

• Circular and linear views of genomes

• Capable of drawing genomes up to 10 Mbp with 1000's of features and 100's contigs

• Smooth zooming down to the sequence level

• Easily generate features and plots directly form the sequence (e.g. ORFs, GC-content and GC-Skew)

• Save high resolution PNG maps up to 8000x8000px

• Fully documented API for interacting with CGView.js maps

Address of the bookmark: https://js.cgview.ca/

Address of the bookmark: http://www.softberry.com/berry.phtml?topic=fgenesh&group=help&subgroup=gfind

Link to working demo: https://vgteam.github.io/sequenceTubeMap/

Address of the bookmark: https://github.com/vgteam/sequenceTubeMap

Input formats, automated data upload from the UCSC Genome Browser, gene annotation, annotation of repetitive elements, and progress report were previously described in the zPicture instructions and we refer the users to these materials for more details. This introduction is mainly focused on some novel features unique to the Mulan.

Address of the bookmark: https://mulan.dcode.org/mulanInstructions.php

Mauve has been developed with the idea that a multiple genome aligner should require only modest computational resources. It employs algorithmic techniques that scale well in the lengths of sequences being aligned. For example, a pair of Y. pestis genomes can be aligned in under a minute, while a group of 9 divergent Enterobacterial genomes can be aligned in a few hours. However, the current algorithm’s compute time (progressiveMauve) scales cubically in the number of genomes to align, making it unsuitable for datasets containing more than 50-100 bacterial genomes.

Address of the bookmark: http://darlinglab.org/mauve/mauve.html