BOL: Related items

Ancestral sequence reconstruction (ASR) or ancestral gene/sequence reconstruction/resurrection tools to study molecular evolution

Jit — Tue, 30 May 2017 04:20:05 -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.

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools:

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

GLEAN: an unsupervised learning system to integrate disparate sources of gene structure evidence

Poonam Mahapatra — Sat, 02 Jun 2018 07:38:33 -0500

GLEAN is an unsupervised learning system to integrate disparate sources of gene structure evidence (gene model predictions, EST/protein genomic sequence alignments, SAGE/peptide tags, etc) to produce a consensus gene prediction, without prior training.

Address of the bookmark: https://sourceforge.net/projects/glean-gene/

GeneOverlap: An R package to test and visualize gene overlaps

Jit — Thu, 27 Dec 2018 19:45:52 -0600

Overlapping gene lists can reveal biological meanings and may lead to novel hypotheses. For example, histone modification is an important cellular mechanism that can pack and re-pack chromatin. By making the chromatin structure more dense or loose, the gene expression can be turned on or off. Tri-methylation on lysine 4 of histone H3 (H3K4me3) is associated with gene activation and its genome-wide enrichment can be mapped by using ChIP-seq experiments. Because of its activating role, if we overlap the genes that are bound by H3K4me3 with the genes that are highly expressed, we should expect a positive association. Similary, we can perform such kind of overlapping between the gene lists of different histone modifications with that of various expression groups and establish each histone modification’s role in gene regulation.

Address of the bookmark: https://bioconductor.org/packages/release/bioc/vignettes/GeneOverlap/inst/doc/GeneOverlap.pdf

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

Graph Genome Suite

Jit — Fri, 28 Oct 2016 07:59:54 -0500

Seven Bridges is the biomedical data analysis company accelerating breakthroughs in genomics research for cancer, drug development and precision medicine. We build self-improving systems to analyze millions of genomes, including the Graph Genome Suite — the most advanced population genomics tools in the world.

Address of the bookmark: https://www.sbgenomics.com/graph/

Osprey: Network Visualization System

BioJoker — Sun, 20 Jan 2019 05:34:24 -0600

Osprey is a software platform for the visualization of complex biological interaction networks. Osprey builds data-rich graphical representations from Gene Ontology (GO) annotated interaction data maintained by the BioGRID.

Osprey is developed by the TyersLab and is a part of the BioGRID family of software. It utilizes both MySQL and Java to operate and is compatible with Windows, Linux, and Apple operating systems.

These works were published in Breitkreutz, BJ., Stark, C., Tyers M. "Osprey: A Network Visualization System." Genome Biology 2003 4(3):R22 [Genome Biology] [PDF] [PubMed] and supported by the National Institutes of Health, Canadian Institutes of Health Research, and Genome Canada.

Address of the bookmark: https://osprey.thebiogrid.org/

List of visualization tools for network biology

Jit — Mon, 29 Jan 2018 05:12:24 -0600

Network analysis is any structured technique used to mathematically analyze a circuit (a “network” of interconnected components). The Network analysis provides the ability to quantify associations between individuals, which makes it possible to infer details about the network as a whole at the species and/or population level. Few tools published in BMC are listed here https://bmcbioinformatics.biomedcentral.com/articles/sections/networks-analysis.

Following are the list of standalone applications for network analysis:

Arena 3D

3D visualization of multi-layer networks

http://www.arena3d.org

Biana

Data integration and network management

http://sbi.imim.es/web/BIANA.php

BioLayout Express 3D

2D/3D network visualization

http://www.biolayout.org/

BiologicalNetworks

Efficient integrated multi-level analysis of microarray, sequence, regulatory and other data

http://www.biologicalnetworks.org

BioMiner

Modeling, analyzing and visualizing biochemical pathways and networks

http://www.zbi.uni-saarland.de/chair/projects/BioMiner

Cell Illustrator

Petri nets for modeling and simulating biological networks

http://www.cellillustrator.com

COPASI

Analysis of biochemical networks and their dynamics

http://www.copasi.org/

Cytoscape

Network visualization and analysis. Over 200 plugins [60]

http://www.cytoscape.org/

Dizzy

Chemical kinetics stochastic simulation software

http://magnet.systemsbiology.net/software/Dizzy/

DyCoNet

Gephi plugin that can be used to identify dynamic communities in networks

https://github.com/juliemkauffman/DyCoNet

GENeVis

Network and pathway visualization

http://tinyurl.com/genevis/

GEPHI

Interactive visualization and exploration for any network and complex system, dynamic and hierarchical graph.

https://gephi.org

Igraph

Collection of network analysis tools with the emphasis on efficiency, portability and ease of use

http://igraph.sourceforge.net

Medusa

Semantic and multi-edged simple networks

https://sites.google.com/site/medusa3visualization/

NAViGaTOR

Visualizing and analyzing protein-protein interaction networks

http://tinyurl.com/navigator1/

N-Browse

Interactive graphical browser for biological networks

http://www.gnetbrowse.org/

NeAT

Topological and clustering analysis of networks

http://rsat.ulb.ac.be/neat/

Ondex

