BOL: Related items

ReConPlot: an R package for the visualization and interpretation of genomic rearrangements

LEGE — Thu, 14 Dec 2023 12:33:19 -0600

ReConPlot (REarrangement and COpy Number PLOT), an R package that provides functionalities for the joint visualization of SCNAs and SVs across one or multiple chromosomes. ReConPlot is based on the popular ggplot2 package, thus allowing customization of plots and the generation of publication-quality figures with minimal effort.

Address of the bookmark: https://academic.oup.com/bioinformatics/article/39/12/btad719/7460198?login=false

SATSUMA : Highly sensitive whole-genome synteny alignments.

Jit — Fri, 13 May 2016 05:25:26 -0500

Satsuma is a whole-genome synteny alignment program. It takes two genomes, computes alignments, and then keeps only the parts that are orthologous, i.e. following the conserved order and orientation of features, such as protein coding genes, non-coding genes, or neutral sequences. Satsuma does not require any pre-processing, such as repeat masking, since it will automatically detect ambiguous mappings.

Satsuma has parallelization built-in and is designed to run on multi-core architectures. The run-time for aligning two bird-size genomes (~1.2 Gb) is around two days on 24 CPUs.

You can find the manual here.
Download the latest source code from here.
Stable versions can also be downloaded from the Broad Institute's web site.

An incomplete list of questions and answers (yes, these have really been asked by our users! Please feel free to add your own by e-mailing us) is here.

If you use Satsuma in your research, please cite:
Grabherr, M. G., Russell, P., Meyer, M., Mauceli, E., Alföldi, J., Di Palma, F., & Lindblad-Toh, K. (2010). Genome-wide synteny through highly sensitive sequence alignment: Satsuma. Bioinformatics, 26(9), 1145-51.

Tutorial at http://evomics.org/learning/genomics/satsuma/

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

Kaiju

Jit — Mon, 27 Jun 2016 11:23:04 -0500

Kaiju is a program for the taxonomic classification of metagenomic high-throughput sequencing reads. Each read is directly assigned to a taxon within the NCBI taxonomy by comparing it to a reference database containing microbial and viral protein sequences.

By default, Kaiju uses either the available complete genomes from NCBI RefSeq or the microbial subset of the non-redundant protein database nr used by NCBI BLAST, optionally also including fungi and microbial eukaryotes.

Kaiju translates reads into amino acid sequences, which are then searched in the database using a modified backward search on a memory-efficient implementation of the Burrows-Wheeler transform, which finds maximum exact matches (MEMs), optionally allowing mismatches in the protein alignment. The search can process up to millions of reads per minute using, for example, only 10 GB RAM with a protein database comprising 4821 microbial genomes. Kaiju can also be used for querying any other protein database without taxonomic classification, using either protein or nucleotide queries.

Kaiju is described in Menzel, P. et al. (2016) Fast and sensitive taxonomic classification for metagenomics with Kaiju. Nat. Commun. 7:11257 (open access).

Address of the bookmark: http://kaiju.binf.ku.dk/

FOGSAA: Fast Optimal Global Sequence Alignment Algorithm

Jit — Fri, 08 Dec 2017 14:41:08 -0600

Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.

Address of the bookmark: http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm

Sequence Tube Maps: displays multiple genomic sequences in the form of a tube map

Jit — Wed, 11 Mar 2020 01:12:06 -0500

