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

Location where with post of Research Associate / Senior Research Fellow is available:
Bioinformatics Centre, Bose Institute in Kolkata, West Bengal

Title of the Project: "Setting up of National Facility on Interactive Graphics Computer System".

No. of the Post: 01 One

Salary: Rs. 22000/- per month plus admissible HRA and Medical Benefits for RA and Rs. 20000/- per month plus admissible HRA and Medical Benefits for SRF (Extended).

Age Limit: Max. 35 years for RA and Max. 33 years for SRF (Extended)

Required Job Profile:

Candidate must possess PhD degree in biological or chemical sciences with in depth understanding of protein structure and function; experience on protein crystallization and various modeling software will be advantages and candidate who have submitted PhD thesis can be considered as extended SRF.

The project would involve cloning, expression, crustallization of vibrio cholera toxin, Ace and modeling of its admissible HRA and medical benefits for SRF (Extended).

How to apply:

Eligible and interested candidates should need to appear before the selection committee along with typed application addressed to the above mentioned address along with biodata with complete details and attested copies of certificates on 02.03.2016 at 11:30 am. No TA or DA will be paid for attending the interview. No TA or DA will be paid for attending the interview.

Refer to http://www.boseinst.ernet.in/ADVT/15/p_30.pdf

https://github.com/mvollger/SDA

Address of the bookmark: https://www.nature.com/articles/s41592-018-0236-3

Bioinformatics Trainee Job position in University of Kalyani
Number of Posts : 02
Qualification : M.Sc. in any branch of life science with prior knowledge of Bioinformatics
Fellowship / Stipend / Salary : As per DBT rules
Duration of the Post : Six months starting from January, 2016
How to apply
Walk-in-interview will be held on 28.12.2015 at Department of Biochemistry and Biophysics, University of Kalyani.

More at http://www.klyuniv.ac.in/index.php/recruitments

Address of the bookmark: https://genomebiology.biomedcentral.com/articles/10.1186/gb-2002-3-12-research0082

http://www.chekulaevalab.org/

Address of the bookmark: https://github.com/ggonnella/gfaviz

No. of Post : 01

Department : Science and Technology

Qualifications : Ph.D. with specialization in Bioinformatics/Machine Learning/ Mathematical Biology/ Computational Biology/ Systems Biology with a minimum of 55% marks in M. Sc. (50% for candidates belongs to reserved category) or equivalent grade. Candidates who have submitted their Ph.D. thesis and are waiting for award of Ph.D. are also eligible. OR M. Sc. Bioinformatics with two years of research experience in the areas mentioned above, a minimum of 55% marks in M.Sc. (50% for candidates belongs to reserved categories) or equivalent grade and at least one publication in Science Citation Index (SCI) journal. Preference will be given to B.I.N.C. /J.R.F. /N.E.T. /S.E.T. qualified candidates.

Emoluments : Rs. 20,000/- (Including H.R.A.) per month.
How to apply

The complete application along with necessary documents and certificates should reach to 'The Director, Bioinformatics Centre, Savitribai Phule Pune University (Formerly University of Pune), Caneshkhind Road. Pune - 411 007 on or before 21st March, 2016 within official hours except Sundays (i.e. 10.20 am to 06.00 pm).

More at http://collegecirculars.unipune.ac.in/sites/documents/Job%20Openings/Forms/AllItems.aspx