BOL: Related items

DnaSP v5: a software for comprehensive analysis of DNA polymorphism data

Jit — Mon, 06 Feb 2017 04:45:37 -0600

DnaSP is a software package for a comprehensive analysis of DNA polymorphism data. Version 5 implements a number of new features and analytical methods allowing extensive DNA polymorphism analyses on large datasets. Among other features, the newly implemented methods allow for: (i) analyses on multiple data files; (ii) haplotype phasing; (iii) analyses on insertion/deletion polymorphism data; (iv) visualizing sliding window results integrated with available genome annotations in the UCSC browser.

Address of the bookmark: http://www.ub.edu/dnasp/

Ideoplot

Shruti Paniwala — Mon, 13 Feb 2017 09:47:32 -0600

Simple ideogram plotting and annotation in R.

Basic usage:

Rscript Ideoplot.R --heatmap hm.bed --annotate annotations.bed --out ideogram.pdf
-or-
Rscript Ideoplot.R --annotate annotations.bed

Options
  --ideobed, i      A bed file of reference contig lengths/chromosome names
  --heatmap, -h     Fill chromosomes with normalized heatmap
                   (described below)
  --annotate, -a    Add character annotations.
  --out, -o         PDF output name.
  --stripes, -s     Specify a file containing the layout of the
                    annotations (description below)
  --bars, -b        Add track annotations
  --reference, -f   Either hg19, or hg38
  --topdown, r      Flag, when set, flips the orientation (P arms
                    drawn on top).

Address of the bookmark: https://github.com/mchaisso/Ideoplot

ABACAS

Surabhi Chaudhary — Thu, 16 Feb 2017 12:15:55 -0600

ABACAS is intended to rapidly contiguate (align, order, orientate) , visualize and design primers to close gaps on shotgun assembled contigs based on a reference sequence. It uses MUMmer to find alignment positions and identify syntenies of assembly contigs against the reference. The output is then processed to generate a pseudomolecule taking overlaping contigs and gaps in to account. MUMmer's alignment generating programs, Nucmer and Promer are used followed by the 'delta-filter' utility function. Users could also run tblastx on contigs that are not used to generate the pseudomolecule.

Address of the bookmark: http://abacas.sourceforge.net/Manual.html#9._Colour_code

Postdoctoral Research Position in Bioinformatics in Milan

Thu, 20 Apr 2017 12:53:12 -0500

The lab of Immunobiology of Neurological Disorders has a main interest in the biological processes associated with multiple sclerosis, an inflammatory disorder of the central nervous system. The projects of interest for this application involve research on translational bioinformatics in complex human neurological disorders.

You have a PhD in Computational Science, Bioinformatics, or equivalent, and expertise in analysis and modeling of human RNA-seq data, statistics, data mining and machine learning. Excellent communication skills in English (written and oral) is a must. Flexibility and willingness to work across multiple projects and technologies in a rapidly evolving scientific context is required.
Salary will depend on qualification and experience. Starting date: immediate.

Interested candidates should send to farina.cinthia@hsr.it:

1. CV (please show evidences of relevant titles, projects, courses, references, etc.)
2. One page with a list of research topics (i.e. ongoing projects)
3. earliest availability

4. 2-3 contact names

YASRA: Reference based assembler

Abhimanyu Singh — Wed, 01 Mar 2017 08:32:45 -0600

YASRA (Yet Another Short Read Assembler) performs comparative assembly of short reads using a reference genome, which can differ substantially from the genome being sequenced. Mapping reads to reference genomes makes use of LASTZ (Harris et al), a pairwise sequence aligner compatible with BLASTZ. Special scoring sets were derived to improve the performance, both in runtime and quality for 454 and Illumina sequence reads.

