BOL: Related items

PhD opportunity at Université de Liège - Belgium

Sat, 02 Aug 2014 01:12:43 -0500

PhD opportunity at Université de Liège - Belgium

The Bioinformatics and Systems Biology Unit of Université de Liège (Belgium) is looking for a highly motivated master student with programming skills for a PhD thesis project (4 years, fully funded) with the goal of designing computational tools that use literature, genomic and structural data in order to infer regulatory and metabolic networks.

Applicants are invited to send their resume and a recommendation letter to Prof. Patrick Meyer (more details at www.biosys.ulg.ac.be )

For more information : www.biosys.ulg.ac.be

ACANA: An accurate and consistent alignment tool for DNA sequences

Jit — Wed, 06 Dec 2017 09:45:29 -0600

ACANA is an accurate and consistent alignment tool for DNA sequences. ACANA is specifically designed for aligning sequences that share only some moderately conserved regions and/or have a high frequency of long insertions or deletions. It attempts to combine the best of local and global alignments algorithms in searching for evolutionarily related regions of sequences in order to achieve the best alignment. ACANA is also robust to the small changes of alignment parameters, particularly the gap extension score. As an accurate alignment tool, ACANA is particularly useful in comparative sequence analysis for identifying conserved functional regulatory elements.

Address of the bookmark: https://www.niehs.nih.gov/research/resources/software/biostatistics/acana/index.cfm

MEGADOCK 4.0

Suleman Khan — Thu, 07 Aug 2014 18:08:54 -0500

An ultra–high-performance protein–protein docking software for heterogeneous supercomputers

Summary: The application of protein–protein docking in large-scale interactome analysis is a major challenge in structural bioinformatics and requires huge computing resources. In this work, we present MEGADOCK 4.0, an FFT-based docking software that makes extensive use of recent heterogeneous supercomputers and shows powerful, scalable performance of over 97% strong scaling.

Availability and Implementation: MEGADOCK 4.0 is written in C++ with OpenMPI and NVIDIA CUDA 5.0 (or later) and is freely available to all academic and non-profit users at: http://www.bi.cs.titech.ac.jp/megadock.

Contact: akiyama@cs.titech.ac.jp

Address of the bookmark: http://bioinformatics.oxfordjournals.org/content/early/2014/08/06/bioinformatics.btu532.short

SMASH: An alignment-free tool to find and visualise rearrangements between pairs of DNA sequences

Jit — Thu, 21 Dec 2017 08:26:57 -0600

SMASH is a completely alignment-free method to find and visualise rearrangements between pairs of DNA sequences. The detection is based on relative compression, namely using a FCM, also known as Markov model, of high context order (typically 20). The method has been approached with a tool (also called SMASH). For visualization, SMASH outputs a SVG image, with an ideogram output architecture, where the patterns are represented with several HSV values (only value varies). The following image, illustrating the information maps between human and chimpanzee for the several chromosomes, depicts an example:

Address of the bookmark: https://github.com/pratas/smash

GrapheR !!!

John Parker — Thu, 14 Aug 2014 14:02:17 -0500

What a wonderful gem GrapheR is.... Oh yes it is. GrapheR is a GUI for base graphics in R by http://www.maximeherve.com/. The package provides a graphical user interface for creating base charts in R. It is ideal for beginners in R, as the user interface is very clear and the code is written along side into a text file, allowing users to recreate the charts directly in the console.

Adding and changing legends? Messing around with the plotting window settings? It is much easier/quicker with this GUI than reading the help file and trying to understand the various parameters.
Here is a little example using the iris data set.

library(GrapheR)
data(iris)
run.GrapheR()

This will bring up a window that helps me to create the chart and tweak the various parameters.

Finally, I find the underlying R code in a file created by GrapheR. For more details read also the package vignette, which is available in English, French and German!

Heap: a highly sensitive and accurate SNP detection tool for low-coverage high-throughput sequencing data

Jit — Thu, 19 Apr 2018 08:06:03 -0500

