BOL: Related items

BRIG

Jit — Thu, 16 Feb 2017 13:14:25 -0600

BRIG is a free cross-platform (Windows/Mac/Unix) application that can display circular comparisons between a large number of genomes, with a focus on handling genome assembly data. The application is available at:http://sourceforge.net/projects/brig

If you have any questions or comments, post them on one of the trackers on BRIG’s SourceForge page:http://sourceforge.net/tracker/?group_id=328245.

Features:

Images show similarity between a central reference sequence and other sequences as concentric rings.
BRIG will perform all BLAST comparisons and file parsing automatically via a simple GUI.
Contig boundaries and read coverage can be displayed for draft genomes; customized graphs and annotations can be displayed.
Using a user-defined set of genes as input, BRIG can display gene presence, absence, truncation or sequence variation in a set of complete genomes, draft genomes or even raw, unassembled sequence data.
BRIG also accepts SAM-formatted read-mapping files enabling genomic regions present in unassembled sequence data from multiple samples to be compared simultaneously

Address of the bookmark: http://brig.sourceforge.net/

J-Circos

Shruti Paniwala — Fri, 17 Feb 2017 09:06:54 -0600

Circos plot tool (J-Circos) that is an interactive visualization tool that can plot Circos figures, as well as being able to dynamically add data to the figure, and providing information for specific data points using mouse hover display and zoom in/out functions. J-Circos uses the Java computer language to enable it to be used on most operating systems (Windows, MacOS, Linux). Users can input data into J-Circos using flat data formats, as well as from the GUI. J-Circos will enable biologists to better study more complex chromosomal interactions and fusion transcripts that are otherwise difficult to visualize from next-generation sequencing data.

Address of the bookmark: http://www.australianprostatecentre.org/research/software/jcircos

bedtools

Jit — Fri, 24 Feb 2017 04:50:44 -0600

Collectively, the bedtools utilities are a swiss-army knife of tools for a wide-range of genomics analysis tasks. The most widely-used tools enable genome arithmetic: that is, set theory on the genome. For example, bedtools allows one tointersect, merge, count, complement, and shuffle genomic intervals from multiple files in widely-used genomic file formats such as BAM, BED, GFF/GTF, VCF. While each individual tool is designed to do a relatively simple task (e.g., intersect two interval files), quite sophisticated analyses can be conducted by combining multiple bedtools operations on the UNIX command line.

bedtools is developed in the Quinlan laboratory at the University of Utah and benefits from fantastic contributions made by scientists worldwide.

Address of the bookmark: http://bedtools.readthedocs.io/en/latest/index.html

FinisherSC: a repeat-aware and scalable tool for upgrading de novo assembly using long reads

Jit — Mon, 27 Feb 2017 09:49:45 -0600

FinisherSC, a repeat-aware and scalable tool for upgrading de novo assembly using long reads. Experiments with real data suggest that FinisherSC can provide longer and higher quality contigs than existing tools while maintaining high concordance.

Address of the bookmark: http://kakitone.github.io/finishingTool/

Bioinformatics walk-in-interview at Tezpur University

Thu, 02 Mar 2017 04:24:46 -0600

A walk-in-interview will be held on 09 March, 2017, 11.15 a.m. at the office of the Head, Department of Computer Science and Engineering, Tezpur University for one (01) temporary position of Junior Research Fellow (JRF) in the DBT, Govt. of India sponsored project entitled “Integrating genome scale metabolic analysis of model plant pathogen Ralstonia solanacearum with RNAseq and fluxomics” under Dr. Siddhartha Sankar Satapathy (ssankar@tezu.ernet.in), Associate Professor, Department of Computer Science and Engineering, Tezpur University.

Interested candidates may appear before the interview board with original documents from 10th standard onwards and photocopies of mark sheets, certificates, testimonials, caste certificate (if applicable), experience certificate certificates of NET/GATE/BET or similar examination qualifications, any other testimonials and a copy of recent curriculum vitae (CV) on the day of interview.

Essential qualification: M.Tech. in CSE/IT (With specialization in Computational Biology/Bioinformatics) or M.Sc. in Bioinformatics/Biosciences/Molecular Biology Biotechnology preferably with NET/GATE/BET.

Candidates should have minimum 55 % mark both in 10th and 10+2 Science examinations and mathematics at 10+2 Science.

Desirable: Preference will be given to the candidates having experience in computational analysis of genome sequences or similar projects.

Remuneration: Rs. 25,000/- (Rupees twenty five thousand) only + HRA as admissible per month for the 1st two years and Rs. 28,000/- (Rupees twenty eight thousand) only + HRA as admissible per month for the 3rd year for SRF and applicable to the candidate having post graduate degree in Basic Science with NET/GATE/BET qualification or post graduate degree in professional course. Rs. 12,000/- (Rupees twelve thousand) only + HRA as admissible per month for the 1st two years and Rs. 14,000/- (Rupees fourteen thousand) only + HRA as admissible per month for the 3 rd year for SRF, for the candidate without NET/GATE/BET qualification. HRA will not be provided if campus accommodation is availed.

