BOL: Related items

“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files

Poonam Mahapatra — Mon, 04 Jun 2018 03:45:15 -0500

One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information. Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files Compute summary statistics for each TE family (number of TE copies, genome coverage...) Ambiguous cases such as nested TE can be assembled into copies automatically or manually Allow for working with a TE user-defined library Allow for working with only a user-chosen set of TE families http://doua.prabi.fr/software/one-code-to-find-them-all

Address of the bookmark: http://doua.prabi.fr/software/one-code-to-find-them-all

BIC-PGI Bioinformatics Project Dissertation Program

Fri, 12 Dec 2014 21:17:30 -0600

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 in modern methods in Bioinformatics. The duration of the training will be four to six months, starting from January 2015.

Education: Pursuing M.Sc. Bioinformatics

Essential: Post graduate applicants should have completed their first year and should be in the third semester or first half of the second year.

Only students who are willing to spend a minimum period of 4 months to a maximum of six months, without any break, would be eligible for the program.

How to Apply: Candidates interested in the above project dissertation program should apply online.

Send your CV, Scanned copy of letter of recommendation from Head of Institution along with Registration form in the given format should be sent to: info@bicpgi.org

Please mention clearly “Project dissertation & your Name” in the Subject.

The last date for application is December 31, 2014

Note: Selected candidates may please note that the program is free of cost and would not provide any financial aid for transport and stay.

Name of the selected candidates would be posted on the centre website by December 31, 2014. Incomplete applications will be rejected.

For more information visit our website: http://www.bic-pgi.org/project_dissertation.pdf

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

Vital-IT

Abhi — Thu, 18 Dec 2014 10:46:59 -0600

Vital-IT is a bioinformatics competence center that supports and collaborates with life scientists in Switzerland and beyond. The multi-disciplinary team provides expertise, training and maintains a high-performance computing (HPC) and storage infrastructure, so as to help develop, maintain and extend life science and medical research (activities).

Address of the bookmark: http://www.vital-it.ch/

gSearch: a fast and flexible general search tool for whole-genome sequencing

Jit — Mon, 06 Aug 2018 17:19:15 -0500

gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.

Address of the bookmark: http://ml.ssu.ac.kr/gSearch/index.html

MIT Computational Biology Group

Thu, 18 Dec 2014 14:47:01 -0600

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 a highly interdisciplinary environment at the interface of Computer Science and Biology. Since its inception, our lab has eagerly engaged in collaborative research partnerships with biological and experimental collaborators, facilitated by our affiliation with the Broad Institute and the Computational and Systems Biology initiative (CSBi) at MIT, our participation in the Epigenome Roadmap, ENCODE, and modENCODE consortia, and by several other ongoing collaborations at MIT, Harvard, and the Harvard Medical School affiliated hospitals.

http://compbio.mit.edu/

LRCstats: a tool for evaluating long reads correction methods

Aaryan Lokwani — Wed, 22 Aug 2018 11:05:04 -0500

LRCstats is an open-source pipeline for benchmarking DNA long read correction algorithms for long reads outputted by third generation sequencing technology such as machines produced by Pacific Biosciences. The reads produced by third generation sequencing technology, as the name suggests, are longer in length than reads produced by next generation sequencing technologies, such as those produced by Illumina. However, long reads are plagued by high error rates, which can cause issues in downstream analysis. Long read correction algorithms reduce the error rate of long reads either through self-correcting methods or using accurate, short reads outputted by next generation sequencing technologies to correct long reads.

Address of the bookmark: https://github.com/cchauve/lrcstats

Bioinformatics Scientist at ICAR Labs

Sun, 21 Dec 2014 23:47:03 -0600

AGRICUL AGRICULTURAL SCIENTISTS RECRUITMENT BOARD TURAL SCIENTISTS RECRUITMENT BOARD
KRISHI ANUSANDHAN BHAVAN-I, PUSA, NEW DELHI-110 012

ADVERTISEMENT NO. 03/2014

PRINCIPAL SCIENTIST

Pay Band: Minimum pay of `43,000 in the PB-4 of `37400-67000/- + RGP of `10,000/-.

Age: The candidates must not have attained the age of 52 years as on 19.01.2015. There shall be no age limit for the Council’s employees.

ICAR-Indian Institute for Agricultural Biotechnology, (IIAB) Ranchi (Jharkhand)

151. Principal Scientist (Bioinformatics) (One post)

SENIOR SCIENTIST/PROGRAMME COORDINATOR

Pay Band: PB-4 of ` 37400-67000/- + RGP of ` 9,000/-.

Age: The candidates must not have attained the age of 47 years as on 19.01.2015. There shall be no age limit for the Council’s employees.

National Institute of Biotic Stress Management, Raipur (Chhattishgarh)

166. Senior Scientist (Bioinformatics) (One post)

IMPORTANT NOTE
I. (i) CLOSING DATE

THE CLOSING DATE FOR RECEIPT OF APPLICATIONS IN AGRICULTURAL SCIENTISTS RECRUITMENT BOARD IS 19.01.2015 (For applications posted from abroad and in the Andaman and Nicobar Islands, Lakshdweep, Minicoy and Amindivi islands, States/ Union Territories in the North-Eastern Region, Ladakh Division of J & K State, Sikkim, Pangi, Sub-division of Chamba, Lahul and Spiti Districts of Himachal Pradesh, the last date for receipt of application will be 02.02.2015). Non receipt of the application by the closing date will result in rejection of the application.

More Info: http://asrb.org.in/administrator/uploads_dir/1418978057english.pdf

GRSR: a tool for deriving genome rearrangement scenarios from multiple unichromosomal genome sequences

Jit — Fri, 28 Sep 2018 09:35:10 -0500

GRSR is a Tool for Deriving Genome Rearrangement Scenarios for Multiple Uni-chromosomal Genomes. This tool will do the following steps:

Step 1. Run mugsy to get multiple sequence alignment results.
Step 2 & 3. Extraction of the Coordinates of Core Blocks, Construction of Synteny Blocks and Generating Signed Permutations.
Step 4. Generate pairwise genome rearrangement scenarios and find repeats at the breakpoints of each rearrangement events.

https://github.com/DanwangJessica/GRSR

Address of the bookmark: https://github.com/DanwangJessica/GRSR

ShRec3D

Jitendra Narayan — Thu, 25 Dec 2014 23:14:52 -0600

ShRec3D is a program that aims at reconstructing a genome 3D structure (b) from the sole knowledge of the contacts between different genomic regions (a) as determined by Hi-C (http://www.ncbi.nlm.nih.gov/pubmed/19815776).

There are two options to run ShRec3D (on linuX only so far): the first one uses the Matlab complier runtime environment (MCR), the second one doesn't need any other library to be installed but only works with the latest versions of Linux (equivalent to Fedora 19 and above).

Address of the bookmark: https://sites.google.com/site/julienmozziconacci/#TOC-Downloads