Heap, that enables robustly sensitive and accurate calling of SNPs, particularly with a low coverage NGS data, which must be aligned to the reference genome sequences in advance. To reduce false positive SNPs, Heap determines genotypes and calls SNPs at each site except for sites at the both end of reads or containing a minor allele supported by only one read. Performance comparison with existing tools showed that Heap achieved the highest F-scores with low coverage (7X) restriction-site associated DNA sequencing reads of sorghum and rice individuals. This will facilitate cost-effective GWAS and GP studies in this NGS era. Code and documentation of Heap are freely available from https://github.com/meiji-bioinf/heap and our web site (http://bioinf.mind.meiji.ac.jp/lab/en/tools.html).

Address of the bookmark: https://github.com/meiji-bioinf/heap

pybedtools

Shruti Paniwala — Wed, 20 Aug 2014 01:03:41 -0500

pybedtools is a Python wrapper for Aaron Quinlan's BEDtools programs (https://github.com/arq5x/bedtools), which are widely used for genomic interval manipulation or "genome algebra". pybedtools extends BEDTools by offering feature-level manipulations from with Python. See full online documentation, including installation instructions, at http://pythonhosted.org/pybedtools/.

More at http://pythonhosted.org/pybedtools/

A powerful toolset for genome arithmetic.http://code.google.com/p/bedtools/

BFC: a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data

Jit — Thu, 31 May 2018 09:35:23 -0500

BFC is a standalone high-performance tool for correcting sequencing errors from Illumina sequencing data. It is specifically designed for high-coverage whole-genome human data, though also performs well for small genomes. The BFC algorithm is a variant of the classical spectrum alignment algorithm introduced by Pevzner et al (2001). It uses an exhaustive search to find a k-mer path through a read that minimizes a heuristic objective function jointly considering penalties on correction, quality and k-mer support. This algorithm was first implemented in my fermi assembler and then refined a few times in fermi, fermi2 and now in BFC. In the k-mer counting phase, BFC uses a blocked bloom filter to filter out most singleton k-mers and keeps the rest in a hash table (Melsted and Pritchard, 2011). The use of bloom filter is how BFC is named, though other correctors such as Lighter and Bless actually rely more on bloom filter than BFC. https://github.com/lh3/bfc

Address of the bookmark: https://github.com/lh3/bfc

SALSA: A tool to scaffold long read assemblies with Hi-C

Jit — Fri, 15 Jun 2018 04:01:15 -0500

This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch. To use the latest version, first run the following commands: cd SALSA make To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2). If you consider using this tool, please cite our publication which describes the methods used for scaffolding. Ghurye, J., Pop, M., Koren, S., Bickhart, D., & Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).

Address of the bookmark: https://github.com/machinegun/SALSA

Bioinformatics JRF/SRF position at IARI

Thu, 04 Sep 2014 04:14:01 -0500

DIVISION OF NEMATOLOGY
INDIAN AGRICULTURAL RESEARCH INSTITUTE
NEW DELHI 110012
Applications are invited for the posts of one Junior
Research Fellow and one RA in the DBT funded project entitled “ Plant parasitic nematode genome informatics - insilico resource development”. The project is for a period of three years.

Essential qualifications for JRF
: M. Sc. in Bioinformatics with experience in Proteomics, genomics and structural biology. Knowledge of programming language, pearl and database – HTML, CSS,php and Java script.
Essential qualifications for Research Associate:
MSc/MTech in Bioinformatics with three years experience or Ph.D in Bioinformatics with experience in proteomics, genomics and structural biology. Knowledge of programming language, perl and database
– HTML, CSS, Java script. NGS sequence assembly and analysis and algorithm designing.
Age limit : 35 years maximum (5 year relaxation for SC/ST and women candidates)
Emoluments:
JRF: 16,000 + 30% HRA
.
Res Assoc: Rs22,000 + 30% HRA
The post is purely temporary in nature and is co-terminus with the project. The appointment would be initially for one year and may be extended further upon satisfactory performance.
Interested candidates
should send the duly filled application forms (format in the following page ) so as to reach on or before 20.9.2014 along with all the relevant documents.

More at http://www.iari.res.in/files/JRF_RA-03092014-20140903-135319.pdf