BOL: Related items

Alignment of closely related whole genomes/scaffolds

Rahul Nayak — Fri, 29 Jan 2016 10:37:27 -0600

With the relative ease and low cost of current generation sequencing technologies has led to a dramatic increase in the number of sequenced genomes for species across the tree of life. This increasing volume of data requires tools that can quickly compare multiple whole-genome sequences, millions of base pairs in length, to aid in the study of populations, pan-genomes, and genome evolution.This bookmaks have been created to report new tools for whole genome alignments.

Please report new whole genome alignment tools under comment sections.

Address of the bookmark: http://www.cs.utoronto.ca/~brudno/721.full.pdf

Bergman Lab

Thu, 03 Oct 2013 17:20:09 -0500

Broad area of research:

Genome Annotation and Functional Genomics

Bergman Lab is actively engaged in the development and application of computational methods to improve the annotation of functional biological features in genome sequences. Bergman Lab work focuses on improving annotation of non-protein-coding regions of the genome including conserved noncoding sequences (CNSs), cis-regulatory modules (CRMs), transcription factor binding sites (TFBSs), transposable elements (TEs) and noncoding RNA (ncRNA) genes. Current projects include improving the (i) annotation of TEs in the fly and yeast genomes, (ii) annotation of CRMs and TFBSs in the fly genome, and (iii) analysis of transposon knockout collections in flies. Research in this area is supported by the EC FP7 programme.

Genome and Molecular Evolution
Text and Data Mining

More @ http://bergmanlab.smith.man.ac.uk/

Finishing !!

Jit — Sat, 20 May 2017 15:50:20 -0500

The process of finishing a genome and moving it from a draft stage (the result of sequencing and initial assembly) to a complete genome is typically a time and resource intensive task. The advent of new sequencing technologies has come with its own set of opportunities and pitfalls in the finishing process. While genomes can now be sequenced to high redundancy in a cost-effective manner, the process of assembling the genomes is more challenging and often draft genomes are fragmented into hundreds of contigs. Correspondingly, the task of producing the complete genome can involve months of lab work and thousands of finishing experiments and is usually done in large genome centers.

The work in our lab has focussed on computational approaches to speed-up the finishing process. Specifically, we have explored the use of optical mapping and mate-pair data to augment assemblies and direct finishing experiments. The tools developed in our lab have been used in several finishing projects, producing complete genomes (and near-complete ones) with surprisingly little computational and experimental effort (Nagarajan et al., in submission). The executables (as well as source code) for these tools are freely available here:

Scaffolding using Optical Restriction Mapping
Optical Maps are global, ordered maps of restriction site locations in a genome. This information can be quite useful in scaffolding contigs from a shotgun assembly to guide the finishing process. A set of programs to exploit optical maps for assembly can be found here: SOMA v2.0 (63 MB tar.gz file). This version of SOMA contains several improvements to programs in v1.0 as well as new scripts for working with multiple maps, contig graphs and scaffolds.
Augmenting assemblies with mate-pair data
Mate-pair information can be valuable in augmenting short-read assemblies and reconstructing the genome as larger scaffolds. AMOS-Hybrid is a pipeline written in the AMOS framework (open-source assembly tools) to merge arbitrary mated reads into an existing assembly and merge contigs and create scaffolds where possible. Source code and executables for AMOS-Hybrid are available here: AMOS-Hybrid v1.0 (142 MB tar.gz file).
Assembly and sequence-composition guided finishing
Contigs from a shotgun assembly are typically linked together in a graph structure that can serve to guide finishing and in some case close gaps in-silico. Also, in many cases, sequence composition of contigs can provide clues to fill gaps in scaffolds. A set of scripts to automate some of these tasks can be found here: Finishing Scripts v1.0 (63 MB tar.gz file).

http://www.cbcb.umd.edu/finishing/

Address of the bookmark: http://www.cbcb.umd.edu/finishing/

The anatomy of successful computational biology software

Jitendra Narayan — Thu, 10 Oct 2013 11:53:08 -0500

Creators of software widely used in computational biology discuss the factors that contributed to their success

Nature Biotechnology spoke with Altschul and several other originators of computational biology software programs widely used today (Table 1). The conversations explored what makes certain software tools successful, the unique challenges of developing them for biological research and how the field of computational biology, as a whole, can move research agendas forward. What follows is an edited compilation of interviews.

Detail @ http://www.nature.com/nbt/journal/v31/n10/full/nbt.2721.html

News Source @ Nature

PLAST: A fast, accurate and NGS scalable bank-to-bank sequence similarity search tool

Jit — Fri, 01 Dec 2017 04:10:54 -0600

PLAST is a fast, accurate and NGS scalable bank-to-bank sequence similarity search tool providing significant accelerations of seeds-based heuristic comparison methods, such as the Blast suite of algorithms.

Relying on unique software architecture, PLAST takes full advantage of recent multi-core personal computers without requiring any additional hardware devices.

PLAST stands for Parallel Local Sequence Alignment Search Tool and is was published in BMC Bioinformatics.

PLAST is a general purpose sequence comparison tool providing the following benefits:

