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

Gupta Lab

Sat, 29 Dec 2018 13:18:31 -0600

Work include (i) understanding the evolutionary relationships among different prokaryotic and eukaryotic organisms; (ii) Understanding the cellular functions of these lineage-specific signature proteins as well as lineage-specific conserved inserts and deletions in important housekeeping proteins by genetic and biochemical studies; (iii) Development of novel diagnostic methods (PCR based and immunological) for identification of different groups of organisms based upon these signature proteins and conserved indels; (iv) The use of these lineage-specific probes with predicitive ability to identify/explore the presence of different groups of organisms in metagenomic sequences from various environments.

https://fhs.mcmaster.ca/gupta-lab/index.html

TMRCA Calculator

BioStar — Wed, 03 Feb 2021 05:07:30 -0600

This program calculates the probability that two people have a certain number of generations between them, based on the standard infinite alleles formula of Walsh. It calculates both the probability of being at an exact number of generations back to the Most Recent Common Ancestor (MRCA) of a certain pair of people and the cumulative probability that the actual number of generations is less than a certain value. Note that the convention using generations is changed from an earlier version of this calculator which used "transmission events". It can list both result types in a table or graph. In either case the horizontal axis stops at the point where the cumulative probability reaches 95% or 10 generations, whichever is longer, or an absolute max of 50,000. Beyond 90% the calculation becomes inaccurate.

https://clandonaldusa.org/index.php/tmrca-calculator

Address of the bookmark: https://clandonaldusa.org/index.php/tmrca-calculator

Genomicus: genome browser that enables users to navigate in genomes in several dimensions

Jit — Mon, 28 Feb 2022 23:27:37 -0600

Genomicus is a genome browser that enables users to navigate in genomes in several dimensions: linearly along chromosome axes, transversaly across different species, and chronologicaly along evolutionary time.

Once a query gene has been entered, it is displayed in its genomic context in parallel to the genomic context of all its orthologous and paralogous copies in all the other sequenced metazoan genomes. Moreover, Genomicus stores and displays the predicted ancestral genome structure in all the ancestral species within the phylogenetic range of interest.

All the data on extant species displayed in this browser are from Ensembl.

Summary statistics of Genomicus version 105.01: (view species tree in pdf or newick)


Number of extant species	200
Number of extant genes	4303993
Number of ancestral species	196
Number of ancestral genes	4624213
Number of ancestral synteny blocks	83342

Address of the bookmark: https://www.genomicus.bio.ens.psl.eu/genomicus-105.01/cgi-bin/search.pl

Genetic basis of tail-loss evolution

LEGE — Tue, 04 Mar 2025 12:12:36 -0600

The paper "On the genetic basis of tail-loss evolution in humans and apes (https://www.nature.com/articles/s41586-024-07095-8)", published in Nature, investigates the genetic mechanisms that led to the loss of tails in humans and apes. The study suggests that a specific genetic mutation, involving the insertion of an Alu element (a type of transposable DNA sequence), played a critical role in the evolutionary transition from tailed primates to tailless hominoids.

Key Findings of the Study:

Alu Insertion and Tail Loss:
The researchers discovered an Alu-mediated genetic change in a common ancestor of modern apes and humans. This change disrupted the normal function of a gene involved in tail development, leading to the suppression of tail formation.
Gene Disruption Mechanism:
The Alu insertion was found within a regulatory region of the TBXT gene (also known as T or Brachyury), which is crucial for tail development in vertebrates. This insertion likely altered the gene's expression patterns, leading to tail reduction over evolutionary time.
Functional Evidence from Model Organisms:
To test their hypothesis, the researchers introduced similar genetic modifications in mice. The modified mice exhibited shortened or absent tails, supporting the idea that the identified mutation played a role in tail loss in hominoids.
Evolutionary Implications:
The findings suggest that small, random genomic changes—such as transposable element insertions—can have profound effects on body morphology. This study provides evidence that mobile DNA elements (like Alu) can drive major evolutionary transitions.
Relevance to Human Evolution:
Understanding the genetic basis of tail loss helps in reconstructing the evolutionary history of hominins (the lineage that includes humans and our extinct relatives). It also sheds light on how genetic variations contribute to anatomical diversity among primates.

