At present, some people have posted articles about the analysis process of WGD. I searched for the keyword "wgd pipeline" and found the following:

GenoDup: https:// github.com/MaoYafei/GenoDup-Pipeline
https://peerj.com/articles/6303/
WGDdetector: https:// github.com/yongzhiyang2 012/WGDdetector
https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-019-2670-3
wgd: https:// github.com/arzwa/wgd
https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1142-2#Sec1
https://bmcbiol.biomedcentral.com/articles/10.1186/s12915-017-0399-x
GeNoGAP https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-016-1142-2
https://bmcbiol.biomedcentral.com/articles/10.1186/s12915-017-0399-x
https://github.com/dfguan/purge_dups
https://www.biorxiv.org/content/10.1101/2020.01.24.917997v1

This article introduces the usage of wgd.

Wgd cannot be installed directly with bioconda at present, so it is a little troublesome to install, because it depends on a lot of software. wgd depends on the following software

BLAST
MCL
MUSCLE/MAFFT/PRANK
PAML
PhyML/FastTree
i-ADHoRe

But the good news is that most of the software it depends on can be installed with bioconda

conda create -n wgd python=3.5 blast mcl muscle mafft prank paml fasttree cmake libpng mpi=1.0=mpich
conda activate wgd

Here mpi=1.0=mpich is selected, because i-adhore depends on mpich. If openmpi is installed, an error will appear while loading shared libraries: libmpi_cxx.so.40: cannot open shared object file: No such file or directory

After that, the installation is much simpler

git clone https://github.com/arzwa/wgd.git
cd wgd
pip install .
pip install git+https://github.com/arzwa/wgd.git
For i-ADHoRe, you need to register at http:// bioinformatics.psb.ugent.be /webtools/i-adhore/licensing/Agree to the license to download i-ADHoRe-3.0

Since my miniconda3 installed ~/opt/, the installation path is so~/opt/miniconda3/envs/wgd/

tar -zxvf i-adhore-3.0.01.tar.gz
cd i-adhore-3.0.01
mkdir -p build && cd build
cmake .. -DCMAKE_INSTALL_PREFIX=~/opt/miniconda3/envs/wgd/
make -j 4
make insatall

Take the sugarcane genome Saccharum spontaneum L as an example. The genome is 8-ploid with 32 chromosomes (2n = 4x8 = 32)

Download the tutorial for CDS and GFF annotation files

mkdir -p wgd_tutorial && cd wgd_tutorial
wget http://www.life.illinois.edu/ming/downloads/Spontaneum_genome/Sspon.v20190103.cds.fasta.gz
wget http://www.life.illinois.edu/ming/downloads/Spontaneum_genome/Sspon.v20190103.gff3.gz
gunzip *.gz

First conda activate wgdstart our analysis environment, and then start the analysis

Step 1 : Use to wgd mclidentify homologous genes in the genome

wgd mcl -n 20 --cds --mcl -s Sspon.v20190103.cds.fasta -o Sspon_cds.out

Step 2 : Use to wgd ksdbuild Ks distribution

wgd ksd --n_threads 80 Sspon_cds.out/Sspon.v20190103.cds.fasta.blast.tsv.mcl Sspon.v20190103.cds.fasta

Step 3 : If the quality of the genome is good, then wgd syncollinearity analysis can be used . It can help us find the collinearity block in the genome and the corresponding anchor point

wgd syn --feature gene --gene_attribute ID \
-ks wgd_ksd/Sspon.v20190103.cds.fasta.ks.tsv \
Sspon.v20190103.gff3 Sspon_cds.out/Sspon.v20190103.cds.fasta.blast.tsv.mcl

 For more reading - There are 9 sub-modules in WGD

• kde: KDE fitting to the Ks distribution
• ksd: Ks distribution construction
• mcl: BLASP comparison of All-vs-ALl + MCL classification analysis.
• mix: Hybrid modeling of Ks distribution.
• pre: preprocess the CDS file
• syn: Call I-ADHoRe 3.0 to use GFF files for collinearity analysis
• viz: draw histogram and density plot
• wf1: Ks standard analysis procedure of the whole genome paranome (paranome), call mcl, ksd and syn
• wf2: Ks standard analysis procedure of one-vs-one homologous gene (ortholog), call wcl and kSD

• Homology-based misassembly correction
• Homology-based assembly scaffolding and patching
• Scaffold merging

Address of the bookmark: https://github.com/malonge/RagTag

1. SPAdes: An assembler specifically designed for single-cell and multi-cell bacterial genomes, as well as small eukaryotic genomes.

2. ABySS: A parallelized assembler for large genomes that uses de Bruijn graphs.

3. Velvet: Another de Bruijn graph-based assembler optimized for short-read sequencing data.

