A recent study published in PLOS Computational Biology introduces REvolutionH-tl 2.0 (https://pypi.org/project/revolutionhtl/), a computational tool designed to help solve this mystery. The software analyzes protein sequences and identifies evolutionary relationships between genes. It can help researchers detect important events such as gene duplication, gene loss, and speciation, allowing them to reconstruct how genes evolved across different organisms.

What makes the tool especially interesting is its focus on both speed and interpretation. The researchers compared REvolutionH-tl 2.0 with several existing computational tools and reported that it achieved competitive accuracy while requiring less computational time in their tests. The tool also includes visualization features, helping researchers turn complicated genetic data into evolutionary stories that are easier to explore.

Genes are more than simple sequences of DNA; they are records of life’s long history. Each surviving gene carries traces of the changes that shaped it. By bringing together computational analysis and visualization, REvolutionH-tl 2.0 acts like a detective, helping scientists uncover these hidden stories. Ultimately, tools like this can improve our understanding of how genomes evolved and how genes acquired the roles they perform today.

More at https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1013017

Please add ur links/bookmarks in comment section.

Address of the bookmark: http://physicsdatabase.com/free-math-books/

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

Address of the bookmark: http://bioinformatics.oxfordjournals.org/content/23/14/1713.full

http://www.sidowlab.org/

CENTRE FOR BIOINFORMATICS

PUDUCHERRY

Applications are invited for one Project Assistant to work in the UGC sponsored Research Award "Molecular Docking and Dynamics studies to understand the interacting mechanism of oncogenic 101 protein with its cellular proteins".

The duration for the fellowship is 12months only with consolidated pay ofRs. 5,000 per month.

Application on plain paper with following details: Name, Address, Data of Birth, Father's Name, Nationality, Educational Qualification (SSLC onwards-enclose attested copies of certificate) and Researcb Experience may be addressed to Dr. R. Krishna, Principle Investigator (PI), UGC Research Award, Centre for Bioinformatics, Pondicherry University, Pondicherry - 605 014.

Application should reach in January 261h , 2013.

Essential Qualification: M.Sc. in Bioinformatics/Biophysics with good academic record.

Qualification for Project Fellow:

M.Sc in Bioinformatics/Biophysics.

The person to be considered for appointment as Project Fellow must have second class master degree with a minimum of 55% marks in the subject concerned or a related subject.

The candidate to be appointed as Project Fellows should be below thc age of40 years at the time of appointment.

Desirable Qualification for this Project: Research Experience in Small/Macromolecule Crystallography and Structural Bioinformatics.

For more details, refer the web site: www.pondiuni.edu.in/sites/default/files/BIC-311213.pdf

(Under Tenure-Track Model)

Open Advt. No IIITA/DIC/16012014

IIIT-Allahabad has several Openings for the Faculty positions at the Assistant Professor level.

It is a regular tenure-track faculty positions for 3-5 years in teaching and research. A regular faculty is expected to engage heavily in research and teaching. The eligibility criteria for regular faculty positions are similar as in IITs. For an Assistant Professor position, a candidate must have a PhD (in IT/Computer Science &/or Engineering/Electrical, Electronics &/or Communication Engineering/etc; for interdisciplinary areas the PhD may be in an appropriate field), plus three years experience. However, for PhDs from a well known University/Institute (e.g. IITs/IISc/TIFR/ISI in India or well known research universities across the world), and a good research/academic record, the 3 years experience requirement may be waived.

The pay scale for faculty is same as in IITs. Other benefits include initiation research grant, travel support, book grant, professional society membership, etc., and personal benefits such as medical/LTC, on campus subsidized family housing with excellent modern infrastructural facilities.

Areas of Interest

IIIT-Allahabad aims to build strong research groups in important and emerging areas in CS/IT/ECE as well as in emerging interdisciplinary areas, and applications are invited in all these areas. Some of the areas of special interest, besides strengthening the existing research areas, are : Software Engineering, Theoretical Computer Science, Cyber Physical Systems, Robotics, Network science, Digital Media, Computational neuroscience, Machine learning, Healthcare informatics, Computational Biology, Communications networks (both at hardware and protocol levels), Circuits (including VLSI, analog, low power, etc), Energy systems and technologies, Biomedical electronics and systems, Computer Architecture, signal/image processing, Embedded and control systems.

Application Process

Interested candidates can apply by sending their detailed CV with list of publications clearly mentioning Journal names and citation index with three references through email entitled “Faculty positions at IIIT Allahabad” to faculty.applications@iiita.ac.in. Do not send your applications in any other email addresses. Applications will be considered regularly, hence there is no deadline for applying.

Important Clarifications on Eligibility

A PhD in CS/IT (or other disciplines, as announced) is the minimum expected requirement for an Assistant Professor.

Advertisement: http://iiita.ac.in/pub/Faculty-Position-IIITA1.pdf

An Autonomous National Institute under Government of India,
Ministry of Science & Technology
Department of Biotechnology

No: RGCB/ Advt./2014/1
January 24, 2014

Scientist Positions

Group Leader in Computational Biology/Bioinformatics
A highly motivated and innovative individual who will pursue basic research, solve biological problems with emphasis on computational and quantitative experimental methods and build active bridges to translational research. The scientist will also provide computational biology support to analyze complex data sets generated by RGCB scientists and collaborators.

Location: Thiruvananthapuram (Trivandrum)

The above positions will be at the E-II, F or equivalent levels. For senior applicants with an outstanding track record, an option of a contract career path for research excellence at Scientist G or H equivalent level can also be discussed. All positions will initially be for 5 years. Essential and desired qualifications as well as other relevant details for all the above positions are posted on the RGCB website (http://www.rgcb.res.in). The last date for receiving applications is March 14, 2014.

Sd/-
Director

Rajiv Gandhi Centre for Biotechnology
Thycaud, P.O., Poojappura,
Thiruvananthapuram, Kerala, India-695 014
Ph.: 91-471-2529400 (30 Lines), 2347975, 2348104, 2348753, 2345899
Fax: 91-471-2348096, 2346333

More at http://rgcb.res.in/jobs.html