BOL: Related items

CroCo: A program to detect potential cross contaminations in HTS assembled transcriptomes using expression level quantification

Jit — Mon, 07 Jan 2019 18:17:44 -0600

CroCo is a program to detect cross contamination events in assembled transcriptomes using sequencing reads to determine the true origin of every transcripts.
Such cross contaminations can be expected if several RNA-Seq experiments were prepared during the same period at the same lab, or by the same people, or if they were processed or sequenced by the same sequencing service facility.
Our approach first determines a subset of transcripts that are suspiciously similar across samples using a pairwise BLAST procedure. CroCo then combine all transcriptomes into a metatranscriptome and quantifies the "expression level" of all transcripts successively using every sample read data (e.g. several species sequenced by the same lab for a particular study) while allowing read multi-mappings.
Several mapping tools implemented in CroCo can be used to estimate expression level (default is RapMap).
This information is then used to categorize each transcript in the following 5 categories :

clean: the transcript origin is from the focal sample.

cross contamination: the transcript origin is from an alien sample of the same experiment.

dubious: expression levels are too close between focal and alien samples to determine the true origin of the transcript.

low coverage: expression levels are too low in all samples, thus hampering our procedure (which relies on differential expression) to confidently assign it to any category.

over expressed: expression levels are very high in at least 3 samples and CroCo will not try to categorize it. Indeed, such a pattern does not correspond to expectations for cross contaminations, but often reflect highly conserved genes such as ribosomal gene, or external contamination shared by several samples (e.g. Escherichia coli contaminations).

Address of the bookmark: https://gitlab.mbb.univ-montp2.fr/mbb/CroCo

MFannot : a program for the annotation of mitochondrial and plastid genomes

Jit — Mon, 26 Aug 2019 11:47:56 -0500

MFannot is a program for the annotation of mitochondrial and plastid genomes

MFannot is a program for the annotation of mitochondrial and plastid genomes. It is a PERL wrapper around a set of diverse, external independent tools.

It makes intense use of RNA/intron detection tools including HMMER, Exonerate, Erpin and others.

http://megasun.bch.umontreal.ca/cgi-bin/mfannot/mfannotInterface.pl

Address of the bookmark: https://github.com/BFL-lab/Mfannot

IRscope: an online program to visualize the junction sites of chloroplast genomes

Neel — Wed, 25 Nov 2020 19:44:46 -0600

eMPRess, a software program for phylogenetic tree reconciliation under the duplication-transfer-loss model that systematically addresses the problems of choosing event costs and selecting representative solutions, enabling users to make more robust inferences.

Address of the bookmark: https://sites.google.com/g.hmc.edu/empress/home

seqloc 0.6

Gudiya Pal — Sun, 28 Dec 2014 12:51:29 -0600

The Bio.SeqLoc modules in seqloc are designed to represent positions and locations (ranges of positions) on sequences, particularly nucleotide sequences. My original motivation for writing these packages was handing the locations of genes in eukaryotic genomes.

Handle sequence locations for bioinformatics http://www.ingolia-lab.org/seqloc-tutorial.html

Address of the bookmark: http://www.stackage.org/snapshot/nightly-2014-12-28/package/seqloc-0.6

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/

NovelSeq: Novel Sequence Insertion Detection

Neel — Fri, 09 Jun 2017 04:31:30 -0500

The NovelSeq framework is designed to detect novel sequence insertions using high throughput paired-end whole genome sequencing data.

http://novelseq.sourceforge.net/Home

Paper at https://www.ncbi.nlm.nih.gov/pubmed/20385726

Address of the bookmark: http://novelseq.sourceforge.net/Home

ASAR: Advanced metagenomic Sequence Analysis in R

Jit — Mon, 09 Jul 2018 05:20:50 -0500

An interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.

To read the manual, please click the link https://askarbek-orakov.github.io/ASAR/

Address of the bookmark: https://github.com/Askarbek-orakov/ASAR

Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome

BioStar — Wed, 22 Jul 2020 10:11:13 -0500

We have developed the Sequence Ontology Bioinformatics Analysis (SOBA) tool to provide a simple statistical and graphical summary of an annotated genome. We envisage its use during annotation jamborees, genome comparison and for use by developers for rapid feedback during annotation software development and testing. SOBA also provides annotation consistency feedback to ensure correct use of terminology within annotations, and guides users to add new terms to the Sequence Ontology when required. SOBA is available at http://www.sequenceontology.org/cgi-bin/soba.cgi.

More at https://pubmed.ncbi.nlm.nih.gov/20494974/

Address of the bookmark: http://www.sequenceontology.org/cgi-bin/soba.cgi

ULTRA (ULTRA Locates Tandemly Repetitive Areas) : Effective Labeling of Repetitive Genomic Sequence

Abhi — Sat, 08 Jun 2024 16:03:39 -0500

ULTRA is a tool to find and annotate tandem repeats inside genomic sequence. It is able to find repeats of any length and of any period (up to a maximum period of 4000). It can find highly decayed repeats missed by other software, and it will also be able to find very large repeats in highly repetitive sequence, regardless of the size of sequence or length of repeats. ULTRA offers meaningful annotation scores and can produce annotation P-values at user request.

More at https://www.biorxiv.org/content/10.1101/2024.06.03.597269v1

Address of the bookmark: https://github.com/TravisWheelerLab/ULTRA