BOL: Related items

HASLR: a tool for rapid genome assembly of long sequencing reads

LEGE — Fri, 31 Jan 2020 05:50:15 -0600

HASLR is a tool for rapid genome assembly of long sequencing reads. HASLR is a hybrid tool which means it requires long reads generated by Third Generation Sequencing technologies (such as PacBio or Oxford Nanopore) together with Next Generation Sequencing reads (such as Illumina) from the same sample.

Address of the bookmark: https://github.com/vpc-ccg/haslr

CAT/BAT: tool for taxonomic classification of contigs and metagenome-assembled genomes (MAGs)

Jit — Mon, 18 May 2020 10:53:32 -0500

Contig Annotation Tool (CAT) and Bin Annotation Tool (BAT) are pipelines for the taxonomic classification of long DNA sequences and metagenome assembled genomes (MAGs/bins) of both known and (highly) unknown microorganisms, as generated by contemporary metagenomics studies. The core algorithm of both programs involves gene calling, mapping of predicted ORFs against the nr protein database, and voting-based classification of the entire contig / MAG based on classification of the individual ORFs. CAT and BAT can be run from intermediate steps if files are formated appropriately (see Usage).

Address of the bookmark: https://github.com/dutilh/CAT

mixtureS: a novel tool for bacterial strain reconstruction from reads

BioStar — Fri, 21 Aug 2020 08:23:19 -0500

mixtureS that can de novo identify bacterial strains from shotgun reads of a clonal or metagenomic sample, without prior knowledge about the strains and their variations. Tested on 243 simulated datasets and 195 experimental datasets, mixtureS reliably identified the strains, their numbers and their abundance. Compared with three tools, mixtureS showed better performance in almost all simulated datasets and the vast majority of experimental datasets.

Availability

The source code and tool mixtureS is available at http://www.cs.ucf.edu/˜xiaoman/mixtureS/.

Address of the bookmark: http://www.cs.ucf.edu/~xiaoman/mixtureS/

vsFilt: A tool to improve virtual screening by structural filtration of docking poses

Neel — Wed, 25 Nov 2020 02:39:16 -0600

The vsFilt is the first open application for post-docking structural filtration, available as a web-server. The new tool is easy to use and configure to detect a wide range of interaction types that are known to be involved in molecular recognition, including hydrogen and halogen bonds, ionic interactions, hydrophobic contacts, π-stacking, and cation-π interactions. The web-server can process large libraries of up to 150’000 docked ligand poses. The results are web-based and can be operated on-line using the built-in HTML5 interactive analysis tools, or can be downloaded for a local use. The vsFilt is freely available on-line, no login required.

Address of the bookmark: https://biokinet.belozersky.msu.ru/vsfilt

JumboDB: tool for de Bruijn graph construction

BioStar — Tue, 17 Aug 2021 13:33:46 -0500

jumboDB tool for fast de Bruijn graph construction from long sequences (reads or genomes) with very low error rate. JumboDB is not a genome assembler by itself but rather a subroutine that translates a set of reads into compressed de Bruijn graph.

More at https://github.com/AntonBankevich/jumboDB

Address of the bookmark: https://github.com/AntonBankevich/jumboDB

bacLIFE: an automated genome mining tool for identification of lifestyle associated genes

BioStar — Fri, 15 Mar 2024 04:59:14 -0500

bacLIFE is a streamlined computational workflow that annotates bacterial genomes and performs large-scale comparative genomics to predict bacterial lifestyles and to pinpoint candidate genes, denominated lifestyle-associated genes (LAGs), and biosynthetic gene clusters associated with each lifestyle detected. This whole process is divided into different modules:

Clustering module Predicts, clusters and annotates the genes of every input genome
Lifestyle prediction Employs a machine learning model to forecast bacterial lifestyle or other specified metadata
Analitical module (Shiny app) Results from the previous modules are embedded in a user-friendly interface for comprehensive and interactive comparative genomics.

You can find the complete wiki here [https://github.com/Carrion-lab/bacLIFE/wiki/bacLIFE-wiki]

Address of the bookmark: https://github.com/Carrion-lab/bacLIFE

NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes

LEGE — Tue, 10 Sep 2024 04:54:55 -0500

NGenomeSyn: an easy-to-use and flexible tool for publication-ready visualization of syntenic relationships across multiple genomes

NGenomeSyn [multiple (N) Genome Synteny], for publication-ready visualization of syntenic relationships of the whole genome or local region and genomic features (e.g. repeats, structural variations, genes) across multiple genomes with a high customization. NGenomeSyn provides an easy way for its users to visualize a large amount of data with a rich layout by simply adjusting options for moving, scaling, and rotation of target genomes. Moreover, NGenomeSyn could be applied on the visualization of relationships on non-genomic data with similar input formats.

https://academic.oup.com/bioinformatics/article/39/3/btad121/7072460

Address of the bookmark: https://github.com/hewm2008/NGenomeSyn

Dynamic Programming Alignment

Thu, 22 Aug 2013 09:38:28 -0500

lecture 9, Chem. C100, Spring 2013, UCLA

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/

YAHA

Jit — Fri, 20 Jan 2017 05:38:05 -0600

YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.

Availability: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA.

Contact:

http://genome.wustl.edu/people/groups/detail/hall-lab/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/