BOL: Related items

SALSA: A tool to scaffold long read assemblies with Hi-C

Jit — Fri, 15 Jun 2018 04:01:15 -0500

This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch. To use the latest version, first run the following commands: cd SALSA make To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2). If you consider using this tool, please cite our publication which describes the methods used for scaffolding. Ghurye, J., Pop, M., Koren, S., Bickhart, D., & Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).

Address of the bookmark: https://github.com/machinegun/SALSA

Genomic Medicine - Bruce Korf (2014)

Tue, 24 Jun 2014 07:58:44 -0500

May 21, 2014 - Current Topics in Genome Analysis 2014 A lecture series covering contemporary areas in genomics and bioinformatics. More: http://www.genome.gov/COURSE2014

SimLoRD: A read simulator for third generation sequencing reads

Aaryan Lokwani — Wed, 22 Aug 2018 10:40:27 -0500

SimLoRD is a read simulator for third generation sequencing reads and is currently focused on the Pacific Biosciences SMRT error model.

Reads are simulated from both strands of a provided or randomly generated reference sequence.

The reference can be read from a FASTA file or randomly generated with a given GC content. It can consist of several chromosomes, whose structure is respected when drawing reads. (Simulation of genome rearrangements may be incorporated at a later stage.)
The read lengths can be determined in four ways: drawing from a log-normal distribution (typical for genomic DNA), sampling from an existing FASTQ file (typical for RNA), sampling from a a text file with integers (RNA), or using a fixed length
Quality values and number of passes depend on fragment length.
Provided subread error probabilities are modified according to number of passes
Outputs reads in FASTQ format and alignments in SAM format

Address of the bookmark: https://bitbucket.org/genomeinformatics/simlord/

Faculty Positions at Central University of Punjab

Mon, 07 Jul 2014 23:33:33 -0500

Faculty Positions: Rolling/Open Advertisement Advt.No: T-10 (2013)

Pay Scale: Pay Band Rs.15600-39100 with AGP of Rs.6,000/-

Essential Qualifications for Professors, Associate Professors, and Assistant Professors: As per “UGC REGULATIONS ON MINIMUM QUALIFICATIONS FOR APPOINTMENT OF TEACHERS AND OTHER ACADEMIC STAFF IN UNIVERSITIES AND COLLEGES AND MEASURES FOR THE MAINTENANCE OF STANDARDS IN HIGHER EDUCATION 2010“ and the 2nd Amendments to the regulation issued in June 2013.

For details: http://www.ugc.ac.in/oldpdf/regulations/revised_finalugcregulationfinal10.pdf http://www.ugc.ac.in/pdfnews/8539300_English.pdf and University rules.

Procedure to apply:

Application forms along with API form complete in all respect along with necessary documents and application fee of Rs. 500/-. (Rs. 250/- for Scheduled Caste/Scheduled Tribe/Person with disabilities) should be sent to:

Registrar, Central University of Punjab, City Campus, Mansa Road, Bathinda-151001

For more info visit: http://www.centralunipunjab.com/Teaching/Final%20Details-t10-2013.pdf, http://www.centralunipunjab.com/Teaching/Advertisement-t10-2013.jpg

Last Apply Date: 31 Dec 2014

Integrative Genomics Viewer (IGV) tutorial

Neel — Sat, 12 Jul 2014 15:16:23 -0500

The Integrative Genomics Viewer (IGV) from the Broad Center allows you to view several types of data files involved in any NGS analysis that employs a reference genome, including how reads from a dataset are mapped, gene annotations, and predicted genetic variants.

http://www.broadinstitute.org/igv/

Address of the bookmark: https://wikis.utexas.edu/display/bioiteam/Integrative+Genomics+Viewer+%28IGV%29+tutorial

Metabuli 분리 improves metagenomic read classification

Abhi — Sat, 03 Jun 2023 20:15:04 -0500

Metabuli 분리 improves metagenomic read classification through metamers, DNA-AA k-mers, to be sensitive and specific, recovering 99% and 98% of DNA or AA classifiers.

