What is Genome Assembly?

Genome assembly involves piecing together short DNA sequence reads generated by sequencing platforms (e.g., Illumina, PacBio, Oxford Nanopore) into longer, contiguous sequences called contigs. This can be performed as:

• De Novo Assembly: Without a reference genome.
• Reference-Guided Assembly: Using a reference genome to guide the assembly process.

Step 1: Preparing Your Data

Before starting the assembly, ensure that your raw sequencing data is high quality.

1. Input Data

   • Short Reads: Illumina sequencing generates short, accurate reads ideal for scaffolding.
   • Long Reads: PacBio and Nanopore sequencing provide long reads for resolving repetitive regions.

2. Quality Control (QC)
   Use tools like FastQC or MultiQC to assess the quality of your reads:

   fastqc reads.fastq multiqc .

   Look for issues like low-quality bases, adapter contamination, or overrepresented sequences.

3. Read Trimming and Filtering
   Trim low-quality bases and adapters using Trimmomatic or Cutadapt:

   trimmomatic PE reads_R1.fastq reads_R2.fastq trimmed_R1.fastq trimmed_R2.fastq \ ILLUMINACLIP:adapters.fa:2:30:10 LEADING:3 TRAILING:3 SLIDINGWINDOW:4:20 MINLEN:36

Step 2: Choosing an Assembly Strategy

Select an assembly strategy based on your data type:

• Short-Read Assemblers:

  • SPAdes: Popular for microbial genomes.
  • Velvet: Fast for smaller genomes.

• Long-Read Assemblers:

  • Canu: Ideal for long-read datasets.
  • Flye: Versatile for small and large genomes.

• Hybrid Assemblers:

  • MaSuRCA: Combines short and long reads.
  • Unicycler: Optimized for bacterial genomes.

Step 3: Running the Assembly

3.1. SPAdes (Short-Read Assembly)

SPAdes is an excellent choice for small genomes, such as bacteria.

The output includes assembled contigs (contigs.fasta) and scaffolds (scaffolds.fasta).

3.2. Canu (Long-Read Assembly)

Canu is designed for high-error long reads from PacBio or Nanopore.

The output will be in canu_output/genome.contigs.fasta.

3.3. Hybrid Assembly with Unicycler

Unicycler combines short and long reads for improved assemblies.

Step 4: Assessing Assembly Quality

After assembly, evaluate its quality using the following tools:

1. QUAST
   QUAST generates assembly statistics, such as N50, genome size, and GC content:

   quast contigs.fasta -o quast_output

2. BUSCO
   BUSCO checks genome completeness by identifying conserved genes:

   busco -i contigs.fasta -o busco_output -l fungi_odb10 -m genome

3. Assembly Graph Visualization
   Visualize assembly graphs with Bandage:

   Bandage load assembly_graph.gfa

Step 5: Post-Assembly Steps

1. Polishing
   Improve assembly accuracy using tools like Pilon (for short reads) or Racon (for long reads).

   racon long_reads.fasta mapped_reads.sam contigs.fasta > polished_contigs.fasta

2. Scaffolding
   Link contigs into scaffolds using tools like SSPACE or Opera-LG if required.

3. Annotation
   Annotate the assembled genome using Prokka for prokaryotes or Maker for eukaryotes.

   prokka --outdir annotation_output --prefix genome contigs.fasta

Step 6: Sharing and Archiving

1. Submit to Public Repositories
   Share your assembly in databases like NCBI GenBank, ENA, or DDBJ.

2. Metadata Preparation
   Include detailed metadata for your submission, such as organism name, sequencing platform, and coverage.

Best Practices

• Always perform quality checks at each stage to ensure data integrity.
• Use multiple tools to cross-validate results when working with complex genomes.
• Document parameters and software versions for reproducibility.

Conclusion

Genome assembly is a powerful process that transforms raw sequencing data into a coherent representation of an organism’s genome. By following this step-by-step guide, you can successfully assemble genomes and uncover valuable biological insights. Whether you’re assembling a microbial genome or tackling the complexities of a eukaryotic genome, these tools and strategies will set you on the path to success.

The software is implemented in Python 3 and runs in both Python 2.7 and 3.4– on Macintosh and Linux systems. It is freely available at https://github.com/nigyta/dfast_core/ under the GPLv3 license with external binaries bundled in the software distribution. An on-line version is also available at https://dfast.nig.ac.jp/.

