github.com - The NanoPack tools are written in Python3 and released under the GNU GPL3.0 License. The source code can be found at https://github.com/wdecoster/nanopack, together with links to separate scripts and their documentation. The scripts are compatible...
Solved with perl http://rosalind.info/problems/1a/
#Find the most frequent k-mers in a string.#Given: A DNA string Text and an integer k.#Return: All most frequent k-mers in Text (in any order).use strict;use warnings;my...
github.com - Welcome to kevlar, software for predicting de novo genetic variants without mapping reads to a reference genome! kevlar's k-mer abundance based method calls single nucleotide variants (SNVs), multinucleotide variants (MNVs),...
The question at http://rosalind.info/problems/1d/
Script are moved to http://bioinformaticsonline.com/snippets/view/34633/clump-finding-problem-solved-with-perl
github.com - SCUBAT (Scaffolding Contigs Using BLAT And Transcripts) uses any set of transcripts to identify cases where a transcript is split over multiple genome fragments and attempts to use this information to scaffold the genome.
Indian Institute of Maize Research Jobs 2015 –
Sr Research Fellow & Technical Asst Posts: Indian Institute of Maize Research (IIMR), New Delhi has advertised a notification for the recruitment of Senior Research Fellow & Technical...
github.com - The major problem of scaffolding polyploid genome is that Hi-C signals are frequently detected between allelic haplotypes and any existing stat of art Hi-C scaffolding program links the allelic haplotypes together. To solve the problem, we developed...
Senior Technical Assistant
Eligibility : BE/B.Tech(CSE, ECE, IT)
Location : Pondicherry
Last Date : 26 Jun 2015
Hiring Process : Face to Face Interview
Pondicherry University - Job DetailsDate of posting:19 May 15
Senior Technical...
The Basic Local Alignment Search Tool (BLAST) is a powerful bioinformatics program used to compare an input sequence (such as DNA, RNA, or protein sequences) against a database of sequences to find regions of similarity.