Structural variants presentation by

Jan Korbel

European Molecular Biology Laboratory (EMBL) Heidelberg Genome Biology Research Unit

Reference: 

https://www.genome.gov/pages/research/der/1000genomesprojecttutorials/structuralvariants-jankorbel.pdf

Address of the bookmark: https://www.nature.com/articles/srep20802

[Download software package (includes the manual)] (you will be directed first to a registration page and we would very much appreciate if you register) 
[Download manual] 
[Download software note from Molecular Ecology Notes 4: 137-138 (2004)]

To use the UNIX versions, unzip and untar the files in an appropriate directory using

gunzip filename.tar.gz; tar xvf filename.tar

where "filename.tar.gz" is the downloaded file. Winzip will unzip the Windows version. Run the program by typing

./distruct

in UNIX or

distruct

from a Dos prompt in Windows. It will produce a figure using the data that are represented in the Central/South Asia K=5 plot in Science 298: 2381-2385 (2002).

Please send comments or problems with distruct to Noah Rosenberg.

October 15, 2014 — Users of Distruct may also find CLUMPP and CLUMPAK of interest.

Address of the bookmark: https://rosenberglab.stanford.edu/distruct.html

https://bmcgenomics.biomedcentral.com/articles/10.1186/s12864-020-6568-2

Address of the bookmark: https://github.com/HuffordLab/GenomeQC

• A compiled program delivering high performance analyses
• Supports FASTA/FASTQ files, also Gzip compressed
• A growing collection of handy utilities, also for quick inspection of the datasets

Can be easily installed via conda:

conda install -c bioconda seqfu

Address of the bookmark: https://telatin.github.io/seqfu2/

This also includes:

• A2Amapper: ATAC, Assembly to Assembly Comparision tool:
  • Comparative mapping between two genome assemblies (same species), or between two different genomes (cross species).

• Sim4db:
  • Spliced alignment of cDNA and genomic sequences, from the same (sim4) or related (sim4cc) species. Optimized for high-throughput batched alignment.

• LEAFF:
  • LEAFF (ahem, Let's Extract Anything From Fasta) is a utility program for working with multi-fasta files. In addition to providing random access to the base level, it includes several analysis functions.

• Meryl:
  • An out-of-core k-mer counter. The amount of sequence that can be processed for any size k depends only on the amount of free disk space.

Address of the bookmark: https://help.rc.ufl.edu/doc/Kmer

Main features of YASS are:

• multiple, possibly overlapping seeds and a new hit criterion to ensure a good sensitivity/selectivity trade-off
• transition-constrained spaced seeds to improve sensitivity (transition mutations are purine to purine [A<->G] or pyrimidine to pyrimidine [C<->T])
• using different scoring schemes with bit-score and E-value evaluated according to the sequence background frequencies
• parameterizable output filter for low complexity repeats
• reporting of various alignment statistical parameters (mutation bias along triplets, transition/transversion)
• post-processing step to group gapped alignments

Address of the bookmark: http://bioinfo.lifl.fr/yass/

Mauve has been developed with the idea that a multiple genome aligner should require only modest computational resources. It employs algorithmic techniques that scale well in the lengths of sequences being aligned. For example, a pair of Y. pestis genomes can be aligned in under a minute, while a group of 9 divergent Enterobacterial genomes can be aligned in a few hours. However, the current algorithm’s compute time (progressiveMauve) scales cubically in the number of genomes to align, making it unsuitable for datasets containing more than 50-100 bacterial genomes.

Address of the bookmark: http://darlinglab.org/mauve/mauve.html

FSA brings the high accuracies previously available only for small-scale analyses of proteins or RNAs to large-scale problems such as aligning thousands of sequences or megabase-long sequences. FSA introduces several novel methods for constructing better alignments:

• FSA uses machine-learning techniques to estimate gap and substitution parameters on the fly for each set of input sequences. This "query-specific learning" alignment method makes FSA very robust: it can produce superior alignments of sets of homologous sequences which are subject to very different evolutionary constraints.
• FSA is capable of aligning hundreds or even thousands of sequences using a randomized inference algorithm to reduce the computational cost of multiple alignment. This randomized inference can be over ten times faster than a direct approach with little loss of accuracy.
• FSA can quickly align very long sequences using the "anchor annealing" technique for resolving anchors and projecting them with transitive anchoring. It then stitches together the alignment between the anchors using the methods described above.
• The included GUI, MAD (Multiple Alignment Display), can display the intermediate alignments produced by FSA, where each character is colored according to the probability that it is correctly aligned (see the picture and movie at the top of the page).

You can see more information on the FAQ. 

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