Metabuli is metagenomic classifier that jointly analyze both DNA and amino acid (AA) sequences. DNA-based classifiers can make specific classifications, exploiting point mutations to distinguish close taxa. AA-based classifiers have higher sensitivity in detecting homology between query and reference sequences, leverageing higher conservation of AA sequences. Metabuli combines the information of both sequence types using a novel k-mer structure, metamer, to enable both specific and sensitive characterization of metagenomic samples. In addition, it can classify reads against a database of any size as long as it fits in the hard disk.

Address of the bookmark: https://github.com/steineggerlab/Metabuli

COSMOS, our workflow management system for NGS data

Jit — Wed, 23 Jul 2014 07:29:14 -0500

COSMOS, our Python-based management system for implementing large-scale parallel workflows focusing on, but not restricted to, large-scale short-read "NGS" sequencing data is open-access published via Advance Access in Bioinformatics (Gafni et al. 2014). It is also available for download for non-commercial academic and research purposes at:

http://cosmos.hms.harvard.edu/.

Address of the bookmark: https://cosmos.hms.harvard.edu/

d3Network:Tools for creating D3 JavaScript network, tree, dendrogram, and Sankey graphs from R.

Jit — Fri, 06 Apr 2018 12:10:45 -0500

Mike Bostock’s D3.js is great for creating interactive network graphs with JavaScript. The d3Network package makes it easy to create these network graphs from R. The main idea is that you should able to take an R data frame with information about the relationships between members of a network and create full network graphs with one command.

Address of the bookmark: http://christophergandrud.github.io/d3Network/

National Center for Bioinformatics (NCB)

Wed, 23 Jul 2014 14:10:49 -0500

NCB is offering M.Phil and Ph.D programs in the area of Bioinformatics. The major goal of NCB is to promote quality training and research in the area of Bioinformatics. Bioinformatics originated as a cross-disciplinary field as the need for computational sections to research problem raised in biomedicine.

More at http://ncb.qau.edu.pk/

Tools for Protein-Protein Docking !

Poonam Mahapatra — Wed, 25 Apr 2018 05:15:53 -0500

Predicting the structure of protein–protein complexes using docking approaches is a difficult problem whose major challenges include identifying correct solutions, and properly dealing with molecular flexibility and conformational changes. Following are the tools to predict the structure of protein–protein complexes:

3D-Dock Suite

Global rigid search: FFTShape complementarity and electrostatics

Re-scoring and clustering. Refinement of interface side-chains

3D-Garden

Global rigid search in ensamble

Shape complementarity and Lennard–Jones potential

Side chain and backbone dihedral refinement

DOT

Global rigid search: FFTShape complementarity, electrostatics and VDWNone

Escher NG

Global rigid searchShape complementarity, hydrogen bonds and electrostatic

Integrated in VEGA

GRAMM

Global rigid search: FFT. smooth protein surface representation for soft docking

Shape complementarity and Lennard-Jones potential

Clustering of conformations

GRAMM-X

Global rigid search: FFT. smooth protein surface representation for soft docking

Shape complementarity and Lennard-Jones potentialminimization and re-scoring with multiple filters

HEX

Global rigid search: Fourier correlation of spherical harmonics

Shape complementarity

HADDOCK

Global rigid searchElectrostatic ,VDW and desolvation energy termsMD simulated annealing refinement . Filtering based on external data.

ICM

Global rigid search: Monte CarloEmpirical scoring function

Clustering and selection of conformations. Refinement of interface side-chains and re-scoring

MolFit

Global rigid search: FFTShape complementarity

Clustering of good solutions, filtering using a priori information and small, local rigid rotations around selected conformations

PatchDock

Global rigid searchShape complementarity and atomic desolvation energy

Clustering of conformations

PyDock

Global rigid search:FFTShape complementarity

rescoring by binding electrostatics and desolvation energy

RosettaDock

Local rigid search: Monte Carlo with low and high resolution structure representation levels

Different scoring parameters for the different resolutions

ZDOCK

Global rigid search: FFTShape complementarity, desolvation energy, and electrostatics.

Energy minimization and re-scoringFree for academics

Point to note:

The proper treatment of flexibility in protein–protein docking is still an active field of research. You first should analyzed your proteins in order to define their conformational space and then choose the most suitable method for your docking problem.