More at https://bmcbioinformatics.biomedcentral.com/articles/10.1186/s12859-020-03666-4

Address of the bookmark: https://github.com/aghozlane/shaman

We therefore list many genomle assembly tools here. We mainly reported for the assembly of genomes while the others are designed aiming at handling complex genomes.

• RMAP 2.1 – Short-read Mapping
  RMAP is aimed to map accurately reads from the next-generation sequencing technology. RMAP can map reads with or without error probability information (quality scores) and supports paired-end reads or bisulfite-treated reads mapping. There is no limitaions on read widths or number of mismatches. RMAP can now map more than 8 million reads in an hour at full sensitivity to 2 mismatches
  
  
• MIRA 4.0.2 – Whole Genome Shotgun and EST Sequence Assembler
  MIRA (Mimicking Intelligent Read Assembly)is a whole genome shotgun and EST sequence assembler for Sanger, 454, Solexa (Illumina), IonTorrent data and PacBio (the later at the moment only CCS and error-corrected CLR reads). It can be seen as a Swiss army knife of sequence assembly developed and used in the past 12 years to get assembly jobs done efficiently – and especially accurately. That is, without actually putting too much manual work into finishing the assembly.
  
  
• HapCompass 0.7.7 – A Cycle-Basis Algorithm for Accurate Haplotype Assembly
  HapCompass for polyploid genomes can currently be used to create accurate pairwise SNP phasings.Given a set of aligned sequence reads in a SAM file and a set of variant calls in VCF format, HAPCOMPASS will assemble reads into haplotypes.
  
  
• GAM-NGS 1.1b – Genome Assemblies Merger for Next Generation Sequencing
  GAM-NGS is able to merge two or more assemblies and it rteturns an improved assembly (more contiguous and more correct). GAM-NGS shows its full potential with multi-library Illumina-based projects.
  
  
• GeneStitch 1.2.1 – Network Matching Algorithm to Gene Assembly
  GeneStitch is a tool to assemble genes using network matching algorithm. Given an already-assembled dataset, it is capable of assembling contigs together to form more complete genes with the help of a reference gene set. Currently the assembly software that GeneStitch support is SOAPdenovo.
  
  
• RACA 0.9.1.1 – Reference-Assisted Chromosome Assembly
  RACA is an algorithm to reliably order and orient sequence scaffolds generated by NGS and assemblers into longer chromosomal fragments using comparative genome information and paired-end reads.
  
  
• DISCOVAR 51750 – Genome Shotgun Assembler and Variant Caller
  DISCOVAR is a whole genome shotgun assembler and variant caller that can generate high quality assemblies and variant calls from the latest 250 base Illumina PCR-free fragment reads.
  
  
• SeqCons 1.0 – de novo and reference-guided Sequence Assembly
   SeqCons (Sequence consensus) is an open source consensus computation program for Linux and Windows. The algorithm can be used for de novo and reference-guided sequence assembly.
  
  
• SimAssemblyStage1/2 0.2 – Assembly Alignment of Contigs
  SimAssemblyStage1: Perfectly aligns TranscriptSimulator reads to their nucleotide templates using read title inforamation, creating ideal simulated assembly of super contigs.
  
  
• GapFiller – Closing the Gap within Paired Reads
  GapFiller is not a standard de novo assembler. It aims “only” at closing the gap between pairs of reads as a first step of a large number of downstream analysis
  
  
• PAGIT 1.01 – Post Assembly Genome Improvement Toolkit
  PAGIT (Post Assembly Genome Improvement Toolkit) is a tools to generate automatically high quality sequence by ordering contigs, closing gaps, correcting sequence errors and transferring annotation.
  
  
• ShoRAH 0.8.2 – Short Reads Assembly into Haplotypes
  ShoRAH is a software package that allows for inference about the structure of a population from a set of short sequence reads as obtained from ultra-deep sequencing of a mixed sample. The package contains programs that support mapping of reads to a reference genome, correcting sequencing errors by locally clustering reads in small windows of the alignment, reconstructing a minimal set of global haplotypes that explain the reads, and estimating the frequencies of the inferred haplotypes.
  
  
