The arguments accepted by ScaffMatch are:

  -w) Working directory -- this is the directory where ScaffMatch files are stored. These are .sam files produced after mapping reads to contigs and the resulting scaffolds file `scaffolds.fa` fasta file;

  -c) Contig fasta file;

  -m) Command line argument with no options. It is used when .sam files are used instead of reads .fastq files. Do not use this option if you provide reads files;

  -1) (Comma separated list of) either .fastq or .sam file(s) corresponding to the first read of the read pair;

  -2) (Comma separated list of) either .fastq or .sam file(s) corresponding to the second read of the read pair;

  -i) (Comma separated list of) insert size(s) of the library(-ies);

  -s) (Comma separated list of) library(-ies) standard deviation(s) of insert size(s);

  -t) Bundle threshold. Pairs of contigs supported by number of read pairs less than the value of this argument are discarded. Optional argument, by default it is equal to 5;

  -g) Matching heuristics: use `max_weight` for Maximum Weight Matching heuristics with the Insertion step, use `backbone` for Maximum Weight Matching heuristics without the Insertion step, use `greedy` for Greedy Matching heuristics;

  -l) Log file - where to store the logs. Optional argument. By default, stdout is used.

Address of the bookmark: http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch

• paired-end (PE) and/or mate-pair libraries (NGS-based mode)
• long reads (NGS-based mode)
• synteny to the genome of some related species (reference-based mode)

Scaffolding 

In reference-based mode, pyScaf uses synteny to the genome of closely related species in order to order contigs and estimate distances between adjacent contigs.

Contigs are aligned globally (end-to-end) onto reference chromosomes, ignoring:

• matches not satisfying cut-offs (--identity and --overlap)
• suboptimal matches (only best match of each query to reference is kept)
• and removing overlapping matches on reference.

In preliminary tests, pyScaf performed superbly on simulated heterozygous genomes based on C. parapsilosis (13 Mb; CANPA) and A. thaliana (119 Mb; ARATH) chromosomes, reconstructing correctly all chromosomes always for CANPA and nearly always for ARATH (Figures in dropbox, CANPA table, ARATH table).
Runs took ~0.5 min for CANPA on 4 CPUs and ~2 min for ARATH on 16 CPUs.

Important remarks:

• Reduce your assembly before (fasta2homozygous.py) as any redundancy will likely break the synteny.
• pyScaf works better with contigs than scaffolds, as scaffolds are often affected by mis-assemblies (no de novo assembler / scaffolder is perfect...), which breaks synteny.
• pyScaf works very well if divergence between reference genome and assembled contigs is below 20% at nucleotide level.
• pyScaf deals with large rearrangements ie. deletions, insertion, inversions, translocations. Note however, this is experimental implementation!
• Consider closing gaps after scaffolding.

Address of the bookmark: https://github.com/lpryszcz/pyScaf

More at http://chibba.agtec.uga.edu/duplication/mcscan/

Address of the bookmark: http://chibba.agtec.uga.edu/duplication/mcscan/

Address of the bookmark: http://www.mgc.ac.cn/GenomeComp/

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

It was originally developed at the Wellcome Trust Sanger Institute to bundle a FASTA sequence and its quality data, but has recently become the de facto standard for storing the output of high-throughput sequencing instruments such as the Illumina Genome Analyzer.^[1]

Address of the bookmark: https://en.wikipedia.org/wiki/FASTQ_format

*The journals are not listed in any ascending, descending, or impact factors oders. 

Bioinformatics 

Journal of Computational Biology

Briefings in Bioinformatics

In Silico Biology

Structure

Protein Science

Protein Engineering

Proteomics

Nucleic Acids Research

Trends in Biotechnology

Proceedings of the National Academy of Sciences

Folding and Design

Genome Biology

Journal of Biomedical Informatics

Bioinformation

Journal of Computational Intelligence in Bioinformatics

Journal of Structural and Functional Genomics

Journal of Molecular Graphics and Modelling

Metabolic Engineering

Computers & Chemistry

Artificial Intelligence in Medicine

Journal of Biomedical Science

Artificial Intelligence

Machine Learning

Applied Bioinformatics

Applied Genomics and Proteomics

BMC Bioinformatics

Online Journal of Bioinformatics (OJB)

PSB On-Line Proceedings

Bioinformatics: Information Technology & Systems (BITS)

Data Mining and Knowledge Discovery

The EMBO Journal

Current Opinions in Structural Biology

Journal of Molecular Microbiology and Biotechnology

Nature

Nature Structural Biology

Journal of Machine Learning Research

Nature Genetics

Current Opinion in Genetics & Development

Nature Biotechnology

Trends in Biochemical Sciences

Proteins: Structure, Function, and Genetics

Nature Cell Biology

Trends in Genetics

ChemBioChem

Trends in Molecular Medicine

Journal of Molecular Modelling

Trends in Pharmacological Sciences

Drug Discovery Today

Others Free Online Full-text Journals

http://biopython.org/DIST/docs/tutorial/Tutorial.html