There are several pre-computed trees available for display, including the main Tree Of Life, described in Ciccarelli, et al., 2006. In addition to the precomputed trees, users can upload and display personal trees and data, using the 'Data upload' page or through a personal user account.

Address of the bookmark: http://itol.embl.de/

• For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.
• Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use BLAT to do this all-vs-all comparison with alignments being performed in protein space.
• Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.
• Identify cliques in this graph. These cliques are potential anchors to be used in the map.
• Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.
• The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as MAVID) to do a detailed alignment of each orthologous segment.

https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: https://www.biostat.wisc.edu/~cdewey/mercator/

With advances in Cancer Genomics, Mutation Annotation Format (MAF) is being widley accepted and used to store variants detected. The Cancer Genome Atlas Project has seqenced over 30 different cancers with sample size of each cancer type being over 200. The resulting data consisting of genetic variants is stored in the form of Mutation Annotation Format. This package attempts to summarize, analyze, annotate and visualize MAF files in an efficient manner either from TCGA sources or any in-house studies as long as the data is in MAF format. Maftools can also handle ICGC Simple Somatic Mutation format.

maftools is on bioRxiv

Please cite the below if you find this tool useful for you.

Mayakonda, A. and H.P. Koeffler, Maftools: Efficient analysis, visualization and summarization of MAF files from large-scale cohort based cancer studies. bioRxiv, 2016. doi: http://dx.doi.org/10.1101/052662

Address of the bookmark: https://github.com/PoisonAlien/maftools

http://www.bx.psu.edu/~ratan/

Address of the bookmark: http://www.bx.psu.edu/miller_lab/

To use CLgenomics, individual genome data (genome sequences + annotation details) are compiled and saved in a specially formatted file called CLG (ChunLab Genomics). Each CLG file corresponds with one bacterial genome. If multiple genomes are being considered and compared, multiple CLG files are needed. ChunLab offers >40,000 CLG files of publicly available Bacterial and Archaeal genomes.

Address of the bookmark: https://chunlab.wordpress.com/clgenomics-software/

Address of the bookmark: http://pbil.univ-lyon1.fr/software/DeCoSTAR/

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

Though the specific implementation of the idea of the rectangle graph approach is already included into the current SPAdes distribution, we're also releasing the Rectangle Graph Module (RGM) as the separate code which can be run independently of SPAdes. Although RGM differs from the current implementation of the rectangle graph approach in SPAdes, in the future we plan to integrate RGM in SPAdes. RGM can be run with other genome assemblers if they use the graph format as SPAdes files.

For more details see: Nikolay Vyahhi, Son K. Pham, Pavel Pevzner. From de Bruijn Graphs to Rectangle Graphs for Genome Assembly, Lecture Notes in Bioinformatics 7534 (2012), pp. 249-261.

Address of the bookmark: http://bioinf.spbau.ru/en/rectangles

The assembly process can be summarized as follows:

1. overlap
2. patch reads
3. overlap (again)
4. scrubbing
5. assembly graph construction and touring
6. optional read correction
7. fasta file creation

Address of the bookmark: https://github.com/schloi/MARVEL

http://gmod.org/wiki/Diya

Address of the bookmark: https://sourceforge.net/projects/diyg/