• RePS 2.0 – WGS Sequence Assembler
  RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering
  
  
• treecat – Phylogenetic Comparative Assembly
  treecat (phylogenetic tree based contig arrangement tool) takes several genomes and their relationships in a phylogenetic tree into account to estimate a possible ordering of the contigs.
  
  
• IsoLasso 2.6.1 – A LASSO Regression Approach to RNA-Seq Based Transcriptome Assembly
  IsoLasso is an algorithm to assemble transcripts and estimate their expression levels from RNA-Seq reads.
  
  
• CEM 0.9.1 – Transcriptome Assembly and Isoform Expression Level Estimation from Biased RNA-Seq Reads
  CEM is an algorithm to assemble transcripts and estimate their expression levels from RNA-Seq reads.
  
  
• MaLTA – Transcriptome Assembly and Quantification from Ion Torrent RNA-Seq data
  MaLTA is a method for simultaneous transcriptome assembly and quantification from Ion Torrent RNA-Seq data.
  
  
• AMOS 3.1.0 – Whole Genome Shotgun Assembler
  AMOS (AModular, Open-Source) consortium is committed to the development of open-source whole genome assembly software. The project acronym (AMOS) represents our primary goal — to produce A Modular, Open-Source whole genome assembler.Open-source so that everyone is welcome to contribute and help build outstanding assembly tools, and modular in nature so that new contributions can be easily inserted into an existing assembly pipeline. This modular design will foster the development of new assembly algorithms and allow the AMOS project to continually grow and improve in hopes of eventually becoming a widely accepted and deployed assembly infrastructure. In this sense, AMOS is both a design philosophy and a software system.
  
  
• AutoEditor 1.20 – Automated Correction of Genome Sequence Errors
  AutoEditor is a tool for correcting sequencing and basecaller errors using sequence assembly and chromatogram data. On average AutoEditor corrects 80% of erroneous base calls, with an accuracy of 99.99%.This in turn improves the overall accuracy of genome sequences and facilitates the use of these sequences for polymorphism discovery.
  
  
• SAGE – String Graph Assembly of GEnomes
  SAGE is a new string-overlap graph-based de novo genome assembler.
  
  
• Omega 1.0.2 – Overlap-graph de novo Assembler for Metagenomics
  Omega is a software for assembling and scaffolding Illumina sequencing data of microbial communities.
  
  
• TCGA-Assembler 1.0.3 – Open-Source Software for Retrieving and Processing TCGA Data
  TCGA-Assembler is an open-source, freely available tool that automatically downloads, assembles, and processes public The Cancer Genome Atlas (TCGA) data, to facilitate downstream data analysis by relieving investigators from the burdens of data preparation.
  
  
• SAMMate 2.7.4 / assemblySAM 1.1 – Processing Short Read Alignments in SAM/BAM format / RNA-Seq Assembly and Analysis
  

  SAMMate is an open source GUI software suite to process RNA-Seq data. It is composed of two modules: assemblySAM and SAMMate.

  assemblySAM employs a novel method to localize and assemble RNA-seq reads into RNA transcript sequences.
  
  

• StringGraph beta – String Graph Construction Using Incremental Hashing
  StringGraph is a novel, hash based method for constructing the string graph.
  
  
• MindTheGap 1.0.0 – Detection and Assembly of Insertion Variants
  MindTheGap is a software that performs detection and assembly of DNA insertion variants in NGS read datasets with respect to a reference genome.
  
  
• MetAMOS 1.5rc3 – Metagenomic Assembly pipeline for AMOS
  MetAMOS is an open source and modular metagenomic assembly and analysis pipeline. MetAMOS represents an important step towards fully automated metagenomic analysis, starting with next-generation sequencing reads and producing genomic scaffolds, open-reading frames and taxonomic or functional annotations.
  
  
