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

sudo apt-get install build-essential libtool automake zlib1g-dev libbz2-dev pkg-config

On MacOS, the Apple Developer tools and Fink (or MacPorts or Brew) must be installed, then:

sudo fink install bzip2-dev pkgconfig

Address of the bookmark: https://github.com/neufeld/pandaseq

Address of the bookmark: https://bioinformatics.um6p.ma/AlignStatPlot/

BioCircos.js provides SNP, CNV, HEATMAP, LINK, LINE, SCATTER, ARC, TEXT, and HISTGRAMmodules to display genome-wide genetic variations (SNPs, CNVs and chromosome rearrangement), gene expression and biomolecule interactions. BioCircos.js also provides BACKGROUND module to display background and axis circles. Tooltips showing detailed information of SVG elements are also provided.

Demo

Address of the bookmark: http://bioinfo.ibp.ac.cn/biocircos/document/index.html

The successful candidate will be in charge of the detection of polymorphisms including structural variants, of the comparison of multiple and diverse genomes of a same species and of the construction of pan- and core-genomes. These challenging tasks will require bioinformatics developments and implementation of methods for accommodating the high level of repetitiveness of complex genomes. The tools will be integrated into pipelines and made available to end-users through the Galaxy platform. The bioinformatician will therefore also have to provide researchers with advices on their experimental designs in order to ensure compliance of produced datasets with pipelines requirements. He/she will be hosted by a bioinformatics/informatics team (7 people) (http://moulon.inra.fr/index.php/fr/equipestransversales/atelier-de-bioinformatique) which has computational facilities and expertise in NGS data analysis, and will benefit as well from national and international collaborative networks (Aplibio http://www.renabi.fr/platforms/aplibio/, Transplant http://transplantdb.eu, AMAIZING http://www.amaizing.fr/).

The position requires a doctoral degree (PhD) in bioinformatics with strong expertise in script writing (Python/Perl) and pipeline development.

Applicants should send a CV and the names of 2 referees willing to provide a letter of recommendation to joets@moulon.inra.fr.

Center for Integrative Genomics, University of Lausanne, Switzerland

Two postdoctoral positions (2 years with possible extensions up to 5 years) are available immediately in the evolutionary genomics group of Henrik Kaessmann.

We are seeking highly qualified and enthusiastic applicants with strong skills in computational biology/bioinformatics, preferably also with experience in data mining and comparative or evolutionary genome analysis.

We have been interested in a range of topics related to the functional evolution of genomes from primates (e.g., the emergence of new genes and their functions) and other mammals (e.g., the origin and evolution of mammalian sex chromosomes). In the framework of a recently launched series of projects, a large amount of transcriptome and genome (e.g., epigenome) data are being produced by the wet lab unit of the group using next generation sequencing technologies for a unique collection of tissues from representative mammals and outgroup species (e.g., birds). Topics of current projects based on these data include the origins and/or evolution of protein-coding genes, alternative splicing, microRNAs, long noncoding RNAs, and dosage compensation.

The postdoctoral fellow will perform integrated evolutionary/bioinformatics analyses based on data produced in the lab and available genomic data. The specific project will be developed together with the candidate.

The language of the institute is English, and its members form an international group that is rapidly expanding. The institute is located in Lausanne, a beautiful city at Lake Geneva.

For more information on the group and our institute more generally, please refer to our website: http://www.unil.ch/cig/page7858_en.html

Please submit a CV, statement of research interest, and names of three references to: Henrik Kaessmann (Henrik.Kaessmann@unil.ch).

Webpage : http://www.unil.ch/cig/page7858.html

WALK-IN-INTERVIEW

A walk-in-Interview is proposed to be held at National Bureau of Animal Genetic Resources, Karnal (Haryana)-132001 at 11:30 AM on 18.12.2013 to select One RA and One SRF as per details given below:

1. One post of Research Associate under DBT sponsored Support under BIPP for the “SanGenix: A comprehensive Next Generation Sequence (NGS) data analysis solution” as Grants in AID. Thepost duration is Upto 31st March 2015 or earlier.

2. One post of Senior Research Fellow under NAIP (Component-4) Bioprospecting of genes and allele mining for abiotic stress tolerance. The post duration is Upto 31st March 2014 or earlier

Essential Qualifications: Ph.D. in Bioinformatics/ Computer Application or
First Class Masters degree in Bioinformatics/ Computer Application with two years experience as evidenced by Publications.

Desirable: Experience in the field of handling Next generation Sequencing Data.

Emolument: Rs. 22,000/- per month + HRA as per admissibility

Age Limit:

40 years for Men
45 years for women as on date of interview

Research Associate: ONE

Duration of engagement: Upto

31st March 2015 or earlier & Coterminus with the project

Responsibilities: To help the PI for Beta testing and development of the SanGenix Tool for NGS data.

Essential Qualifications: First Class Masters’ degree in Bioinformatics/Biotechnology.

Desirable: Experience in the field of Biotechnology/ Bioinformatics

Emoluments:

Rs. 16,000/- per month + HRA as per admissibility.
Senior Research Fellow: ONE
Duration of engagement: Upto 31st March 2014 or earlier & Coterminus with the project

Age Limit

35 years for men
40 years for women as on date of interview

Note: Relaxation in age will be admissible for SC/ST & OBC candidates as per Govt. of India /ICAR norms

1. The applicants must bring with them original documents and brief of research work done during post graduation along with a set of photocopy and latest two passport size photographs.
2. A panel of selected candidates will also be made which may be utilized for filling of positions of shorter durations in future if demand arises.
3. Experience certificate in original, if any 4. The above positions are purely on temporary basis and are co-terminus with the project. No TA/DA will be paid to attend the interview.
5. Any other clarifications can be had on the date of interview.
6. The Director’s decision will be final and binding on all respects.

Advertisement: http://210.212.93.85/rasrfadvertise.pdf

The Job detail

Advancing the SNP-discovery and polymorphism assessment work across several germplasm panels representing global genetic diversity
Population genetic and genomic analyses, testing the hypothesis related to adaptation in multiple geographic regions
Develop SNP assays from large scale GBS and other re-sequencing data for several target traits utilizing available phenotyping data
Combined analyses of genotypic and phenotypic data for discovery of marker-trait associations, and conducting GWAS
Processing, analyzing, and archiving large-scale genomic data sets, assessing data quality, conducting analyses, interpreting findings, and communicating findings to others including preparation of reports, presentations, posters and journal articles
Providing support to MSc and PhD students on topic related to its major core of research
Any other work assigned by the supervisor

The Person:

PhD in bioinformatics, genetics, computational biology preferably with 1 to 2 years of experience;
familiar with standard bioinformatics tools and scripting languages and emerging and evolving software platforms relevant to bioinformatics and computational biology;
ability to create new analytical pipelines; experience with handling large data sets;
ability to program in at least two of the following: C++, PERL, Python, R, Java.
will use next-generation sequencing technologies to generate marker data for genetic mapping and transcriptome data for expression QTL mapping, and will be responsible for data generation as well as data analysis.

Period and Remuneration: The assignment is for a period of two years, and can be extended for another year depending on performance. ICRISAT pays a very attractive all inclusive lump sum assignment fee payable in Indian Rupees.

How to Apply: Please send your application by email to icrisatjobs@cgiar.org, stating the job title (Special project Scientist-Sorghum Genomics) clearly in the subject column, addressed to the Director, Human Resources and Operations, ICRISAT, Patancheru, Andhra Pradesh 502 324, India, latest by 10 June 2014. The application should include an up-to-date Curriculum Vitae, a short statement of competencies and experience for the position, and the names and addresses (including phone/e-mail) of three referees. Only short-listed candidates will be contacted.

More at: http://www.icrisat.org/careers/Special-Project-Scientist-Sorghum-Genomics.htm

Perl one-liners are small and awesome Perl programs that fit in a single line of code and they do one thing really well. These things include changing line spacing, numbering lines, doing calculations, converting and substituting text, deleting and printing certain lines, parsing logs, editing files in-place, doing statistics, carrying out system administration tasks, updating a bunch of files at once, and many more. Perl one-liners will make you the shell warrior. Anything that took you minutes to solve, will now take you seconds!

perl -pe '$\="\n"'   
#double space a file

perl -pe '$_ .= "\n" unless /^$/'
#double space a file except blank lines

perl -pe '$_.="\n"x7'
#7 space in a line.

perl -ne 'print unless /^$/'
#remove all blank lines

perl -lne 'print if length($_) < 20'
#print all lines with length less than 20.

perl -00 -pe ''
#If there are multiple spaces, delete all leaving one(make the file a single spaced file).

perl -00 -pe '$_.="\n"x4'
#Expand single blank lines into 4 consecutive blank lines

perl -pe '$_ = "$. $_"'
#Number all lines in a file

perl -pe '$_ = ++$a." $_" if /./'
#Number only non-empty lines in a file

perl -ne 'print ++$a." $_" if /./'
#Number and print only non-empty lines in a file

perl -pe '$_ = ++$a." $_" if /regex/'
#Number only lines that match a pattern

perl -ne 'print ++$a." $_" if /regex/'
#Number and print only lines that match a pattern

perl -ne 'printf "%-5d %s", $., $_ if /regex/'
#Left align lines with 5 white spaces if matches a pattern (perl -ne 'printf "%-5d %s", $., $_' : for all the lines)

perl -le 'print scalar(grep{/./}<>)'
#prints the total number of non-empty lines in a file

perl -lne '$a++ if /regex/; END {print $a+0}'
#print the total number of lines that matches the pattern

perl -alne 'print scalar @F'
#print the total number fields(words) in each line.

perl -alne '$t += @F; END { print $t}'
#Find total number of words in the file

perl -alne 'map { /regex/ && $t++ } @F; END { print $t }'
#find total number of fields that match the pattern

perl -lne '/regex/ && $t++; END { print $t }'
#Find total number of lines that match a pattern

perl -le '$n = 20; $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $m'
#will calculate the GCD of two numbers.

perl -le '$a = $n = 20; $b = $m = 35; ($m,$n) = ($n,$m%$n) while $n; print $a*$b/$m'
#will calculate lcd of 20 and 35.

perl -le '$n=10; $min=5; $max=15; $, = " "; print map { int(rand($max-$min))+$min } 1..$n'
#Generates 10 random numbers between 5 and 15.

perl -le 'print map { ("a".."z",”0”..”9”)[rand 36] } 1..8'
#Generates a 8 character password from a to z and number 0 – 9.

perl -le 'print map { ("a",”t”,”g”,”c”)[rand 4] } 1..20'
#Generates a 20 nucleotide long random residue.

perl -le 'print "a"x50'
#generate a string of ‘x’ 50 character long

perl -le 'print join ", ", map { ord } split //, "hello world"'
#Will print the ascii value of the string hello world.

perl -le '@ascii = (99, 111, 100, 105, 110, 103); print pack("C*", @ascii)'
#converts ascii values into character strings.

perl -le '@odd = grep {$_ % 2 == 1} 1..100; print "@odd"'
#Generates an array of odd numbers.

perl -le '@even = grep {$_ % 2 == 0} 1..100; print "@even"'
#Generate an array of even numbers

perl -lpe 'y/A-Za-z/N-ZA-Mn-za-m/' file
#Convert the entire file into 13 characters offset(ROT13)

perl -nle 'print uc'
#Convert all text to uppercase:

perl -nle 'print lc'
#Convert text to lowercase:

perl -nle 'print ucfirst lc'
#Convert only first letter of first word to uppercas

perl -ple 'y/A-Za-z/a-zA-Z/'
#Convert upper case to lower case and vice versa

perl -ple 's/(\w+)/\u$1/g'
#Camel Casing

perl -pe 's|\n|\r\n|'
#Convert unix new lines into DOS new lines:

perl -pe 's|\r\n|\n|'
#Convert DOS newlines into unix new line

perl -pe 's|\n|\r|'
#Convert unix newlines into MAC newlines:

perl -pe '/regexp/ && s/foo/bar/'
#Substitute a foo with a bar in a line with a regexp.

Reference/Sources:

http://genomics-array.blogspot.in/2010/11/some-unixperl-oneliners-for.html

http://genomespot.blogspot.com/2013/08/a-selection-of-useful-bash-one-liners.html

http://biowize.wordpress.com/2012/06/15/command-line-magic-for-your-gene-annotations/

http://genomics-array.blogspot.com/2010/11/some-unixperl-oneliners-for.html

http://bioexpressblog.wordpress.com/2013/04/05/split-multi-fasta-sequence-file/