A JavaScript module for the visualization of genomic sequence graphs. It automatically generates a "tube map"-like visualization of sequence graphs which have been created with vg. (https://github.com/vgteam/vg)

Link to working demo: https://vgteam.github.io/sequenceTubeMap/

Address of the bookmark: https://github.com/vgteam/sequenceTubeMap

NCBIBLAST+ 2.14.1 now available

Neel — Wed, 30 Aug 2023 02:36:13 -0500

#NCBIBLAST+ 2.14.1 now available with improved documentation, faster and more reliable database downloads, and some bug fixes.

Check out the changes they made.

They added the cleanup-blastdb-volumes.py script to remove unused BLAST database volumes. Read the documentation here.

They also switched the protocol from ftp to https to access BLAST databases for increased performance and reliability when downloading data from the NCBI with the update_blastdb.pl script.

And fixed a few bugs related to downloading data from the NCBI, and mt_mode crashing blastn and blastx.

Check out the release notes.

Download BLAST+ 2.14.1

Questions or comments? Please write the BLAST help desk.

More info and download: https://blast.ncbi.nlm.nih.gov/doc/blast-news/2023-BLAST-News.html

PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool

Jit — Fri, 01 Dec 2017 04:10:54 -0600

PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.

Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.

PLAST stands for Parallel Local Sequence Alignment Search Tool and is was published in BMC Bioinformatics.

PLAST is a general purpose sequence comparison tool providing the following benefits:

PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),
Reduces the processing time of sequences comparisons while providing highest quality results,
Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),
Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,
Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.

https://plast.inria.fr/

Address of the bookmark: https://plast.inria.fr/

Ancestral sequence reconstruction steps !

Surabhi Chaudhary — Fri, 18 May 2018 08:28:26 -0500

Ancestral sequence reconstruction (ASR) – also known as ancestral gene/sequence reconstruction/resurrection – is a technique used in the study of molecular evolution. The method consists of the synthesis of an ancestral gene and expression of the corresponding ancestral protein. The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl. Some early efforts were made in the eighties-nineties, led by the laboratory of Steven A. Benner, showing the potential of this technique – one that only started to be fulfilled in the post-genomic era. Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes. Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.

BEAST is the best way to predict the ancestral structure. but, I suggest following steps?

1- Alignments "Mafft - http://mafft.cbrc.jp/alignment/software/source.html"

mafft --maxiterate 1000 --reorder --thread 24 --genafpair Dataset.fasta > Dataset_Alig.fasta

2- Your dataset has a good phylogenetic signal, is possible to perform with Tree-Puzzle "http://www.tree-puzzle.de";

3 - This dataset which the saturation index, I perform with "http://dambe.bio.uottawa.ca/dambe.asp";

4- Has evidence of possible recombination in your dataset, the evaluate if this presence or absence, because this may to influence the grouping of clades, I perform with

---recombination

4.1- Phi-test, implemented in SplitTree4"http://www.splitstree.org", (.nex file)

4.2- GARD deployed in webserver in the DataMonkey "http://www.datamonkey.org/" - turning to the amino acid seaview -> view proteins -> save as ...) Ideally do a tree-based groups.

4.3- RDP4 for download and installation on Windows in "http://web.cbio.uct.ac.za/~darren/rdp.html"

4.4- Hyphy (Mac, Windows, Linux) in "http://hyphy.org/w/index.php/Download"

4.5- Path-o-Gen (temporal structure of a tree input file -> arquivo.tre)

These steps above, I call of pre-processing to inferences phylogenetic...

5- Perform phylogenetic tree, used Bayesian Inference with Molecular Clock, but is necessary Clock Testing:

- This step is performed with program Beast (Beauti, Beast and TreeAnnotator), and Tracer_v1.5 more FigTree to inspection.

- Tutorials: http://beast.bio.ed.ac.uk/tutorials

- Downloads: http://beast.bio.ed.ac.uk/downloads

Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore

Neel — Fri, 19 Oct 2018 08:48:43 -0500

Wtdbg2 is a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb Axolotl genome at a speed tens of times faster than CANU and FALCONwhile producing contigs of comparable base accuracy.

Address of the bookmark: https://github.com/ruanjue/wtdbg2

iRNAD: a computational tool for identifying D modification sites in RNA sequence

Abhimanyu Singh — Thu, 16 May 2019 00:20:07 -0500

iRNAD, for identifying D modification sites in RNA sequence. In this predictor, the RNA samples derived from five species were encoded by nucleotide chemical property and nucleotide density. Support vector machine was utilized to perform the classification.

http://lin-group.cn/server/iRNAD/

Address of the bookmark: http://lin-group.cn/server/iRNAD/