• TIGER – DNA Sequence Assembly
  Tiger is a novel de novo assembly framework  which adapts to available computing resources by iteratively decomposing the assembly problem into sub-problems.
  
  
• AlignGraph – Secondary de novo Genome Assembly guided by closely related References
  AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.
  
  
• scarpa 0.241 – Scaffolding Reads with Practical Algorithms
  Scarpa is a stand-alone scaffolding tool for NGS data. It can be used together with virtually any genome assembler and any NGS read mapper that supports SAM format. Other features include support for multiple libraries and an option to estimate insert size distributions from data.
  
  
• VGA v1 – Viral Genome Assembler
  VGA is a method for accurate assembly of a heterogeneous viral population consisting of individuals viral genomes (also known as quasi-species).
  
  
• Genomix 0.2.11 – Parallel Genome Assembly using Hyracks
  Genomix is a parallel genome assembly system built from the ground up with scalability in mind. It can assemble large and high-coverage genomes from fastq files in a short time and produces assemblies similar to Velvet or Ray in quality.
  
  
• LACHESIS – Genome Assembly with Contact Probability Maps
  LACHESIS is method that exploits contact probability map data (e.g. from Hi-C) for chromosome-scale de novo genome assembly.
  
  
• KGBassembler 1.2 – Karyotype-based Genome Assembler for Brassicaceae Species
  KGBassembler (Brassicaceae genome assembler) is a C++ based tool for assembling contigs and/or scaffolds to full chromosomes based on the karyotype maps of Brassicaceae species and without the need of genetic and physical maps.
  
  
• AutoAssemblyD 0.1 – Graphical User Interface system for several Genome Assembler
  The AssemblyD is a software which performed the local and remote genome assembly by several assemblers based on an XML Template which can replace the large command lines required by most assemblers.
  
  
• SR-ASM – DNA Assembly of the Short Sequences coming from 454 sequencer
  SR-ASM (Short Reads ASseMbly) algorithm is designed for DNA assembly of the short sequences coming from 454 sequencers.
  
  
• YASRA 2.33 – Yet Another Short Read Assembler
  YASRA performs comparative assembly of short reads using a reference genome, which can differ substantially from the genome being sequenced.
  
  
• PRICE 1.2 – de novo Genome Assembler
  PRICE (Paired-Read Iterative Contig Extension) is a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other 
  
  
• ALE 20130717 – Assembly Likelihood Estimator
  ALE is a probabalistic framework for determining the likelihood of an assembly given the data (raw reads) used to assemble it. It allows for the rapid discovery of errors and comparisons between similar assemblies.
  
  
• SSPACE 3.0 – Scaffolding pre-assembled Contigs using Paired-read data
  SSPACE (SSAKE-based Scaffolding of Pre-Assembled Contigs after Extension) is a stand-alone program for scaffolding pre-assembled contigs using paired-read data. It is unique in offering the possibility to manually control the scaffolding process. By using the distance information of paired-end and/or matepair data, SSPACE is able to assess the order, distance and orientation of your contigs and combine them into scaffolds. Currently we offer this as a command-line tool in Perl. The input data is given by pre-assembled contig sequences (FASTA) and NGS paired-read data (FASTA or FASTQ). The final scaffolds are provided in FASTA format.
  
  
• IMAGE 2.4.1 – Iterative Mapping and Assembly for Gap Elimination
  IMAGE ( Iterative Mapping and Assembly for Gap Elimination) is a software designed to close gaps in any draft assembly using Illumina paired end reads. IMAGE is best described in several stages: aligning of Illumina reads at contig ends; local assembly of reads into new contigs; reference contigs are extended or merged; iterating the whole process to extend and merge more contigs.
  
  
