Progressive Cactus is a whole-genome alignment package.

Requirements

• git
• gcc 4.2 or newer
• python 2.7
• wget
• 64bit processor and build environment
• 150GB+ of memory on at least one machine when aligning mammal-sized genomes; less memory is needed for smaller genomes.
• Parasol or SGE for cluster support.
• 750M disk space

Instructions

IMPORTANT NOTE: Progressive Cactus does not presently support installation into paths that contain spaces. Until this is resolved, you can use a softlink as a workaround: ln -s "path with spaces" "installation path without spaces"

In the parent directory of where you want Progressive Cactus installed:

git clone git://github.com/glennhickey/progressiveCactus.git
cd progressiveCactus
git pull
git submodule update --init
make

It is also convenient to add the location of progressiveCactus/bin to your PATH environment variable. In order to run the included tools (ex hal2maf) in the submodules/ directory structure, first source progressiveCactus/environment to load the installed environment.

If any errors occur during the build process, you are unlikely to be able to use the tool. Please submit a GitHub issue so we can help out: not only will you help yourself, but others who wish to use the tool as well.

Note that all dependencies are also built and included in the submodules/ directory. This increases the size and build time but greatly simplifies installation and version management. The installation does not create or modify any files outside the progressiveCactus/ directory.

Address of the bookmark: https://github.com/glennhickey/progressiveCactus

Positions available

Applications were invited from for the following posts in an industry sponsored project. The project entitled "OsHK3b technology and Know How", valid for a period upto February, 2018.

Post 3: Senior Research Fellow (Computational Biologist / Metabolic engineering)

Salary: As per DBT rule.

Duration: All the above posts are purely temporary and liable to be terminated at any time without prior notice or ceased/withdrawn by the funding agency.

Age limit: The upper age limit for SRF shall be 32 years, which is relaxed upto 5 years in the case of candidates belonging to Schedule Castes/Schedule Tribes, Women, Physically Handicapped and OBC applicants.

Essential Qualifications: Masters/B Tech/Mtech in Basic Sciences with at least 2yrs of research experience in Bioinformatics/Computational Biology related to Database /portal building & maintenance, high throughput data handling and analysis etc. For M.Sc/B.Tech, Published paper in peer-reviewed Journal and for M.Tech, thesis submission in computational biology is a must. Selection preference will be given to candidates with a good knowledge of Python and/or R. Knowledge of JAVA will also get a special consideration.

Desired Skills: Will be expected to manage ongoing research activities in the project, interact with Experimental group, manage the project data analysis, prepare file reports and associated project work etc. Familiarity with plant systems biology and genomics /metabolite resources related to plant metabolomics is desirable.

1. The post applied for must be clearly written on the Envelope containing the application
2. Applications received after last date shall not be entertained, School will not be responsible for any postal delay.
3. No application will be accepted via hand delivery or via e-mail. Please send printed & signed applications with detailed CV on or before 31st January, 2017 by post to the following address:

Prof. Ashwani Pareek
(Project Investigator)
Stress Physiology and Molecular Biology Laboratory (Room No-413),
School of Life Sciences,
Jawaharlal Nehru University,
New Delhi, India – 110067
Email: ashwanipareek@gmail.com

Pondicherry University, Puducherry has been identified as a nodal agency by the Department of Biotechnology, Govt. of India to coordinate this examination along with nine centres namely,

Pune University, Pune;

Anna University, Chennai;

Bose Institute, Kolkata;

Institute of Bioinformatics & Applied Biotechnology, Bangalore;

North-Eastern Hill University, Shillong, University of Hyderabad, Hyderabad;

University of Kerala, Thiruvananthapuram;

Jawaharlal Nehru University, New Delhi and

Assam Agricultural University, Guwahati. 

In the BINC 2015 and 2016 examination, 23 candidates and five candidates were certified respectively. DBT has agreed to fund Research fellowships for all the BINC qualified Indian nationals to pursue Ph.D. in Indian Institutes/Universities.

Note that the candidate must possess a postgraduate degree(or equivalent) & meet the criteria of the institutes/universities in order to avail research fellowship.

In addition, cash prize of Rs. 10,000/- will be awarded to the top 10 BINC qualifiers.

More at http://www.pondiuni.edu.in/exams/binc/

• For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.
• Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use BLAT to do this all-vs-all comparison with alignments being performed in protein space.
• Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.
• Identify cliques in this graph. These cliques are potential anchors to be used in the map.
• Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.
• The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as MAVID) to do a detailed alignment of each orthologous segment.

https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: https://www.biostat.wisc.edu/~cdewey/mercator/

Address of the bookmark: http://paintmychromosomes.com/

The purpose of the hive plot is to establish a new baseline for visualization of large networks — a method that is both general and tunable and useful as a starting point in visually exploring network structure.

More at http://www.hiveplot.com/

Address of the bookmark: http://www.hiveplot.com/

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC430967/

This software distribution includes both the DAGchainer utility and a Java-based graphical interface that allows the inputs and outputs to be navigated and interrogated dynamically.

Address of the bookmark: http://dagchainer.sourceforge.net/

Address of the bookmark: http://www.cmbb.arizona.edu/?page_id=250