BOL

clark.cs.ucr.edu - CLARK, a method based on a supervised sequence classification using discriminative k-mers. Considering two distinct specific classification problems (see the article for details), namely (1) the taxonomic classification of metagenomic reads to...

github.com - RNA-Bloom is a fast and memory-efficient de novo transcript sequence assembler. It is designed for the following sequencing data types: single-end/paired-end bulk RNA-seq (strand-specific/agnostic) paired-end single-cell RNA-seq...

Research Associate/JRF/SRF position, DBT Sponsored Bioinformatics Infrastructure Facility Applicants should hold a PhD or a first class MSc/MTech degree in Bioinformatics of Biotechnology/Life Sciences; experience in using bioinformatics tools,...

github.com - MMseqs2 (Many-against-Many sequence searching) is a software suite to search and cluster huge protein and nucleotide sequence sets. MMseqs2 is open source GPL-licensed software implemented in C++ for Linux, MacOS, and (as beta version, via cygwin)...

D. No. 1-121/1, 4th and 5th Floors, Axis Clinicals Building, Miyapur, Hyderabad, Telangana, India- 500 049 Email: admin@niab.org.in Telephones: +91 40 2304 9403 Telefax: +91 40 2304 2740 Advertisement No: 5/2014 About NIAB National Institute...

compbio.case.edu - Seal is a comprehensive sequencing simulation and alignment tool evaluation suite. This software (implemented in Java) provides several utilities that can be used to evaluate alignment algorithms, including: Reading a pre-existing reference...

Biomedical Informatics Centre, PGIMER, Chandigarh invites application for a project dissertation program for students who have completed their first year of M.Sc. in Bioinformatics. This is an exciting opportunity for Master's students to train...

github.com - gfastats is a single fast and exhaustive tool for summary statistics and simultaneous *fa* (fasta, fastq, gfa [.gz]) genome assembly file manipulation. gfastats also allows seamless fasta<>fastq<>gfa[.gz]...

BBSplit internally uses BBMap to map reads to multiple genomes at once, and determine which genome they match best. This is different than with ordinary mapping. If a genome (say, human) contains an exact repeat somewhere, reads mapping to it will...

My research group consists primarily of computer science graduate students and postdocs with expertise in algorithms, statistical inferences and machine learning, and sharing a passion for understanding fundamental biological problems. We work in...