ADVERTISEMENT NO. 03/2014

PRINCIPAL SCIENTIST

Pay Band: Minimum pay of `43,000 in the PB-4 of `37400-67000/- + RGP of `10,000/-.

Age: The candidates must not have attained the age of 52 years as on 19.01.2015. There shall be no age limit for the Council’s employees.

ICAR-Indian Institute for Agricultural Biotechnology, (IIAB) Ranchi (Jharkhand)

151. Principal Scientist (Bioinformatics) (One post)

SENIOR SCIENTIST/PROGRAMME COORDINATOR

Pay Band: PB-4 of ` 37400-67000/- + RGP of ` 9,000/-.

Age: The candidates must not have attained the age of 47 years as on 19.01.2015. There shall be no age limit for the Council’s employees.

National Institute of Biotic Stress Management, Raipur (Chhattishgarh)

166. Senior Scientist (Bioinformatics) (One post)

IMPORTANT NOTE
I. (i) CLOSING DATE

THE CLOSING DATE FOR RECEIPT OF APPLICATIONS IN AGRICULTURAL SCIENTISTS RECRUITMENT BOARD IS 19.01.2015 (For applications posted from abroad and in the Andaman and Nicobar Islands, Lakshdweep, Minicoy and Amindivi islands, States/ Union Territories in the North-Eastern Region, Ladakh Division of J & K State, Sikkim, Pangi, Sub-division of Chamba, Lahul and Spiti Districts of Himachal Pradesh, the last date for receipt of application will be 02.02.2015). Non receipt of the application by the closing date will result in rejection of the application.

More Info: http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf

Take a look at the PRICE software from the DeRisi lab. Its meant to do something very similar. http://derisilab.ucsf.edu/index.php?page=software

You could also look at SSPACE (http://www.baseclear.com/landingpages/basetools-a-wide-range-of-bioinformatics-solutions/sspacev12/), ATLAS tools (http://www.hgsc.bcm.tmc.edu/content/bcm-hgsc-software), and SCARPA (http://compbio.cs.toronto.edu/hapsembler/scarpa.html).

See the PAGIT protocol: http://www.sanger.ac.uk/resources/software/pagit/

In particular, take a look at the IMAGE tool: http://genomebiology.com/2010/11/4/R41

Also SOAPdenovo has ha function for scaffolding. Not sure about ABYSS

Here there is a useful explanation of several tools.

https://bioinformaticsonline.com/search?q=scaffolding&entity_type=object&entity_subtype=bookmarks&offset=0&search_type=entities

I could be wrong, but the above answers to your hypothetical scenario appear to miss the point that you aren't interested in assembling the full genome, just the 100 kb part you're interested in. I suggest the following algorithm:

1. Start with the initial assembly C0 of the contigs you have identified as overlapping your region of interest, and the set S of reads those contigs contain. Let C = C0.

2. Repeat:
a. Identify paired-end reads (not in C) for which one or both ends align within, or extending, contigs in C.
b. Identify unpaired reads that align extending these new paired-end reads.
c. Construct a new assembly C' from C and the new reads identified in (a) and (b).
d. Trim C' so it does not extend more than 100 kb to either end of C0. Set C = C'.
e. Let S' denote the reads that contribute to C'. If S' does not contain any reads not present in S, stop. Otherwise, Set S = S'.

3. If you don't have a complete assembly of the region of interest, generate an STS for each end of each contig, probe a library for clones including these STSes, subclone these clones into a paired-end sequencing vector, and generate paired-end reads for this library; then try steps (1) and (2) again, adding these new sequencing reads to what you had before.

4. If your average sequencing depth for the region of interest exceeds 25 or so without filling all gaps, it is likely that the remaining gaps represent sequences that are not getting cloned in your sequencing vectors. Try different sequencing vectors.

More at https://dahak-metagenomics.github.io/dahak/

Address of the bookmark: https://github.com/dahak-metagenomics/dahak

Reference:

https://www.pacb.com/blog/young-investigators-share-stellar-science-career-advice-and-bioinformatics-tools-at-smrt-leiden-2021/

Reference

http://blog.bina.com/news/bina-technologies-acquired-by-roche?&__hssc=109677338.1.1419953400266&__hstc=109677338.b8350f2729889b08f1325906d5236cd3.1419953400266.1419953400266.1419953400266.1&hsCtaTracking=96cac941-9372-4bbf-bacb-3ca6f1ff8cfd|3fce0f18-835b-4086-9345-388880861732

http://www.the-scientist.com/?articles.view/articleNo/41750/title/Roche-Buys-Bioinformatics-Firm/

Variant calling and/or genotyping

• DiscoSNP++ and discoSnpRAD: Reference-free small variant discovery (SNPs and indels)
• MindTheGap: Detection and assembly of large insertion variants
• TakeABreak: reference-free inversion discovery tool
• SVJedi: Structural Variant genotyper with long read data
• SVJedi-graph: Structural Variant genotyper with long read data using a variation graph

Sequence assembly

• MinYS: reference-guided genome assembly in metagenomics data
• MTG-link: local assembly tool for linked-read data
• Minia: De novo short read assembler
• de-novo pipeline: de-novo assembly pipeline (error correction / contigs / scaffolding) for genomes and meta-genomes
• Mapsembler2: Targeted assembly (not maintained)

Managing k-mers & indexation

• findere: simple strategy for speeding up queries and for reducing false positive calls from any Approximate Membership Query data structure.
  • fimpera extends findere adding the abundance information.
• kmtricks: modular tool suite for counting kmers, and constructing Bloom filters or kmer matrices, for large collections of sequencing data.
• kmindex is a tool for indexing and querying sequencing samples. It is built on top of kmtricks.
• back to sequences: Find sequences (reads, unitigs, genes) related to a set of kmers in large datasets, in a matter of seconds.
• Backpack Quotient Filter: k-mer indexing data structure with abundance
• short read connector: Detect similar reads from potentially large read set
• DSK: Count K-mer in sequences

Pangenome graph manipulation

• Pancat: Pangenome Comparison and Analysis Toolkit
• GFAGraphs: a Python library to handle pangenome graph files in GFA format.

Comparative metagenomics with k-mers

• Simka and SimkaMin: Comparative metagenomics for large-scale datasets
• Comparead & Commet: comparison of metagenomic datasets

Species and bacterial strains identification

• ORI: software using long nanopore reads to identify bacteria present in a sample at the strain level
• StrainFLAIR: STRAIN-level proFiLing using vArIation gRaph

General-purpose sequencing data manipulation

• GASSST: long read mapper
• Leon: short read compressor (now included in GATB-core)
• Bloocoo: short read corrector
• BCALM: Construct compacted de Bruijn graphs (unitigs)

 Protein Structure

• A_Purva: Contact Map Overlap solver
• MD-Jeep: Distance Geometry solver
• CSA: Comparative Structural Alignment

Workflow

• SLICEE: parallel execution of bioinformatics workflows

Comparative Genomics

• CASSIS: detection of rearrangement breakpoints
• PLAST: intensive bank-to-bank sequence comparison
• DRJBreakpointFinder: detection and precise localization of excision sites in proviral segments

Back in August, van Rossum published a proposal on the Python mailing list recommending type-checking annotations as a valuable feature for the next version of Python to improve the performance of editors and IDEs, linter capabilities, standard notation, and refactoring. Van Rossum’s latest proposal, posted late last month, outlined plans to publish a Python Enhancement Proposal (PEP) in early January to put the feature now known as type hinting on track for inclusion in Python 3.5, slated for release this September.

Reference

https://quip.com/r69HA9GhGa7J

The role sits at the critical interface between genetics and cancer systems biology, and would suit a candidate who is interested in developing a career at the confluence of Statistics/Data Mining/Machine Learning and Biology. Ideally, you will have experience in development of analytical approaches to high-throughput and multivariate data mining and integration gained through a PhD (or equivalent) in a quantitative subject (eg mathematics, statistics, physics, engineering or computer science).

Experience of statistics and/or machine learning techniques is highly desirable as is evidence of prior experience of developing bioinformatics software and/or analysing complex *omics data sets. You will be able to work as part of a team and independently and deliver results to the required standard and schedule. You should be able to organise and prioritise your own work, as well as have excellent communication skills, both written and oral. The post will involve interactions with collaborators from such diverse fields as applied mathematics, statistics, computer science and medicine.

This is a full-time post, fixed-term until 31 March 2017. For informal enquiries, contact Dr Anastasia Samsonova (bioinformatics@oncology.ox.ac.uk).

All applicants must complete a short application form and upload a CV and supporting statement.

The closing date for applications is 12.00 noon on 26 January 2015.

More at https://www.recruit.ox.ac.uk/pls/hrisliverecruit/erq_jobspec_version_4.display_form