Address of the bookmark: https://dfast.nig.ac.jp/

Address of the bookmark: http://genomearchitect.github.io/

We first operate a rapid inspection of the different BAM files using samtools flagstat. Illumina provided chr21 read mapping obtained with their GA IIx deep sequencing platform <ftp://webdata:webdata@ussd-ftp.illumina.com/Data/SequencingRuns/NA18507_GAIIx_100_chr21.bam>, aligned to the b36/hg18 reference genome)

Address of the bookmark: https://wiki.bits.vib.be/index.php/NGS_Exercise.6#compare_aln_.26_mem_results_with_vcf-compare

Smudgeplots are computed from raw or even better from trimmed reads and show the haplotype structure using heterozygous kmer pairs. For example:

Address of the bookmark: https://github.com/KamilSJaron/smudgeplot

https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-020-6568-2

Address of the bookmark: https://github.com/HuffordLab/GenomeQC

Note: This image/cartoon is create only for fun. It has nothing to do with any scientific findings.

Address of the bookmark: https://www.nature.com/articles/srep20802

This is where KiNext comes into the picture. Introduced in a 2024 study published in BMC Bioinformatics, KiNext is a computational workflow designed to identify and classify protein kinases from predicted protein sequences. Instead of relying on a single search method, it brings together several approaches, including Hidden Markov Models, sequence alignment, phylogenetic analysis, and structural comparison.

The search begins with a simple question: does a protein contain the characteristics of a kinase? Protein kinases can change considerably during evolution, but important regions of their sequences often retain recognizable patterns. KiNext uses Hidden Markov Models, or HMMs, to detect these patterns. An HMM does not require a protein to be an exact match to a known kinase. Instead, it looks for a statistical sequence signature associated with kinase proteins, making it possible to detect more distant candidates.

Once potential kinases are identified, KiNext takes the analysis further. It distinguishes conventional eukaryotic protein kinases from atypical protein kinases and then attempts to classify them into different kinase groups and families. This distinction is important because simply identifying a protein as a kinase does not tell the complete story. Different kinase families can have very different evolutionary histories and biological functions.

The next stage brings evolution into the picture. KiNext can align kinase sequences and construct phylogenetic trees, allowing researchers to examine how newly identified proteins are related to previously characterized kinases. When sequence evidence alone is difficult to interpret, structural information can provide another clue. The workflow can incorporate AlphaFold-predicted structures and Foldseek-based structural comparisons to investigate whether an unusual protein resembles known kinase structures.

The researchers tested KiNext using two very different organisms: the Pacific oyster, Crassostrea gigas, and the green alga Ostreococcus tauri. In C. gigas, KiNext recovered previously reported kinases while identifying additional candidates. Structural analysis provided further evidence for many of the newly detected proteins. In O. tauri, the workflow similarly recovered most previously reported kinases and identified additional candidates while refining some of their classifications.

What makes KiNext particularly interesting is not just its ability to find kinases, but how the entire analysis is organized. The workflow uses Nextflow, allowing the different computational steps to be connected into a reproducible pipeline. Containers can also help manage software dependencies, making it easier to run the workflow across different computing environments.

This reproducibility becomes increasingly important as the number of available genomes continues to grow. A researcher studying one organism may be able to perform an analysis manually, but repeating the same process across hundreds or thousands of genomes quickly becomes impractical. A standardized workflow provides a way to perform the analysis consistently while keeping track of how the results were generated.

At its core, KiNext demonstrates a broader change taking place in modern genomics. Sequencing a genome provides an enormous amount of information, but the real scientific challenge begins afterward: understanding what all those sequences mean. Protein kinases are only one part of this larger puzzle, yet they are particularly important because they act as molecular switches throughout the cell.

By combining sequence profiles, evolutionary analysis, and structural evidence within a reproducible computational framework, KiNext provides researchers with a systematic way to uncover these molecular switches. Its real value lies not only in finding more kinases, but in making the process scalable, repeatable, and easier to apply to new genomes.

As genome sequencing continues to expand across the tree of life, tools such as KiNext can help turn enormous collections of protein sequences into meaningful biological stories—one kinase at a time.

Read more about it @

https://link.springer.com/article/10.1186/s12859-024-05953-w