• ATLAS GapFill 2.2 – Deals with the Repetitive Gap Assembly problem
  ATLAS GapFill deals with the repetitive gap assembly problem by using the unique gap-flanking sequences to group reads and convert the problem to a local assembly task. Localizing the assembly reduces the numbers of repeats in the assembly, allows more data to be incorporated, and allows for gaps to be filled.
  
  
• Atlas 2005 – Whole Genome Assembly Suite
  Atlas is a collection of software tools to facilitate the assembly of large genomes from whole genome shotgun reads, or a combination of whole genome shotgun reads and BAC or other localized reads.
  
  
• CGAL 0.9.6b – Computing Genome Assembly Likelihoods
  CGAL is a tool for computing genome assembly likelihoods. It computes the likelihood of reads with respect to the assembly and a statistical model which can be used as a metric for evaluating assemblies.
  
  
• Fermi 1.1 – WGS de novo Assembler based on the FMD-index for large Genomes
  Fermi is a de novo assembler for Illumina reads from whole-genome short-gun sequencing. It also provides tools for error correction, sequence-to-read alignment and comparison between read sets. It uses the FMD-index, a novel compressed data structure, as the key data 
  
  
• PASHA 1.0.10 – Parallelized Short Read Assembly
  PASHA is a parallel short read assembler for large genomes using de Bruijn graphs. Taking advantage of both shared-memory multi-core CPUs and distributed-memory compute clusters, PASHA has demonstrated its potential to perform high-quality de-novo assembly of large genomes in reasonable time with modest computing resources. Our evaluation using three small real paired-end datasets shows that PASHA is able to produce better assemblies with comparable genome coverage and mis-assembly rates compared to three leading assemblers: Velvet, ABySS and SOAPdenovo. Moreover, PASHA achieves the fastest speed for all three datasets on a single CPU.
  
  
• XGenovo – Extended Genovo Metagenomic Assembler by Incorporating Paired-End Information
  XGenovo (Extended Genovo) is an extended genovo metagenomic assembler by incorporating paired-end information
  
  
• MetaVelvet 1.2.01 / MetaVelvet-SL – An Extension of Velvet Assembler to de novo Metagenomic Assembly / utilizing Supervised Learning
  MetaVelvet is an extension of Velvet assembler to de novo metagenome assembly from short sequence reads
  
  
• Edena v3.131028 – De Novo Short Reads Assembler
  Edena is an assembler dedicated to process the millions of very short reads produced by the Illumina Genome Analyzer
  
  
• ConPADE 1.00 – Contig Ploidy and Allele Dosage Estimation
  ConPADE is a tool used to estimate contig ploidy and allele dosage in polyploid genome assemblies.
  
  
• ELOPER 1.2 – Elongation of Paired-end Reads for de novo Assembly
  ELOPER is a pre-processing tool for pair-end sequences that produces a better read library for assembly programs.
  
  
• Oases 0.2.08 – De novo Transcriptome Assembler for very short reads
  Oases designed to heuristically assemble RNA-seq reads in the absence of a reference genome, across a broad spectrum of expression values and in presence of alternative isoforms. It achieves this by using an array of hash lengths, a dynamic filtering of noise, a robust resolution of alternative splicing events, and the efficient merging of multiple assemblies. It was tested on human and mouse RNA-seq data and is shown to improve significantly on the transABySS and Trinity de novo 
  
  
• SOPRA 1.4.6 – Statistical Optimization of Paired Read Assembly
  SOPRA is an assembler for mate pair/paired-end reads from high throughput sequencing platforms, e.g. Illumina and SOLiD.
  
  
• hapAssembly – Haplotype Assembly from Whole-Genome Sequence Data
  hapAssembly  beats the previous best for the important Haplotype Assembly Problem. It is an approach to finding optimal solutions for the haplotype assembly problem under the minimum-error-correction (MEC) model.
  
  
• PBSIM 1.0.3 – PacBio Reads Simulator
  PacBio sequencers produced two types of characteristic reads: CCS (short and low error rate) and CLR (long and high error rate), both of which could be useful for de novo assembly of genomes. PBSIM simulates those PacBio reads by using either a model-based or sampling-based simulation.
  
  
• SIS – Generate Draft Genome Sequence Scaffolds for Prokaryotes
  SIS (Scaffolds from Inversion Signatures)is a new easy-to-use tool to generate contig scaffolds
  
  
• NN50-calculator 0.5 – Evaluate the Correctness of Genome Assemblies
  NN50-calculator (Normalized N50 calculator) is a tool for evaluating the correctness of genome assemblies.
  
  
• Baa.pl 0.20 – use BLAT to ASSESS an ASSEMBLY
  Baa.pl is a simple script that parses the output of a BLAT run of a transcriptome vs. a genome assembly.
  
  
• hapsembler 2.21 – Haplotype-specific Genome Assembly Toolkit
  Hapsembler is a haplotype-specific genome assembly toolkit that is designed for genomes that are rich in SNPs and other types of polymorphism. Hapsembler can be used to assemble reads from a variety of platforms including Illumina and Roche/454.
  
  
• ViSpA 02 – Viral Spectrum Assembler
  ViSpA (Viral Spectrum Assembling) implements a novel viral assembling and frequency estimation methods. This software uses a simple error correction, viral variants assembling based on maximum-bandwidth paths in weighted read graphs and frequency estimation via Expectation Maximization on all reads.
  
  
• VelvetOptimiser 2.2.5 – Automatically Optimise Velvet Assembler Parameters
  VelvetOptimiser is a multi-threaded Perl script for automatically optimising the three primary parameter options (K, -exp_cov, -cov_cutoff) for the Velvet de novo sequence assembler.
  
  
• Assemblet 0.1 – Antigenic Variation Assembler
  Assemblet is a short read assembler for assembling antigenic variant sequences in bacteria.
  
  
• VelvetK 20120606 – Find a reasonable K-mer size to Assemble Genome Reads with Velvet
  VelvetK can estimate the best k-mer size to use for your Velvet de novo assembly. It needs two inputs: the estimated genome size, and all your sequence read files. The genome size can be supplied as as a number (eg. 3.5M) or as a FASTA file of a closely related genome.
  
  
• VAGUE 1.0.5 – Velvet Assembler Graphical User Environment
  VAGUE (Velvet Assembler Graphical Front End) is a GUI for the Velvet de novo assembler.
  
  
• Transcriptome Assembler – Transcriptome Assembly used in RNA-seq of 16 Mammalian Species
  Transcriptome Assembler is a software for transcriptome assembly used in RNA-seq of 16 mammalian species.
  
  
• BioSequenceAssembler 2.0 – Microsoft Research Sequence Assembler
  BioSequenceAssembler is intended for use by biologist and laboratory technicians who are responsible for managing next-generation genomic sequencing data for alignment, assembly, and/or BLAST identification.
  
  
• BugBuilder – Microbial Genome Assembly
  BugBuilder is a pipeline for the automated assembly and annotation of microbial genomes from high-throughput sequence data. It is configurable so as not to be tied to any assembler or scaffolder, and is designed to run in a cluster environment facilitating high-throughput processing of genomes.
  
• MAXIMUS 0.2 – Hybrid Reference and de novo Assembly pipeline
  MAXIMUS is a genome assembly pipeline which takes the best out of multiple reference assemblies and de novo assembly. The benefits of this approach include better assembled repetitive regions, less gaps and higher accuracy for the resultant assembly.
  
  
• ISSAKE – Short Read Sequence Assembly
  iSSAKE (immuno-SSAKE) is a sequencing approach and assembly software for profiling T-cell metagenomes using short reads from the massively parallel sequencing platforms.
  
  
• IDBA / IDBA-UD 1.1.1 – De Bruijn Graph De Novo Assembler with Highly Uneven Sequencing Depth
   IDBA is a practical iterative De Bruijn Graph De Novo Assembler for sequence assembly in bioinfomatics. Most assemblers based on de Bruijn graph build a de Bruijn graph with a specific k to perform the assembling task. For all of them, it is very crucial to find a specific value of k. If k is too large, there will be a lot of gap problems in the graph. If k is too small, there will a lot of branch problems. IDBA uses not only one specific k but a range of k values to build the iterative de Bruijn graph. It can keep all the information in graphs with different k values. So, it will perform better than other assemblers.
  
  
• est2assembly 1.13 – Assembly and Annotation of Transcriptomes for any Species
  The est2assembly platform is the only platform for standardising transcriptome projects: go from raw trace files to an annotated GBrowse interface driven by the Seqfeature database. It accepts both Sanger and 454 sequencing technology for a denovo assembly, annotation and data mining of EST data.
  
  
• Curtain 0.2.3 beta – Assembling large Genomes from Short Read Sequences
  Curtain is an assembler of next generation sequence. Curtain is a Java wrapper around next-generation assemblers such as Velvet, which allows the incremental introduction of read-pair information into the assembly process.
  
  
• PEAssember 1.2 – A de novo Genome Assembler
  PEAssember is a parallel de novo genome assembler for small – mid sized genomes.
  
  
• Contrail 0.8.2 – Assembly of Large Genomes using Cloud Computing
  Contrail is a Hadoop based genome assembler for assembling large genomes in the clouds
  
  
• BEAP 0.6 beta – Blast Extension and Assembly Program
  The BEAP is a computer program that uses a short starting DNA fragment, often a EST or partial gene segment, as “primer”, to recursively blast nucleotide databases in an attempt to obtain all sequences that overlaps, directly or indirectly, with the “primer” therefore help to “extend” the length of the original sequence for constructing a “full length” sequence for functional analysis, or at least to obtain neighboring regions of the segment for SNP discovery and linkage disequilibrium 
  
  
• BRANCH 1.8.1 – boosting RNA-Seq Assemblies with Partial or related Genomic Sequences
  BRANCH is a software that extends de novo transfrags and identifies novel transfrags with DNA contigs or genes of close related species. BRANCH discovers novel exons first and then extends/joins fragmented de novo transfrags, so that the resulted transfrags are more complete.
  
  
• Quake 0.3.5 – Detect & Correct Substitution Sequencing Errors in WGS Data Sets
  

  Quake is a package to correct substitution sequencing errors in experiments with deep coverage (e.g. >15X), specifically intended for Illumina sequencing reads. Quake adopts the k-mer error correction framework, first introduced by the EULER genome assembly package. Unlike EULER and similar progams, Quake utilizes a robust mixture model of erroneous and genuine k-mer distributions to determine where errors are located. Then Quake uses read quality values and learns the nucleotide to nucleotide error rates to determine what types of errors are most likely. This leads to more corrections and greater accuracy, especially with respect to avoiding mis-corrections,  which create false sequence unsimilar to anything in the original genome sequence from which the read was taken.

• Velvet 1.2.10 – Sequence Assembler for Very Short Reads
  Velvet is a de novo genomic assembler specially designed for short read sequencing technologies, such as Solexa or 454.Velvet currently takes in short read sequences, removes errors then produces high quality unique contigs. It then uses paired-end read and long read information, when available, to retrieve the repeated areas between contigs.
  
  
• Lucy 2.20 – DNA Sequence Quality & Vector Trimming
  Lucy has been used for several years to clean sequence data from automated DNA sequencers prior to sequence assembly and other downstream uses.  The quality trimming portion of lucy makes use of phred quality scores, such as those produced by many automated sequencers based on the Sanger sequencing method.  As such, lucy’s quality trimming may not be appropriate for sequence data produced by some of the new “next-generation” sequencers.
  
  
• iAssembler 1.3.2 – de novo Assembly of Roche-454/Sanger Transcriptome Sequences
  iAssembler is a standalone package to assemble ESTs generated using Sanger and/or Roche-454 pyrosequencing technologies into contigs.
  
  
