https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html

Address of the bookmark: https://bioinformatics-core-shared-training.github.io/cruk-summer-school-2017/Day1/Session4-seqIntro.html

Address of the bookmark: https://github.com/bcgsc/ARCS/

How to use TAREAN:

• Install a local instance of the pipeline using its source code available from bitbucket repository.
• Use  public Galaxy-based server at https://repeatexplorer-elixir.cerit-sc.cz/. The server is provided in frame of the Elixir CZ project and is maintained by CESNET and CERIT-SC. Simple registration is required to use this service.

Development of TAREAN was supported by ELIXIR CZ research infrastructure project (MEYS Grant No: LM2015047).

References

Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) – TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads. Nucleic Acids Res., doi:10.1093/nar/gkx257

Address of the bookmark: https://bitbucket.org/petrnovak/repex_tarean

Reads are simulated from both strands of a provided or randomly generated reference sequence.

Address of the bookmark: https://bitbucket.org/genomeinformatics/simlord/

• Reasons to use Deepbinner:
  • To minimise the number of unclassified reads (use Deepbinner by itself).
  • To minimise the number of misclassified reads (use Deepbinner in conjunction with Albacore demultiplexing).
  • You plan on running signal-level downstream analyses, like Nanopolish. Deepbinner can demultiplex the fast5 fileswhich makes this easier.
• Reasons to not use Deepbinner:
  • You only have basecalled reads not the raw fast5 files (which Deepbinner requires).
  • You have a small/slow computer. Deepbinner is more computationally intensive than Porechop.
  • You used a sequencing/barcoding kit other than the ones Deepbinner was trained on.

Address of the bookmark: https://github.com/rrwick/Deepbinner

Usage: perl run_rcorrector.pl [OPTIONS]
OPTIONS:
	Required
	-s seq_files: comma separated files for single-end data sets
	-1 seq_files_left: comma separated files for the first mate in the paried-end data sets
	-2 seq_files_right: comma separated files for the second mate in the paired-end data sets
	-i seq_files_interleaved: comma sperated files for interleaved paired-end data sets
	Optional
	-k INT: kmer_length (<=32, default: 23)
	-od STRING: output_file_directory (default: ./)
	-t INT: number of threads to use (default: 1)
	-trim : allow trimming (default: false)
	-maxcorK INT: the maximum number of correction within k-bp window (default: 4)
	-wk FLOAT: the proportion of kmers that are used to estimate weak kmer count threshold, lower for more divergent genome (default: 0.95)
	-ek INT: expected number of kmers; does not affect the correctness of program but affects the memory usage (default: 100000000)
	-stdout: output the corrected reads to stdout (default: not used)
	-verbose: output some correction information to stdout (default: not used)
	-stage INT: start from which stage (default: 0)
		0-start from begining(storing kmers in bloom filter) ;
		1-start from count kmers showed up in bloom filter;
		2-start from dumping kmer counts into a jf_dump file;
		3-start from error correction.

Address of the bookmark: https://github.com/mourisl/Rcorrector/

Here is an illustration of this pipeline:

Address of the bookmark: https://github.com/BGI-Qingdao/SLR-superscaffolder

mixtureS that can de novo identify bacterial strains from shotgun reads of a clonal or metagenomic sample, without prior knowledge about the strains and their variations. Tested on 243 simulated datasets and 195 experimental datasets, mixtureS reliably identified the strains, their numbers and their abundance. Compared with three tools, mixtureS showed better performance in almost all simulated datasets and the vast majority of experimental datasets.

Address of the bookmark: http://www.cs.ucf.edu/~xiaoman/mixtureS/

Address of the bookmark: https://bioinfologics.github.io/post/2018/09/17/k-mer-counting-part-i-introduction/