YASRA uses LASTZ (http://bx.psu.edu/miller_lab for released version and http://www.bx.psu.edu/~rsharris/lastz/newer for newer version) for aligning the sequences to the reference genome. Please install LASTZ (the newest version on http://www.bx.psu.edu/~rsharris/lastz/newer) and add the LASTZ binary in your executable/binary search path before installing YASRA.

Address of the bookmark: https://github.com/aakrosh/YASRA

OrthoANI: An improved algorithm and software for calculating average nucleotide identity

Abhimanyu Singh — Wed, 12 Dec 2018 08:36:08 -0600

OAT uses OrthoANI to measure the overall similarity between two genome sequences. ANI and OrthoANI are comparable algorithms: they share the same species demarcation cut-off at 95~96% and large comparison studies have demonstrated both algorithms to produce near identical reciprocal similarities. Details of the OrthoANI algorithm is given in (Lee et al. 2015). OAT employs an easy-to-follow Graphical User Interface that allow researchers to calculate OrthoANI values between genomes of interest without unfamiliar Command Line Environments. Moreover, the OAT_cmd command-line software can be integrated into preexisting bioinformatics pipelines.

Address of the bookmark: https://www.ezbiocloud.net/tools/orthoani

Bioinformatics opening at ICGEB NEW DELHI

Thu, 02 Mar 2017 04:16:36 -0600

ICGEB NEW DELHI

Applications are invited for:

Junior Research Fellow, in a DBT funded project, is available in Translational Health Group, ICGEB, New Delhi

Qualifications:

Education: M.Sc. (preferably in Biotechnology, Life Sciences or Zoology, Chemistry, Bioinformatics). Candidates with hands on experience on GC-MS data acquisition and analysis will be given preference. Bioinformatics expertise required.

Fellowship: As per DBT guidelines.

Tenure: The position is purely on temporary basis with an initial tenure of six months and based on satisfactory performance may continue until the completion of the project.

Closing date for applications: 04/03/2017

Please send a "TWO PAGE" CV by email to: th.icgeb@gmail.com on or before the last date.

Research Associate, in a DBT funded project, is available in Translational Health Group, ICGEB, New Delhi

Qualifications:

Education: Ph.D. (in Biology, Biotechnology, Chemistry, Bioinformatics). Candidates with hands on experience on GC-MS data acquisition and analysis will be given preference.

Fellowship: As per DBT guidelines.

Tenure: The position is purely on temporary basis with an initial tenure of six months and based on satisfactory performance may continue until the completion of the project.

Closing date for applications: 04/03/2017

Please send a "TWO PAGE" CV by email to: th.icgeb@gmail.com on or before the last date.

The wavefront alignment (WFA) algorithm

BioStar — Sun, 28 Jun 2020 10:17:50 -0500

The wavefront alignment (WFA) algorithm is an exact gap-affine algorithm that takes advantage of
homologous regions between the sequences to accelerate the alignment process. As opposed to traditional dynamic programming algorithms that run in quadratic time, the WFA runs in time O(ns), proportional to the read length n and the alignment score s, using O(s^2) memory. Moreover, the WFA exhibits simple data dependencies that can be easily vectorized, even by the automatic features of modern compilers, for different architectures, without the need to adapt the code.

Address of the bookmark: https://github.com/smarco/WFA

Multi-metagenome assembly

Radha Agarkar — Fri, 03 Mar 2017 10:14:18 -0600

This project contains scripts and tutorials on how to assemble individual microbial genomes from metagenomes, as described in:

Genome sequences of rare, uncultured bacteria obtained by differential coverage binning of multiple metagenomes

Mads Albertsen, Philip Hugenholtz, Adam Skarshewski, Gene W. Tyson, Kåre L. Nielsen and Per .H. Nielsen

Nature Biotechnology 2013, doi: 10.1038/nbt.2579

Address of the bookmark: https://github.com/MadsAlbertsen/multi-metagenome

FOGSAA: Fast Optimal Global Sequence Alignment Algorithm

Jit — Fri, 08 Dec 2017 14:41:08 -0600

Sequence alignment algorithms are widely used to infer similarirty and the point of differences between pair of sequences. FOGSAA is a fast Global alignment algorithm. It is basically a branch and bound approach which starts branch expansion in a greedy way taking the symbols from the given pair of sequences (protein or nucleotide) and results in an optimal alignment faster than conventional dymanic programming techniques. It is also better than the heuristic methods with respect to alignment quality.

Address of the bookmark: http://www.isical.ac.in/~bioinfo_miu/FOGSAA.htm