BOL: Related items

Bandage: interactive visualization of de novo genome assemblies

Shruti Paniwala — Mon, 04 Dec 2017 10:09:37 -0600

Bandage (a Bioinformatics Application for Navigating De novo Assembly Graphs Easily) is a tool for visualizing assembly graphs with connections. Users can zoom in to specific areas of the graph and interact with it by moving nodes, adding labels, changing colors and extracting sequences. BLAST searches can be performed within the Bandage graphical user interface and the hits are displayed as highlights in the graph. By displaying connections between contigs, Bandage presents new possibilities for analyzing de novo assemblies that are not possible through investigation of contigs alone.

Availability and implementation: Source code and binaries are freely available at https://github.com/rrwick/Bandage. Bandage is implemented in C++ and supported on Linux, OS X and Windows. A full feature list and screenshots are available at http://rrwick.github.io/Bandage.

Address of the bookmark: http://rrwick.github.io/Bandage/

IBM Research Computational Biology Center

Thu, 29 Aug 2013 08:43:59 -0500

The IBM Computational Biology Center embraces activities at Yorktown Heights, with strong affiliations with activities at Almaden and other IBM Research Centers. Computational Biology (CompBio) including bioinformatics is the study of how computer systems can manage, analyze, and simulate the complex structures and processes inherent in living systems. CompBio Research at IBM spans pattern recognition in sequences, structures and processes, the studying of systems ranging from single protein molecules through to complex molecular interactions, and the data analysis, interpretation and reverse-engineering of complex disease-lifestyle-genomic interactions for fuller biological understanding. "CompBio" has a flavor of its own independant of its parents, biology and computer science. Nonetheless, CompBio is inherently a multi- disciplinary field with important applications in biology, chemical physics, materials science, agriculture, chemistry and ultimately nanotechnology.

Mash: fast genome and metagenome distance estimation using MinHash

Jit — Tue, 12 Dec 2017 17:30:12 -0600