Age: Candidate shall not be more than 28 years of age on the date of interview. Upper age limit may be relaxed up to 5 years in the case of candidate belonging to SC/ST/ OBC/Women/Differently abled.

Duration: Three (03) years or till completion of the project or until further order, whichever is earlier.

N.B. No TA/DA will be paid to the candidates for attending the interview. For further details please contact: Dr. S. S. Satapathy Associate Professor Department of Computer Science and Engineering Tezpur University, Napaam-784028 Email: ssankar@tezu.ernet.in Contact no.: +91-9435979648

More Info: www.tezu.ernet.in/ProjectWalkin/Advt-DoRD-CSE-SSS-20-295-188-A.pdf

MetaBAT: An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities

Jit — Mon, 06 Mar 2017 03:44:34 -0600

MetaBAT, An Efficient Tool for Accurately Reconstructing Single Genomes from Complex Microbial Communities

Grouping large genomic fragments assembled from shotgun metagenomic sequences to deconvolute complex microbial communities, or metagenome binning, enables the study of individual organisms and their interactions. Here we developed an automated metagenome binning software, called MetaBAT, which integrates empirical probabilistic distances of genome abundance and tetranucleotide frequency. Tested on both synthetic and real metagenome datasets, MetaBAT outperforms alternative methods in both accuracy and computational efficiency. Applying MetaBAT to an assembly from 1,704 human gut samples formed 1,634 genome bins (>200kb) in 3 hours, where 621 genome bins are >50% complete with <5% contamination from other species. Further analysis shows that the quality of these genome bins approaches manually curated genomes.

Address of the bookmark: https://bitbucket.org/berkeleylab/metabat

Basics of BLAST Programs !

BioStar — Fri, 26 Jul 2024 06:04:26 -0500

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. Developed by the National Center for Biotechnology Information (NCBI), BLAST is widely used for identifying species, finding functional and evolutionary relationships between sequences, and predicting the function of novel sequences.

Key Features of BLAST:
1. Sequence Comparison: BLAST searches for local alignments between the query sequence and sequences in a database. It identifies regions of similarity, which can help infer functional and evolutionary relationships.

2. Speed and Efficiency: BLAST uses heuristic algorithms, making it faster than exhaustive search methods, suitable for large-scale database searches.

3. Versatility: There are several versions of BLAST for different types of sequence comparisons:
- blastn: Compares a nucleotide query sequence against a nucleotide sequence database.
- blastp: Compares a protein query sequence against a protein sequence database.
- blastx: Compares a nucleotide query sequence translated in all reading frames against a protein sequence database.
- tblastn: Compares a protein query sequence against a nucleotide sequence database translated in all reading frames.
- tblastx: Compares the six-frame translations of a nucleotide query sequence against the six-frame translations of a nucleotide sequence database.

4. Scoring and E-value: BLAST results are scored based on the quality and length of the alignments. The E-value (expect value) indicates the number of alignments one can expect to find by chance, with lower E-values representing more significant matches.

5. Output Formats: BLAST provides results in various formats, including plain text, HTML, XML, and JSON, making it adaptable for different types of analyses and integrations with other tools.

Applications of BLAST:
- Genomic Research: Identifying genes, understanding genetic diversity, and mapping genome sequences.
- Protein Function Prediction: Inferring the function of unknown proteins by comparing them to known protein sequences.
- Evolutionary Studies: Exploring evolutionary relationships between organisms by comparing their genetic material.
- Medical Research: Identifying pathogens, understanding disease mechanisms, and developing treatments by comparing sequences of interest.

Overall, BLAST is an essential tool in bioinformatics, offering a reliable and efficient way to analyze and interpret biological sequence data.

COCACOLA (binning metagenomic contigs using sequence COmposition, read CoverAge, CO-alignment, and paired-end read LinkAge)

Jit — Tue, 07 Mar 2017 08:50:57 -0600

COCACOLA is a general framework that combines different types of information: sequence COmposition, CoverAge across multiple samples, CO-alignment to reference genomes and paired-end reads LinkAge to automatically bin contigs into OTUs. Furthermore, COCACOLA seamlessly embraces customized prior knowledge to facilitate binning accuracy.

News: Python version of COCACOLA is available now!

Address of the bookmark: https://github.com/younglululu/COCACOLA

Selecting between Python 2 and Python 3?

Rahul Agarwal — Wed, 10 Jul 2013 16:30:58 -0500

Which version is best for bioinformatician to work on?

sequenceserver

Jit — Fri, 10 Mar 2017 08:51:55 -0600

SequenceServer lets you rapidly set up a BLAST+ server with an intuitive user interface for use locally or over the web.

More at http://sequenceserver.com.

Address of the bookmark: https://github.com/wurmlab/sequenceserver