Data integration and visualization of large networks

http://www.ondex.org/

Osprey

Visualization and annotation of biological networks

http://biodata.mshri.on.ca/osprey/servlet/Index

Pajek

Analysis and visualization of large networks and social network analysis

http://vlado.fmf.uni-lj.si/pub/networks/pajek/

PathwayAssist

Navigation and analysis of biological pathways, gene regulation networks and protein interaction maps.

http://www.ariadnegenomics.com/downloads/

PIVOT

Layout algorithms for visualizing protein interactions and families

http://acgt.cs.tau.ac.il/pivot/

ProCope

Prediction and evaluation of protein complexes from purification data experiments

http://www.bio.ifi.lmu.de/Complexes/ProCope/

ProViz

Visualization and exploration of interaction networks. Gene Ontology and PSI-MI formats supported

http://cbi.labri.fr/eng/proviz.htm

SpectralNET

Network analysis and visualizations. Scatter plots and dimensionality reduction algorithms

https://www.broadinstitute.org/software/spectralnet

Tulip

Enables the development of algorithms, visual encodings, interaction techniques, data models and domain-specific visualizations

http://tulip.labri.fr/TulipDrupal/

VANESA

Automatic reconstruction and analysis of biological networks and Petri nets based on life-science database information

http://agbi.techfak.uni-bielefeld.de/vanesa/

VANTED

Network reconstruction, data visualization, integration of various data types, network simulation

http://tinyurl.com/vanted/

yEd

Creation of diagrams manually and import external data

http://tinyurl.com/yEdGraph/

Web tools for network analysis

APID

Unified protein-protein interactions from BIND, BioGRID, DIP, HPRD, IntAct and MINT

http://bioinfow.dep.usal.es/apid/

Arcadia

Translates text-based descriptions of biological networks (SBML files) into standardized diagrams (Systems Biology Graphical Notation Process Description maps)

http://arcadiapathways.sourceforge.net/

AVIS

Viewer for signaling networks

http://actin.pharm.mssm.edu/AVIS2

bioPIXIE

Discovery of biological networks from diverse functional genomic data

http://pixie.princeton.edu/pixie

CellPublisher

Interactive representations of biochemical processes

http://cellpublisher.gobics.de/

Graphle

Distributed network exploration and visualization of interactive large, dense graphs

http://tinyurl.com/graphle/

GraphWeb

Web server for graph-based analysis of biological networks

http://biit.cs.ut.ee/graphweb/

Hubba

Web-based service to explore the essential nodes in a network

http://hub.iis.sinica.edu.tw/Hubba

NetworkBLAST

Analysis of protein interaction networks across species to infer protein complexes that are conserved in evolution

http://www.cs.tau.ac.il/~bnet/networkblast.htm

Pathview

Tool set for pathway-based data integration and visualization

http://Pathview.r-forge.r-project.org/

PINA

Integrated platform for protein interaction network construction, filtering, analysis, visualization and management

http://cbg.garvan.unsw.edu.au/pina/home.do

ReMatch

Web-based tool for integration of user-given stoichiometric metabolic models into a database collected from public data sources

http://www.cs.helsinki.fi/group/sysfys/software/rematch/

SNOW

Gene mapping on a reference or human protein-protein interaction network that SNOW hosts

http://snow.bioinfo.cipf.es

STITCH

Resource to explore known and predicted interactions of chemicals and proteins

http://stitch.embl.de/

STRING

Protein interaction networks and integration of data such as genomic context, high-throughput experiments, conserved coexpression and previous knowledge derived from the literature

http://string-db.org

TVNViewer

An interactive visualization tool for exploring networks that change over time or space

http://www.sailing.cs.cmu.edu/main/?page_id=545

tYNA

System for managing, comparing and mining multiple networks

http://tyna.gersteinlab.org/tyna/

VisANT

Visualization, mining, analysis and modeling of biological networks, metabolic networks and ecosystems

http://visant.bu.edu/

DeepVariant : an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.

Jit — Sat, 25 Jan 2020 13:28:09 -0600

DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data.

DeepVariant is an analysis pipeline that uses a deep neural network to call genetic variants from next-generation DNA sequencing data. DeepVariant relies on Nucleus, a library of Python and C++ code for reading and writing data in common genomics file formats (like SAM and VCF) designed for painless integration with the TensorFlow machine learning framework.

https://ai.googleblog.com/2017/12/deepvariant-highly-accurate-genomes.html

https://www.biorxiv.org/content/10.1101/092890v6

Address of the bookmark: https://github.com/google/deepvariant

GraphPath: A graph attention model for molecular stratification with interpretability based on the pathway-pathway interaction network

LEGE — Wed, 27 Mar 2024 20:51:21 -0500

Achieving accurate and interpretable clinical predictions requires paramount attention to thoroughly characterizing patients at both the molecular and biological pathway levels. In this paper, we present GraphPath, a biological knowledge-driven graph neural network with multi-head self-attention mechanism that implements the pathway-pathway interaction network. We train GraphPath to classify the cancer status of patients with prostate cancer based on their multi-omics profiling.

Address of the bookmark: https://github.com/amazingma/GraphPath