Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/

You might learn a lot about that house—the rooms, the doors, the furniture—but you would miss the bigger story: the streets, the neighborhoods, and all the ways the city changes from one place to another.

Something similar happens when scientists study bacterial genomes one at a time.

Over the past decade, researchers have collected thousands of bacterial genomes. These genomes contain an enormous amount of information about how bacteria survive, adapt, and evolve. But comparing thousands of individual genomes can quickly become a computational maze.

That is where PANORAMA enters the story.

Developed by Jérôme Arnoux and colleagues, PANORAMA is a computational tool designed to explore bacterial pangenomes—the complete collection of genetic possibilities found across a species or group of related organisms. Instead of looking at every genome as an isolated object, the approach represents their shared and variable genetic features as a graph.

Think of this graph as a giant subway map.

Some stations appear on almost every route. These represent genes that are highly conserved. Other stations appear only on certain routes, representing genes that some bacteria possess while others do not. By looking at the entire network, scientists can begin to see not just *what genes exist*, but how they are organized and how biological systems are distributed across populations.

The researchers put PANORAMA to the test using 941 genomes of Pseudomonas aeruginosa, a bacterium important in human health. They used the tool to investigate biological systems, including bacterial defense mechanisms against viruses known as bacteriophages. They then expanded the analysis to more than 6,000 genomes from four Enterobacteriaceae species.

The result is more than a faster way to process data.

PANORAMA allows researchers to ask a bigger question: What can an entire microbial species do, genetically speaking?

By comparing pangenomes, the researchers could identify systems shared between species as well as distinctive features. They could also find recurring genomic locations where genetic material is inserted—clues that may reveal common evolutionary processes.

And this is perhaps the most exciting part of the story.

Every bacterial genome is like a page in a huge evolutionary book. Until recently, reading thousands of those pages together was difficult. PANORAMA provides a way to turn those pages into a map, allowing scientists to see patterns that might disappear when each genome is studied separately.

The study, published in PLOS Computational Biology in July 2026, presents PANORAMA as a foundation for large-scale comparative pangenomics. The software and accompanying analysis resources are openly available, giving other researchers the opportunity to explore microbial diversity themselves.

So the story is not really about one bacterium or one genome.

It is about changing the way we look at life.

Instead of asking, “What is inside this genome?”, scientists can increasingly ask, “What is the full genetic landscape of this species—and how did it become this way?”

And sometimes, when you stop looking at one house and finally see the whole city, the most interesting discoveries are hiding in the streets between them.

Read more at https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013856

https://fungidb.org/fungidb/app/downloads/Current_Release/GultimumBR650/

Address of the bookmark: https://pangenome.github.io/

There are two options to run ShRec3D (on linuX only so far): the first one uses the Matlab complier runtime environment (MCR), the second one doesn't need any other library to be installed but only works with the latest versions of Linux (equivalent to Fedora 19 and above).

Address of the bookmark: https://sites.google.com/site/julienmozziconacci/#TOC-Downloads

Average read length is around 8,500 base pairs in release dataset. Best thing about this, there is not much effect on cost and quality of data.

You can also check following pages for publications on long reads and more:

http://www.illumina.com/services/long-read-sequencing-service.ilmn

http://blog.basespace.illumina.com/2013/07/22/first-data-set-from-fasttrack-long-reads-early-access-service/

Address of the bookmark: http://omega.omicsbio.org/

So far miniasm is in early development stage. It has only been tested on a dozen of PacBio and Oxford Nanopore (ONT) bacterial data sets. Including the mapping step, it takes about 3 minutes to assemble a bacterial genome. Under the default setting, miniasm assembles 9 out of 12 PacBio datasets and 3 out of 4 ONT datasets into a single contig. The 12 PacBio data sets are PacBio E. coli sample, ERS473430, ERS544009, ERS554120, ERS605484, ERS617393, ERS646601, ERS659581, ERS670327, ERS685285, ERS743109 and a deprecated PacBio E. coli data set. ONT data are acquired from the Loman Lab.

For a C. elegans PacBio data set (only 40X are used, not the whole dataset), miniasm finishes the assembly, including reads overlapping, in ~10 minutes with 16 CPUs. The total assembly size is 105Mb; the N50 is 1.94Mb. In comparison, the HGAP3produces a 104Mb assembly with N50 1.61Mb. This dotter plot gives a global view of the miniasm assembly (on the X axis) and the HGAP3 assembly (on Y). They are broadly comparable. Of course, the HGAP3 consensus sequences are much more accurate. In addition, on the whole data set (assembled in ~30 min), the miniasm N50 is reduced to 1.79Mb. Miniasm still needs improvements.

Miniasm confirms that at least for high-coverage bacterial genomes, it is possible to generate long contigs from raw PacBio or ONT reads without error correction. It also shows that minimap can be used as a read overlapper, even though it is probably not as sensitive as the more sophisticated overlapers such as MHAP and DALIGNER. Coupled with long-read error correctors and consensus tools, miniasm may also be useful to produce high-quality assemblies.

Minimap and miniasm are ultrafast tools for (i) mapping and (ii) assembly. Designed for long, noisy reads, they do not have a correction or consensus step, and therefore the resulting assemblies are contiguous (i.e. long) but very noisy (i.e. full of errors)

We start with an all against all comparison:

minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz

Then we can assemble

miniasm -f reads.fq reads.paf.gz > reads.gfa

Convert GFA to FASTA:

awk '/^S/{print ">"$2"\n"$3}' reads.gfa | fold > reads.fa

And then count how many contigs:

grep ">" reads.fa | wc -l

# Download sample PacBio from the PBcR website
wget -O- http://www.cbcb.umd.edu/software/PBcR/data/selfSampleData.tar.gz | tar zxf -
ln -s selfSampleData/pacbio_filtered.fastq reads.fq
# Install minimap and miniasm (requiring gcc and zlib)
git clone https://github.com/lh3/minimap && (cd minimap && make)
git clone https://github.com/lh3/miniasm && (cd miniasm && make)
# Overlap
minimap/minimap -Sw5 -L100 -m0 -t8 reads.fq reads.fq | gzip -1 > reads.paf.gz
# Layout
miniasm/miniasm -f reads.fq reads.paf.gz > reads.gfa

Address of the bookmark: https://github.com/lh3/miniasm

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

https://github.com/ggonnella/rgfa

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5103826/

https://www.nature.com/articles/nmeth.4432

Address of the bookmark: https://github.com/xiaochuanle/MECAT