BOL: Related items

Curated set of ribosomal RNA (rRNA) reference sequences (targeted loci) with verifiable organism

Rahul Nayak — Sun, 23 Feb 2020 02:17:30 -0600

MCBI have a curated set of ribosomal RNA (rRNA) reference sequences (targeted loci) with verifiable organism sources and current names. This set is critical for correctly identifying and classifying prokaryotic (bacteria and archaea) and fungal samples. To provide easy access to these sequences, we recently added a separate rRNA/ITS databases section on the nucleotide BLAST page for these targeted sequences that makes it convenient to quickly identify source organisms. The new databases are:

*16S ribosomal RNA (Bacteria and Archaea)

*18S ribosomal RNA sequences (SSU) from Fungi type and reference material

*28S ribosomal RNA sequences (LSU) from Fungi type and reference material

*Internal transcribed spacer region (ITS) from Fungi type and reference material

You can also download these from the BLAST db FTP area. See the NCBI Insights post for more detail.

Useful links

-----------------

BLAST form with rRNA/ITS databases

BLAST db download

Targeted loci

If you have any questions or concerns, please contact blast-help@ncbi.nlm.nih.gov

PureCN: copy number calling and SNV classification using targeted short read sequencing

Jit — Thu, 09 Aug 2018 04:09:37 -0500

This package estimates tumor purity, copy number, and loss of heterozygosity (LOH), and classifies single nucleotide variants (SNVs) by somatic status and clonality. PureCN is designed for targeted short read sequencing data, integrates well with standard somatic variant detection and copy number pipelines, and has support for tumor samples without matching normal samples.

Author: Markus Riester [aut, cre], Angad P. Singh [aut]

Maintainer: Markus Riester

Citation (from within R, enter citation("PureCN")):

Riester M, Singh A, Brannon A, Yu K, Campbell C, Chiang D, Morrissey M (2016). “PureCN: Copy number calling and SNV classification using targeted short read sequencing.” Source Code for Biology and Medicine, 11, 13. doi: 10.1186/s13029-016-0060-z.

Address of the bookmark: http://bioconductor.org/packages/release/bioc/html/PureCN.html

AlignGraph: algorithm for secondary de novo genome assembly guided by closely related references

Manisha Mishra — Tue, 17 Apr 2018 16:21:20 -0500

AlignGraph is a software that extends and joins contigs or scaffolds by reassembling them with help provided by a reference genome of a closely related organism.

Using AlignGraph

AlignGraph --read1 reads_1.fa --read2 reads_2.fa --contig contigs.fa --genome genome.fa --distanceLow distanceLow --distanceHigh distancehigh --extendedContig extendedContigs.fa --remainingContig remainingContigs.fa [--kMer k --insertVariation insertVariation --coverage coverage --part p --fastMap --ratioCheck --iterativeMap --misassemblyRemoval --resume]

Address of the bookmark: https://github.com/baoe/AlignGraph

OrthoANI: An improved algorithm and software for calculating average nucleotide identity

Abhimanyu Singh — Wed, 12 Dec 2018 08:36:08 -0600

OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.

Address of the bookmark: https://www.ezbiocloud.net/tools/orthoani

The wavefront alignment (WFA) algorithm

BioStar — Sun, 28 Jun 2020 10:17:50 -0500

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of
homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.

Address of the bookmark: https://github.com/smarco/WFA

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

DeCoSTAR - Detection of Co-evolution

Jit — Fri, 14 Apr 2017 06:27:25 -0500

DeCoSTAR is a software which aims at reconstructing ancestral gene or genome organizations, in the form of sets of neighborhood relations -adjacencies- between pairs of ancestral genes or gene domains.
Ancestral genes or domains are deduced from reconciled gene trees in a context of birth, speciation, duplication, loss, transfer, which are either given as input or computed with the ecceTERA package, to which DeCoSTAR is integrated. DeCoSTAR constructs parsimonious scenarios of gains and breakages of adjacencies, and contains in particular all the features of previous software DeCo, DeCoLT, ArtDeCo and DeClone. It provides statistical supports on ancestral adjacencies, or the possibility to handle badly assembled genomes.
DeCoSTAR is able to reconstruct the histories of domains inside genes, including gene fusion and fission events, as well as ancestral genome structures for dozens of whole genomes from all kingdoms of life in a few minutes.

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

MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants

Jit — Tue, 28 Jan 2020 03:39:22 -0600

MALVA is able to genotype multi-allelic SNPs and indels without mapping reads

MALVA calls correctly more indels than the most widely adopted genotyping pipelines

Mapping-free approaches are as accurate as alignment-based ones, while being faster

More at https://www.sciencedirect.com/science/article/pii/S2589004219302366

https://www.sciencedirect.com/science/article/pii/S2589004219302366

Address of the bookmark: https://github.com/AlgoLab/malva

Computational resources for TE discovery and TE detection

Abhimanyu Singh — Mon, 12 Feb 2018 10:29:18 -0600

Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis.

Following are the list of resource and location for TE discovery and TE detection:

BLASTER suite http://urgi.versailles.inra.fr/development/blaster/

Censor http://www.girinst.org/censor/download.php

find_ltr http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl

FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm

HMMER http://hmmer.janelia.org/

LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/

LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html

LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7

LTR_par http://www.eecs.wsu.edu/~ananth/software.htm

MAK http://wesslercluster.plantbio.uga.edu/mak06.html

MaskerAid http://blast.wustl.edu/maskeraid/

mer-engine http://mer-engine.cshl.edu/mer-home.php

mreps http://bioinfo.lifl.fr/mreps/

PILER http://www.drive5.com/piler/

PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl

RepBase http://www.girinst.org/

RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/

RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm

RepeatMasker http://www.repeatmasker.org/

RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html

RepeatScout http://repeatscout.bioprojects.org/

repeat-match http://mummer.sourceforge.net/

REPuter http://www.genomes.de/

RetroMap http://www.burchsite.com/bioi/RetroMapHome.html

SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder

Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html

Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html

TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html

TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html

TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/

Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm

WU-BLAST http://blast.wustl.edu

SvABA: Genome-wide detection of structural variants and indels by local assembly

Abhimanyu Singh — Mon, 21 Jan 2019 17:58:56 -0600

SvABA is a method for detecting structural variants in sequencing data using genome-wide local assembly. Under the hood, SvABA uses a custom implementation of SGA (String Graph Assembler) by Jared Simpson, and BWA-MEM by Heng Li. Contigs are assembled for every 25kb window (with some small overlap) for every region in the genome. The default is to use only clipped, discordant, unmapped and indel reads, although this can be customized to any set of reads at the command line using VariantBam rules. These contigs are then immediately aligned to the reference with BWA-MEM and parsed to identify variants. Sequencing reads are then realigned to the contigs with BWA-MEM, and variants are scored by their read support.

Address of the bookmark: https://github.com/walaj/svaba