Mash is normally distributed as a dependency-free binary for Linux or OSX (see https://github.com/marbl/Mash/releases). This source distribution is intended for other operating systems or for development. Mash requires c++11 to build, which is available in and GCC >= 4.8 and OSX >= 10.7.

See http://mash.readthedocs.org for more information.

Address of the bookmark: https://github.com/marbl/Mash/releases

May 17, 2013 - Differential Network Analysis

Wed, 04 Sep 2013 16:22:28 -0500

Steve Horvath presents Differential Network Analysis at the UCLA Human Genetics/Biostatistics Network Course

MUMmer4: A fast and versatile genome alignment system

Jit — Sat, 03 Feb 2018 04:59:17 -0600

MUMmer4, a substantially improved version of MUMmer that addresses genome size constraints by changing the 32-bit suffix tree data structure at the core of MUMmer to a 48-bit suffix array, and that offers improved speed through parallel processing of input query sequences. With a theoretical limit on the input size of 141Tbp, MUMmer4 can now work with input sequences of any biologically realistic length. We show that as a result of these enhancements, the nucmer program in MUMmer4 is easily able to handle alignments of large genomes;

Address of the bookmark: https://mummer4.github.io/

Project Fellow @ Alagappa University

Sat, 07 Sep 2013 14:24:13 -0500

Advertisement for the post of project Fellow in UGC project

Project Fellow – One Post

Duration: Three Years

Fellowship : Rs.14, 000/- per month + HRA

Walk-in-interview: 16th Sept, 2013 at 10.00 am

Venue : Department of Bioinformatics, Alagappa University

Eligible candidates can attend walk in interview for the post of Project Fellow in UGC supported project entitled “Shape and chemical feature based 3D- Pharmacophore Model generation, Virtual Screening and MESP studies to identify Potential Leads for Antifungal Azoles”

Interested candidates may apply to Dr. Sanjeev Kumar Singh, Principal Investigator, Department of Bioinformatics, Karaikudi with their Curriculum Vitae along with the copies of the certificates in proof of their educational qualification and experience at skysanjeev@gmail.com

Qualification:

PG Degree in Bioinformatics / Chemistry/ Molecular Biology/ Biotechnology / Biophysics / Biochemistry / Life Sciences/ Pharmacy with minimum of 55% marks in the PG examinations

Desirable:

Research experience in Molecular modeling and CADD will be given preference. UGC-NET/ CSIR-JRF qualified candidates will get preference.

The posts are purely on temporary basis. No TA/DA will be paid for attending the interview.

Advertisement: http://www.alagappauniversity.ac.in/files/news_files/new%20advt-UGC-16sept,13.doc

Metassembler: merging and optimizing de novo genome assemblies

Rahul Nayak — Tue, 08 May 2018 04:52:33 -0500

Metassembler combines multiple whole genome de novo assemblies into a combined consensus assembly using the best segments of the individual assemblies.

Genome assembly projects typically run multiple algorithms in an attempt to find the single best assembly, although those assemblies often have complementary, if untapped, strengths and weaknesses. We present our metassembler algorithm that merges multiple assemblies of a genome into a single superior sequence.

Address of the bookmark: https://sourceforge.net/projects/metassembler/?source=directory

PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++.

Surabhi Chaudhary — Mon, 11 Jun 2018 03:08:26 -0500

We are pleased to release PRICE (Paired-Read Iterative Contig Extension), a de novo genome assembler implemented in C++. Its name describes the strategy that it implements for genome assembly: PRICE uses paired-read information to iteratively increase the size of existing contigs. Initially, those contigs can be individual reads from a subset of the paired-read dataset, non-paired reads from sequencing technologies that provide non-paired data, or contigs that were output from a prior run of PRICE or any other assembler. http://derisilab.ucsf.edu/software/price/

Address of the bookmark: http://derisilab.ucsf.edu/software/price/

Mathivanan Lab

Fri, 20 Sep 2013 13:09:38 -0500

The major research interests are in exploring the role of extracellular matrix components (soluble secreted proteins and membrane vesicles) in cancer and intercellular communication. The lab integrates proteomic, genomic and bioinformatics methodologies to explore cancer cells.

More at http://www.mathivananlab.org/index.html

http://scholar.google.com/citations?user=U6PyEdYAAAAJ&hl=en

LINKS scaffolder bloomfilter setting !

Jit — Fri, 15 Jun 2018 10:39:54 -0500

➜ bin git:(master) ✗ ls -l
total 68
drwxrwxr-x 3 urbe urbe 4096 Jun 15 12:15 lib
-rwxrwxrwx 1 urbe urbe 65141 Jun 15 17:13 LINKS
➜ bin git:(master) ✗ pwd
/home/urbe/Tools/LINKS_1.8.6/bin

➜ bloomfilter git:(master) ✗ swig -Wall -c++ -perl5 BloomFilter.i
➜ bloomfilter git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3
BloomFilter_wrap.cxx:1892:30: fatal error: ../BloomFilter.hpp: No such file or directory
compilation terminated.
➜ bloomfilter git:(master) ✗ cd swig
➜ swig git:(master) ✗ g++ -c BloomFilter_wrap.cxx -I/home/urbe/anaconda3/lib/perl5/5.22.0/x86_64-linux-thread-multi/CORE/ -fPIC -Dbool=char -O3
In file included from BloomFilter_wrap.cxx:1877:0:
../BloomFilter.hpp: In member function ‘void BloomFilter::loadHeader(FILE*)’:
../BloomFilter.hpp:141:59: warning: ignoring return value of ‘size_t fread(void*, size_t, size_t, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
fread(&header, sizeof(struct FileHeader), 1, file);
^
➜ swig git:(master) ✗ g++ -Wall -shared BloomFilter_wrap.o -o BloomFilter.so -O3
➜ swig git:(master) ✗ cd ..
➜ bloomfilter git:(master) ✗ cd ..
➜ lib git:(master) ✗ cd ..
➜ bin git:(master) ✗ ./LINKS
Usage: ./LINKS [v1.8.6]
-f sequences to scaffold (Multi-FASTA format, required)
-s file-of-filenames, full path to long sequence reads or MPET pairs [see below] (Multi-FASTA/fastq format, required)
-m MPET reads (default -m 1 = yes, default = no, optional)
! DO NOT SET IF NOT USING MPET. WHEN SET, LINKS WILL EXPECT A SPECIAL FORMAT UNDER -s
! Paired MPET reads in their original outward orientation <- -> must be separated by ":"
>template_name
ACGACACTATGCATAAGCAGACGAGCAGCGACGCAGCACG:ATATATAGCGCACGACGCAGCACAGCAGCAGACGAC
-d distance between k-mer pairs (ie. target distances to re-scaffold on. default -d 4000, optional)
Multiple distances are separated by comma. eg. -d 500,1000,2000,3000
-k k-mer value (default -k 15, optional)
-t step of sliding window when extracting k-mer pairs from long reads (default -t 2, optional)
Multiple steps are separated by comma. eg. -t 10,5
-o offset position for extracting k-mer pairs (default -o 0, optional)
-e error (%) allowed on -d distance e.g. -e 0.1 == distance +/- 10% (default -e 0.1, optional)
-l minimum number of links (k-mer pairs) to compute scaffold (default -l 5, optional)
-a maximum link ratio between two best contig pairs (default -a 0.3, optional)
*higher values lead to least accurate scaffolding*
-z minimum contig length to consider for scaffolding (default -z 500, optional)
-b base name for your output files (optional)
-r Bloom filter input file for sequences supplied in -s (optional, if none provided will output to .bloom)
NOTE: BLOOM FILTER MUST BE DERIVED FROM THE SAME FILE SUPPLIED IN -f WITH SAME -k VALUE
IF YOU DO NOT SUPPLY A BLOOM FILTER, ONE WILL BE CREATED (.bloom)
-p Bloom filter false positive rate (default -p 0.001, optional; increase to prevent memory allocation errors)
-x Turn off Bloom filter functionality (-x 1 = yes, default = no, optional)
-v Runs in verbose mode (-v 1 = yes, default = no, optional)

Error: Missing mandatory options -f and -s.

ERROR fixed

perl: symbol lookup error: /home/urbe/Tools/LINKS_new/bin/./lib/bloomfilter/swig/BloomFilter.so: undefined symbol: Perl_Gthr_key_ptr