Significance of the Study:

This research highlights the role of transposable elements in shaping evolutionary traits and provides a concrete genetic explanation for a defining characteristic of humans and great apes. It also demonstrates how mutations in regulatory regions of developmental genes can lead to significant anatomical changes.

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/

GWASpro: A High-Performance Genome-Wide Association Analysis Server

Rahul Nayak — Fri, 07 Dec 2018 08:04:57 -0600

GWASpro supports building complex design matrices, by which complex experimental designs that may include replications, treatments, locations and times, can be accounted for in the linear mixed model (LMM). GWASpro is optimized to handle GWAS data that may consist of up to 10 million markers and 10,000 samples from replicable lines or hybrids. GWASpro provides an interface that significantly reduces the learning curve for new GWAS investigators.

Address of the bookmark: https://bioinfo.noble.org/GWASPRO/

Claus-Peter Stelzer Lab

Mon, 15 Mar 2021 15:24:41 -0500

Interested in various topics at the intersection of ecology and evolution. In my research I use rotifers as model organisms for experimental studies at the individual and population level. Rotifers are ideally suited for this, because populations of thousands can be kept in small containers in the lab, while single individuals can still be handled conveniently.

More at https://www.uibk.ac.at/limno/personnel/stelzer/index.html.en#research

04- Informatics Approach to Cancer - Interview with Dr. Joel Saltz

Mon, 07 Oct 2013 14:35:43 -0500

For additional information visit http://www.cancerquest.org/joel-saltz-interview. Dr. Joel Saltz is a Professor in the Departments of Pathology, Biostatistics and Bioinformatics, and Mathematics and Computer Science at Emory University. Dr. Saltz's research on bioinformatics spans several disciplines. One project involves applying computer analysis to medical imaging to yield better results for patients. As an example, a computer program may able to help doctors detect small cancers in a CT scan or mammogram. In this interview segment, Dr. Saltz discusses the informatics approach to cancer. To learn more about cancer and watch additional interviews, please visit the CancerQuest website at http://www.cancerquest.org.

Oldest Hominin DNA Sequenced

Surajeet — Fri, 27 Dec 2013 19:58:31 -0600

Matthias Meyer and his team from the Max Planck Institute for Evolutionary Anthropology in Leipzig, Germany, have developed new techniques for retrieving and sequencing highly degraded ancient DNA. They then joined forces with Juan-Luis Arsuaga and applied the new techniques to a cave bear from the Sima de los Huesos site. After this success, the researchers sampled two grams of bone powder from a hominin thigh bone from the cave. They extracted its DNA and sequenced the genome of the mitochondria or mtDNA, a small part of the genome that is passed down along the maternal line and occurs in many copies per cell. The researchers then compared this ancient mitochondrial DNA with Neandertals, Denisovans, present-day humans, and apes.

From the missing mutations in the old DNA sequences the researchers calculated that the Sima hominin lived about 400,000 years ago. They also found that it shared a common ancestor with the Denisovans, an extinct archaic group from Asia related to the Neandertals, about 700,000 years ago. "The fact that the mtDNA of the Sima de los Huesos hominin shares a common ancestor with Denisovan rather than Neandertal mtDNAs is unexpected since its skeletal remains carry Neandertal-derived features," says Matthias Meyer. Considering their age and Neandertal-like features, the Sima hominins were likely related to the population ancestral to both Neandertals and Denisovans. Another possibility is that gene flow from yet another group of hominins brought the Denisova-like mtDNA into the Sima hominins or their ancestors.

Reference

http://www.sciencedaily.com/releases/2013/12/131204132018.htm