4. SOAPdenovo: A de Bruijn graph-based assembler designed for short reads, widely used for assembling large and complex genomes.

5. MaSuRCA: A hybrid assembler that combines data from multiple sequencing technologies, such as Illumina and PacBio.

6. Canu: A long-read assembler optimized for PacBio and Oxford Nanopore sequencing data.

7. Flye: A long-read assembler suitable for bacterial and small eukaryotic genomes.

8. SMARTdenovo: An assembler designed for long reads, particularly suited for PacBio data.

9. SPAdes Long Read (SPAdesLR): An extension of SPAdes for long-read data, such as those from PacBio or Nanopore.

10. Minia: An assembler optimized for low memory consumption, suitable for small and medium-sized genomes.

11. Unicycler: A hybrid assembler that combines short and long reads for circular bacterial genome assembly.

12. wtdbg2: A de Bruijn graph assembler for long reads, efficient for very large genomes.

13. Shasta: A long-read assembler that uses the Overlap-Layout-Consensus approach, suitable for PacBio and Nanopore data.

14. Sparc: An assembler designed to handle noisy long reads from Nanopore sequencing.

15. CANA: An assembler for metagenomic data, particularly for complex and diverse microbial communities.

16. Ra Assembler: A metagenome assembler for long reads, designed for highly complex metagenomic samples.

Please note that the field of bioinformatics is constantly evolving, and new assembly tools may have emerged since my last update. Additionally, the performance of these tools can vary depending on the characteristics of the sequencing data and the genome being assembled. When selecting an assembly tool, consider the specific requirements of your project, the available data types, and the computational resources at your disposal. Always refer to the respective tool's documentation and publications for the most up-to-date information and recommendations.

Variant calling and/or genotyping

• DiscoSNP++ and discoSnpRAD: Reference-free small variant discovery (SNPs and indels)
• MindTheGap: Detection and assembly of large insertion variants
• TakeABreak: reference-free inversion discovery tool
• SVJedi: Structural Variant genotyper with long read data
• SVJedi-graph: Structural Variant genotyper with long read data using a variation graph

Sequence assembly

• MinYS: reference-guided genome assembly in metagenomics data
• MTG-link: local assembly tool for linked-read data
• Minia: De novo short read assembler
• de-novo pipeline: de-novo assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes
• Mapsembler2: Targeted assembly (not maintained)

Managing k-mers & indexation

• findere: simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
  • fimpera extends findere adding the abundance information.
• kmtricks: modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.
• kmindex is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.
• back to sequences: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.
• Backpack Quotient Filter: k-mer indexing data structure with abundance
• short read connector: Detect similar reads from potentially large read set
• DSK: Count K-mer in sequences

Pangenome graph manipulation

• Pancat: Pangenome Comparison and Analysis Toolkit
• GFAGraphs: a Python library to handle pangenome graph files in GFA format.

Comparative metagenomics with k-mers

• Simka and SimkaMin: Comparative metagenomics for large-scale datasets
• Comparead & Commet: comparison of metagenomic datasets

Species and bacterial strains identification

• ORI: software using long nanopore reads to identify bacteria present in a sample at the strain level
• StrainFLAIR: STRAIN-level proFiLing using vArIation gRaph

General-purpose sequencing data manipulation

• GASSST: long read mapper
• Leon: short read compressor (now included in GATB-core)
• Bloocoo: short read corrector
• BCALM: Construct compacted de Bruijn graphs (unitigs)

 Protein Structure

• A_Purva: Contact Map Overlap solver
• MD-Jeep: Distance Geometry solver
• CSA: Comparative Structural Alignment

Workflow

• SLICEE: parallel execution of bioinformatics workflows

Comparative Genomics

• CASSIS: detection of rearrangement breakpoints
• PLAST: intensive bank-to-bank sequence comparison
• DRJBreakpointFinder: detection and precise localization of excision sites in proviral segments

By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database nr used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.

Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.

Kaiju is described in Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. Nat. Commun. 7:11257 (open access).

Address of the bookmark: http://kaiju.binf.ku.dk/

https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/

Address of the bookmark: https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/

Author: Markus Riester [aut, cre], Angad P. Singh [aut]

Maintainer: Markus Riester <markus.riester at novartis.com>

Address of the bookmark: http://bioconductor.org/packages/release/bioc/html/PureCN.html

https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/

https://www.pango.network/how-does-the-system-work/what-are-pango-lineages/

Reference paper

https://www.nature.com/articles/s41564-020-0770-5

Address of the bookmark: https://www.pango.network/the-pango-nomenclature-system/statement-of-nomenclature-rules/

Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure, metamer, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.

Address of the bookmark: https://github.com/steineggerlab/Metabuli

Address of the bookmark: http://www.genengnews.com/keywordsandtools/print/3/32115/