• Your file must be plain text.
• Your data values must be non-negative integers.
• Data must be space-separated (one or more tab or space, which will be collapsed).
• No two rows or columns may have the same name.
• Column and row names must begin with a letter (e.g. 'A', 'A0', 'A-0') and can only contain letters, numbers and _. No punctuation!
• Maximum row + column total is 150 — if exceeded, rows and columns are limited to 75.
• If you are using order, size and color rows/columns in combination they must appear in that order.

Need help? Post questions to the Circos Google Group.

http://mkweb.bcgsc.ca/tableviewer/visualize/

Address of the bookmark: http://mkweb.bcgsc.ca/tableviewer/visualize/

Address of the bookmark: http://sybil.sourceforge.net/

Address of the bookmark: http://wishart.biology.ualberta.ca/cgview/

• exteremely fast (17 CPU hours for whole Human x Mouse genome (with 40 nodes: 35 wall minutes), or 8 mammals in 21 CPU hours (42 wall minutes))
• scalable (Arbitrarily parallelizable across multiple nodes using MPI)
• memory efficient. (Even a single node with 16GB of ram can handle over 1Gbp of sequence)
• unlimited by pattern length or selection
• repeat tolerant

Address of the bookmark: http://murasaki.dna.bio.keio.ac.jp/wiki/index.php?Murasaki

Address of the bookmark: http://www.cbcb.umd.edu/software/phymm/

Address of the bookmark: http://eforge.cs.ucl.ac.uk/eFORGE.v1.2/?documentation

Run Maq Now

Follow these steps to try Maq. All you need is a reference sequence file in the FASTA format.

1. Prepare a reference sequence (ref.fasta). Better a bacterial genome.
2. Download maq, maq-data and maqview at the download page.
3. Copy maq, maq.pl and maq_eval.pl to the $PATH or to the same directory.
4. Simulate diploid reference and read sequences, map reads, call variants and evaluate the results in one go:

   maq.pl demo ref.fasta calib-30.dat
   

   where calib-30.dat is contained in maq-data.
5. View the alignment:

   cd maqdemo/easyrun;
   maqindex -i -c consensus.cns all.map;
   maqview -c consensus.cns all.map

Even for advanced maq users, running `maq.pl demo' is recommended. You may find something helpful.

Address of the bookmark: http://maq.sourceforge.net

• velvet (velveth velvetg should be in your PATH)
• R (with Sweave)
• pdflatex (usually part of TeTeX)
• ggplot2 (from R prompt type install.packages("ggplot2","proto","xtable"))
• Perl

Optional:

• BLAT or BLAST (to generate alignments against a reference genome). If using BLAT, add faToTwoBit,gfClient,gfServer to your PATH. If using BLAST, add blastall and formatdb.

Edit permute.sh to your liking, paying particular attention to the kmer, cvCut, expCov, and other flags

To Run:

1. perl fastaAllSize mysequences.fa > mysequences.stat or gunzip -c mysequences.fa.gz | fastaAllSize > mysequences.stat Substitute fastqAllSize for fastq files.
2. ./permute.sh mysequences (leave out the .fa)

https://github.com/leipzig/standardized-velvet-assembly-report

Address of the bookmark: https://github.com/leipzig/standardized-velvet-assembly-report

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

The source code can be downloaded here. 

If you use E-MEM, please cite:

• N. Khiste, L. Ilie, E-MEM: Efficient computation of Maximal Exact Matches for very large genomes, Bioinformatics 31(4) (2015) 509 -- 514.

For any questions, please contact Lucian Ilie: ilie@uwo.ca 

Address of the bookmark: http://www.csd.uwo.ca/~ilie/E-MEM/