Address of the bookmark: https://sanger-pathogens.github.io/Roary/

Address of the bookmark: https://github.com/lmcai/PhyloHerb/

Abstract: Strand NGS includes comprehensive workflows for DNA-Seq, RNA-Seq, Small RNA-Seq, ChIP-Seq, MeDIP-Seq, and Methyl-Seq analysis. Each workflow includes a quality assessment and filter section, followed by a workflow-specific analysis section. The pipeline functionality in Strand NGS allows users to execute a sequence of analysis steps with specific parameters - all without any manual intervention. This simplifies the analysis in large scale sequencing projects where every sample needs to be processed identically.

In this webinar we will discuss the pre-packaged pipelines present in Strand NGS. The packaged pipelines have well-chosen default parameters and are suitable for users analyzing data for the first time in the tool. We will also show how advanced users can customize pipelines and share them with other Strand NGS users. Finally, we will show a brief glimpse of an elaborate pipeline that aligns reads, filters poor-quality matches, computes coverage metrics, identifies variants, checks for sample cross-contamination, and emails quality reports - all from within Strand NGS.

Speaker: Dr. Vamsi Veeramachaneni, Vice President - Bioinformatics, Strand Life Sciences

Details: Session 1: 2:30 PM IST, Session 2 : 10:30 PM IST
Register here: http://www.strand-ngs.com/webinar_registration

Address of the bookmark: https://pgapx.ybzhao.com/

Documentation can be found at https://nanoporetech.github.io/katuali/.

Address of the bookmark: https://github.com/nanoporetech/katuali

gapFinisher can fill gaps in draft genomes quickly and reliably.

Address of the bookmark: https://github.com/kammoji/gapFinisher

https://sunbeam.readthedocs.io/en/latest/

Address of the bookmark: https://github.com/sunbeam-labs/sunbeam

More at https://academic.oup.com/bib/advance-article-abstract/doi/10.1093/bib/bbab022/6146772

Address of the bookmark: https://github.com/huangs001/AlignGraph2

What is PhyloHerb: PhyloHerb is a wrapper program to process genome skimming data collected from plant materials. The outcomes include the plastid genome (plastome) assemblies, mitochondrial genome assemblies, nuclear ribosomal DNAs (NTS+ETS+18S+ITS1+5.8S+ITS2+28S), alignments of gene and intergenic regions, and a species tree. It is designed to be a high throughput program dealing with lower quality data. Examples include low-coverage (5x cpDNA) plastome phylogeny, recycling plastid genes from target enrichment data, retrieving low-copy nuclear genes from medium coverage (5x nucDNA) genome skimming.

License: GNU General Public License

Citation:

• Cai, Liming, Hongrui Zhang, and Charles C. Davis. 2022. PhyloHerb: A high‐throughput phylogenomic pipeline for processing genome‐skimming data. Applications in Plant Sciences 10(3): 1–9. https://doi.org/10.1002/aps3.11475

Address of the bookmark: https://github.com/lmcai/PhyloHerb/

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/BASE

It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin