https://academic.oup.com/nar/article/47/11/e63/5377471

Address of the bookmark: https://github.com/linzhi2013/MitoZ

1. Merge re-sequenced FastQ files (cat)
2. Read QC (FastQC)
3. Adapter trimming (fastp)
4. Removal of host reads (Kraken 2; optional)
5. Variant calling
   1. Read alignment (Bowtie 2)
   2. Sort and index alignments (SAMtools)
   3. Primer sequence removal (iVar; amplicon data only)
   4. Duplicate read marking (picard; optional)
   5. Alignment-level QC (picard, SAMtools)
   6. Genome-wide and amplicon coverage QC plots (mosdepth)
   7. Choice of multiple variant calling and consensus sequence generation routes (iVar variants and consensus; default for amplicon data || BCFTools, BEDTools; default for metagenomics data)
      • Variant annotation (SnpEff, SnpSift)
      • Consensus assessment report (QUAST)
      • Lineage analysis (Pangolin)
      • Clade assignment, mutation calling and sequence quality checks (Nextclade)
      • Individual variant screenshots with annotation tracks (ASCIIGenome)
   8. Intersect variants across callers (BCFTools)
6. De novo assembly
   1. Primer trimming (Cutadapt; amplicon data only)
   2. Choice of multiple assembly tools (SPAdes || Unicycler || minia)
      • Blast to reference genome (blastn)
      • Contiguate assembly (ABACAS)
      • Assembly report (PlasmidID)
      • Assembly assessment report (QUAST)
7. Present QC and visualisation for raw read, alignment, assembly and variant calling results (MultiQC)

Using the reference sequence dictionary (*.dict), it also creates some empty BAM files if no sam record was found for a chromosome. A pair of 'mock' SAM-Records can also be added to those empty BAMs to avoid some tools (like samtools) to crash.

Usage

java -jar splitbam.jar -p OUT/__CHROM__/__CHROM__.bam -R ref.fasta (bam|sam|stdin)

Options

• -h help; This screen.
• -R (indexed reference file) REQUIRED.
• -u (unmapped chromosome name): default:Unmapped
• -e | --empty : generate EMPTY bams for chromosome having no read mapped
• -m | --mock : if option '-e', add a mock pair of sam records to the empty bam
• -p (output file/bam pattern) REQUIRED. MUST contain __CHROM__ and end with .bam
• -s assume input is sorted.
• -x | --index create index.
• -t | --tmp (dir) tmp file directory
• -G (file) chrom-group file (see below)

Address of the bookmark: https://code.google.com/archive/p/jvarkit/wikis/SplitBam.wiki

Our work is published in Scientific Reports:

Ye, C. et al. DBG2OLC: Efficient Assembly of Large Genomes Using Long Erroneous Reads of the Third Generation Sequencing Technologies. Sci. Rep. 6, 31900; doi: 10.1038/srep31900 (2016).

http://www.nature.com/articles/srep31900

The manual can be downloaded from:

https://github.com/yechengxi/DBG2OLC/raw/master/Manual.docx

To use precompiled versions,please go to:

https://github.com/yechengxi/DBG2OLC/tree/master/compiled

Address of the bookmark: https://github.com/yechengxi/DBG2OLC

Input

Jabba takes as input a concatenated de Bruijn graph and a set of sequences:

the de Bruijn graph should appear in fasta format with 1 entry per node, the meta information should be in the format:
>NODE
the set of sequences should be in fasta or fastq format. These sequences will be corrected (e.g. PacBio reads). The corrections will be written to a file Jabba fasta.
The output is a file in fasta format with corrections of the long reads, and additionally a file in the input format containing uncorrected reads.

https://github.com/biointec/jabba/wiki

https://almob.biomedcentral.com/articles/10.1186/s13015-016-0075-7

Address of the bookmark: https://github.com/biointec/jabba

http://www.gigasciencejournal.com/content/2/1/10/abstract

http://blogs.nature.com/news/2013/07/genome-assembly-contest-prompts-soul-searching.html

http://assemblathon.org/post/44431915644/feedback-and-analysis-of-the-assemblathon-2-p

KisSplice is not a full-length transcriptome assembler. This means that it will output the variable regions of the transcripts, not reconstruct them entirely.

KisSplice comes as a workflow, with several possible post-treatments meant to facilitate the analysis of the results. The choice of the post-treatment depends on the availability of a reference genome/transcriptome and on the need to perform a differential analysis, as summarised in the following table.

Address of the bookmark: http://kissplice.prabi.fr/

Computational methods used by the Shasta assembler include:

• Using a run-length representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.
• Using in some phases of the computation a representation of the read sequence based on markers, a fixed subset of short k-mers (k ≈ 10).

More at https://chanzuckerberg.github.io/shasta/index.html

Address of the bookmark: https://github.com/chanzuckerberg/shasta