• GAEMR 1.0.1 – Assembly Analysis Framework
  GAEMR (Genome Assembly Evaluation Metrics and Reportin) is a complete genome analysis package that helps you evaluate and report on a genome assembly’s completeness, correctness, and contiguity.
  
  
• PyroCleaner 1.3 – Clean 454 Pyrosequencing Reads in order to ease the Assembly Process
  The pyrocleaner is intended to clean the reads included in the sff file in order to ease the assembly process. It enables filtering sequences on different criteria such as length, complexity, number of undetermined bases which has been proven to correlate with poor quality and multiple copy reads. It also enables to clean paired-ends sff files and generates on one side a sff with the validated paired-ends and on the other the sequences which can be used as shotgun reads.
  
  
• SLiQ – Simple linear Inequalities based Mate-Pair reads Filtering and Scaffolding
  SLIQ , a set of simple linear inequalities derived from the geometry of contigs on the line, can be used to predict the relative positions and orientations of contigs from individual mate pair reads and thus produce a contig digraph.
  
  
• rectangles 2.0 – Rectangle Graph for Repeat Resolution in Genome Assembly
  rectangles is an ultimate tool for resolving repeats in genome assemblies.
  
  
• Arachne 4.6233 – Whole-genome Shotgun Assembler
  ARACHNE is a program for assembling data from whole genome shotgun sequencing experiments. It was designed for long reads from Sanger sequencing technology, and has been used extensively to assemble many genomes, including many that are large and highly repetitive.
  
  
• Reconciliator 2.0 – The tool for Merging Assemblies
  Reconciliator is the tool for merging assemblies.
  
  
• PhrapUMD 2 – Modified version of Phrap
  Phrap UMD consists of the UMD Trimmer, UMD Overlapper and a modified version of Phrap.It is capable of assembling data downloaded directly from the NCBI Trace Archive. The pipeline runs in 3 stages:  first the vector ends of the reads are examined and the vector is found.  Then the reads are trimmed for vector and quality.  After that the trimmed reads afe fed into the 5-pass UMD Overlapper that finds the overlaps, corrects the base caller errors and performs additional trimming if necessary.  After the overlaps are produced, the trimmed and error-corrected reads and overlaps are input into the modified version of Phrap, whichonly puts the reads together if they overlap according to the list of overlaps produced by the UMD Overlapper.
  
  
• DNA Dragon 1.5.6 build1 – DNA Sequence Contig Assembler Software
  DNA Dragon Contig Assembler assembles sequences, trace data (ABI, SCF, AB1), Illumina and Roche 454 flowgrams into contigs. It is a very fast and accurate DNA sequence assembly software. The DNA sequences are assembled into contigs and a direct comparision of trace date with nucleotide data is possible. It also allows for proofreading and base editing.
  

Perform secondary structure predictions on protein sequences.

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

Tools

• Parsnp - Core-genome alignment and analysis
• Gingr - Interactive visualization of alignments, trees and variants
• HarvestTools - Archiving and postprocessing

Citation

Treangen TJ, Ondov BD, Koren S, Phillippy AM. The Harvest suite for rapid core-genome alignment and visualization of thousands of intraspecific microbial genomes. Genome Biology, 15 (11), 1-15 [PDF]

Address of the bookmark: http://harvest.readthedocs.io/en/latest/index.html

Address of the bookmark: https://chunlab.wordpress.com/tetra-nucleotide-analysis/

To read the manual, please click the link https://askarbek-orakov.github.io/ASAR/

Address of the bookmark: https://github.com/Askarbek-orakov/ASAR

Address of the bookmark: https://github.com/reubwn/hgt

https://bio7.org/about/

Address of the bookmark: https://bio7.org/home-2/

More at https://dahak-metagenomics.github.io/dahak/

Address of the bookmark: https://github.com/dahak-metagenomics/dahak