PLAST is a high-performance sequence comparison tool designed to compare two sets of sequences (query vs. reference),
Reduces the processing time of sequences comparisons while providing highest quality results,
Contains a fully integrated data filtering engine capable of selecting relevant hits with user-defined criteria (E-Value, identity, coverage, alignment length, etc.),
Does not require any additional hardware, since it is a software solution. It is easy to install, cost-effective, takes full advantage of multi-core processors and uses a small RAM footprint,
Ready to be used on desktop computer, cluster, cloud as well as within distributed system running Hadoop.

https://plast.inria.fr/

Address of the bookmark: https://plast.inria.fr/

Network Analysis @ Indian Statistical Institute

Wed, 16 Oct 2013 08:06:50 -0500

Indian Statistical Institute Kolkata invites applications for the following posts

2013 Oct Advertisement from Indian Statistical Institute

Post: Network Analysis

No. of Positions: 01

Educational Qualifications:

Candidate should have passed BE/B.Tech Or Equivalent in Computer Science / Electrical Engineering / Electronics / Information Technology / Bioinformatics / Biotechnology with throughout first Class
Experience:

(details of experience required)
Pay Scale: INR Rs.16000-20000/-P.M.

Walk-In-Interview : 22 Oct 2013 at 10:30 AM

Download Official Notification:
http://www.isical.ac.in/JobApplicationFiles/MIU_0310201311433700.pdf

MIX: Combining multiple assemblies from NGS data

Rahul Nayak — Tue, 08 May 2018 04:58:05 -0500

Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length.

The Mix algorithm, approach and results were published in BMC bioinformatics : http://www.biomedcentral.com/1471-2105/14/S15/S16.

Address of the bookmark: https://github.com/cbib/MIX

Troyanskaya Lab

Fri, 18 Oct 2013 10:57:40 -0500

In our research, we combine computational methods with an experimental component in a unified effort to develop comprehensive descriptions of genetic systems of cellular controls, including those whose malfunctioning becomes the basis of genetic disorders, such as cancer, and others whose failure might produce developmental defects in model systems.

Research Interest
Genomic Data Integration

Microarray Analysis

Gene and Protein Function Prediction

Detection and Analysis of Chromosomal Abnormalities and Functional Evolution

Integration of Computation and Experiments

Identification of Biological Networks and Pathways

Evaluation and Validation of Computational Predictions

Scalable Visualization-Based Data Analysis

More @ http://reducio.princeton.edu/cm/
PI page @ http://reducio.princeton.edu/cm/ogt

HALC: High throughput algorithm for long read error correction

Jit — Fri, 08 Jun 2018 10:47:41 -0500

HALC, a high throughput algorithm for long read error correction. HALC aligns the long reads to short read contigs from the same species with a relatively low identity requirement so that a long read region can be aligned to at least one contig region, including its true genome region’s repeats in the contigs sufficiently similar to it (similar repeat based alignment approach) HALC was able to obtain 6.7-41.1% higher throughput than the existing algorithms while maintaining comparable accuracy. The HALC corrected long reads can thus result in 11.4-60.7% longer assembled contigs than the existing algorithms.

Address of the bookmark: https://github.com/lanl001/halc

Assistant Professor in Molecular Synthesis for Drug Discovery and Development @ CBMR, Lucknow

Wed, 30 Oct 2013 06:42:27 -0500

ADVERTISEMENT FOR FACULTY POSITIONS AT CENTRE OF BIOMEDICAL RESEARCH (CBMR), LUCKNOW

Details of the Positions and Pay Structure:

03 Posts for Assistant Professor in Molecular Synthesis for Drug Discovery and Development

Essential Qualifications and Requirements:

1. PhD in Synthetic Organic Chemistry/Medicinal Chemistry with research publications in high quality international journals and first class grade at the preceding degree from recognised University/Institute in India or abroad with consistently good academic record.
2. Three Yrs of Post-doctoral experience in relevant area.
3. Below 35 Yrs of age at the time of application

Desirable Experience: Candidates having strong research background in organic synthesis, total synthesis of structurally complex and medicinally important natural products/drugs related to cancer, neurodegenerative diseases (neurotropically active molecules for Alzheimer's, Parkinson’s, dementia etc) and infectious diseases such as malaria, TB etc. will be preferred.

Interested candidates may apply with:

1. Filled up Application Form (download from CBMR Website: http://www.cbmr.res.in) along with the Cover Letter, Curriculum Vitae including academic record (Bachelor degree onwards), awards, honours, list of Publications and reprints of 5 best publications.
2. Proposed research plan (max 3-4 pages).
3. Names and address (with valid e-mail and Phone number) of at least 3 academic referees.
4. Online Payment Receipt with transaction reference no. of Rs. 1000/- (USD 100 or equivalent foreign currency) on following details.
Account Number: 30054847814 Name: Director, Centre of Biomedical Research
Bank: STATE BANK OF INDIA, SGPGI Campus Branch, LUCKNOW

IFSC Code: SBIN0007789
MICR No: 22602034

Applications can be sent by registered/speed post or by e-mail to the following address:

The Director,
Centre of Biomedical Research (CBMR),
Sanjay Gandhi PGI Campus,
Raebareli Road, Lucknow-226014
e-mail: cbmr.admin@cbmr.res.in,
gp.pandey@cbmr.res.in

More Info:

http://www.cbmr.res.in/career/Advertisement%20for%20the%20post%20of%20Professors%20and%20Assistant%20Professors.pdf