CPAT - https://github.com/liguowang/cpat, http://lilab.research.bcm.edu/ (web server)

CPC2 - https://github.com/gao-lab/CPC2_standalone, http://cpc2.gao-lab.org/ (web server)

Infernal - http://eddylab.org/infernal/, https://github.com/EddyRivasLab/infernal

NCBI RefSeq - https://www.ncbi.nlm.nih.gov/refseq/

Rfam - http://rfam.xfam.org/, https://docs.rfam.org/en/latest/index.html

SILVA - https://www.arb-silva.de/

RNAmmer - http://www.cbs.dtu.dk/services/RNAmmer/ (web server, standalone download link)

• BigDataScript – A cross-system scripting language for working with big data pipelines in computer systems of different sizes and capabilities. [ paper-2014 | web ]
• Bpipe – A small language for defining pipeline stages and linking them together to make pipelines. [ web ]
• Common Workflow Language – a specification for describing analysis workflows and tools that are portable and scalable across a variety of software and hardware environments, from workstations to cluster, cloud, and high performance computing (HPC) environments. [ web ]
• Cromwell – A Workflow Management System geared towards scientific workflows. [ web ]
• Galaxy – a popular open-source, web-based platform for data intensive biomedical research. Has several features, from data analysis to workflow management to visualization tools. [ paper-2018 | web ]
• Nextflow (recommended) – A fluent DSL modelled around the UNIX pipe concept, that simplifies writing parallel and scalable pipelines in a portable manner. [ paper-2018 | web ]
• Ruffus – Computation Pipeline library for python widely used in science and bioinformatics. [ paper-2010 | web ]
• SeqWare – Hadoop Oozie-based workflow system focused on genomics data analysis in cloud environments. [ paper-2010 | web ]
• Snakemake – A workflow management system in Python that aims to reduce the complexity of creating workflows by providing a fast and comfortable execution environment. [ paper-2018 | web ]
• Workflow Descriptor Language – Workflow standard developed by the Broad. [ web ]

7th ADVERTISEMENT – 2014 (2)

INSPIRE Faculty Scheme: a component of “Assured Opportunity for Research Career (AORC)” under INSPIRE.

The Department of Science and Technology, Government of India, has launched the “Innovation in Science Pursuit for Inspired Research (INSPIRE)” [http://www.inspire-dst.gov.in] program in 2008.

The program aims to attract talent for study of science and careers with research. INSPIRE includes many components. The importance of Assured Career Opportunity in R&D sector has been recognized.

INSPIRE Faculty Scheme opens up an “Assured Opportunity for Research Career (AORC)” for young researchers in the age group of 27-32 years. It offers a contractual research awards to young achievers and opportunity for independent research in the near term and emerge as a future leader in the long term.

Eligibility

Essential Indian citizens and people of Indian origin including NRI/PIO status with PhD (in science, mathematics, engineering, pharmacy, medicine, and agriculture related subjects) from any recognized university in the world,

Those who have submitted their PhD Theses and are awaiting award of the degree are also
eligible. However, the award will be conveyed only after confirmation of the awarding the
PhD degree.

The upper age limit as on 1st July 2014 should be 32 years for considering support for a
period of 5 years. However, for SC and ST candidates, upper age limit will be 35 years.

Publication(s) in highly reputed Journals demonstrating research potential of the candidate.

Desirable

Candidates who are within top 1% at the School Leaving Examination, IIT-JEE rank, 1st Rank Holder either in graduation or post-graduation level university examination (which are used presently for identifying INSPIRE Scholars at under-graduate level and INSPIRE Fellows for doctoral degree)

More at http://www.inspire-dst.gov.in/faculty_scheme.html

This package is a loose collection of scripts. To run the correction
routine see the section below. Descriptions of the other scripts
are at the bottom of this file.

Contact: gurtowsk@cshl.edu

In short, the correction algorithm takes as input the unitigs from a short read assembly and uses them to correct long read data. More background information for the algorithm can be found:
http://schatzlab.cshl.edu/presentations/2013-06-18.PBUserMeeting.pdf

Address of the bookmark: https://github.com/jgurtowski/ectools

Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence. 

Address of the bookmark: https://sourceforge.net/projects/metassembler/?source=directory

More at https://attendee.gotowebinar.com/register/8452228815737989634

It installs in any computer even if you don't have administrator rights!

Address of the bookmark: http://www.dnabaser.com/download/DNA-Counter/index.html

Interested candidates may email their resume along with a cover letter to careers@arraygen.com

Official website: http://www.arraygen.com/

Computational methods used by the Shasta assembler include:

• Using a run-length representation of the read sequence. This makes the assembly process more resilient to errors in homopolymer repeat counts, which are the most common type of errors in Oxford Nanopore reads.
• Using in some phases of the computation a representation of the read sequence based on markers, a fixed subset of short k-mers (k ≈ 10).

More at https://chanzuckerberg.github.io/shasta/index.html

Address of the bookmark: https://github.com/chanzuckerberg/shasta