BOL: Related items

DarkHorse: a method for genome-wide prediction of horizontal gene transfer

Jit — Thu, 22 Jun 2017 07:58:35 -0500

A new approach to rapid, genome-wide identification and ranking of horizontal transfer candidate proteins is presented. The method is quantitative, reproducible, and computationally undemanding. It can be combined with genomic signature and/or phylogenetic tree-building procedures to improve accuracy and efficiency. The method is also useful for retrospective assessments of horizontal transfer prediction reliability, recognizing orthologous sequences that may have been previously overlooked or unavailable. These features are demonstrated in bacterial, archaeal, and eukaryotic examples.

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

GeNeCK (Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks

Rahul Nayak — Tue, 15 Jan 2019 09:39:30 -0600

GeNeCK (Gene Network Construction Kit) is a comprehensive online tool kit that integrate various statistical methods to construct gene networks based on gene expression data and optional hub gene information.

It efficiently constructs gene networks from expression data. It allows the user to use ten different network construction methods (such as partial correlation-, likelihood-, Bayesian- and mutual information-based methods) and integrates the resulting networks from multiple methods. Hub gene information, if available, can be incorporated to enhance performance.

GeNeCK is an efficient and easy-to-use web application for gene regulatory network construction. It can be accessed at http://lce.biohpc.swmed.edu/geneck

Address of the bookmark: http://lce.biohpc.swmed.edu/geneck/

PyParanoid: a pipeline for rapid identification of homologous gene families in a set of genomes

BioStar — Thu, 13 Aug 2020 10:06:19 -0500

PyParanoid is a pipeline for rapid identification of homologous gene families in a set of genomes - a central task of any comparative genomics analysis. The "gold standard" for identifying homologs is to use reciprocal best hits (RBHs) which depends on performing a all-vs-all sequence comparison, usually using BLAST, to determine homology. However, these methods are computationally expensive, requiring O(n2) resources to identify RBHs. This is problematic, as the modern deluge of sequencing data means that comparative genomics analyses could be performed on datasets of thousands of strains.

Address of the bookmark: https://github.com/ryanmelnyk/PyParanoid

homologizer: Phylogenetic phasing of gene copies into polyploid subgenomes

Abhi — Sat, 03 Jun 2023 19:19:10 -0500

This tutorial describes the usage of homologizer to phase gene copies into polyploid subgenomes. The tutorial is an abbreviated version of a soon-to-be published paper in Methods in Molecular Biology. Please see that paper for many more details and practical considerations for running homologizer analyses. If you use homologizer, please cite the paper in which we first describe the method:

Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes. bioRxiv 2020.10.22.351486v4

homologizer is implemented in RevBayes. Please see http://revbayes.com to download and install RevBayes. For users without previous RevBayes experience, we recommend the tutorials at http://revbayes.com.

Address of the bookmark: https://github.com/wf8/homologizer

ANGES: reconstructing ANcestral GEnomeS maps

Abhimanyu Singh — Thu, 18 May 2017 05:27:08 -0500

This page contains the software ANGES 1.01, that aims at reconstucting ancestral genome maps from homologous markers in extant related genomes.

Download

Program, version 1.01 (July 10, 2012, documentation updated in August 2014)
Examples with results (featured ancestors: boreoeutherian, amniote, yeasts, Burkholderia, monocots); please refer to the documentation of the distribution above.

Address of the bookmark: http://paleogenomics.irmacs.sfu.ca/ANGES/

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/

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc

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