BOL: Related items

TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads

Surabhi Chaudhary — Tue, 15 May 2018 02:53:11 -0500

TAndem REpeat ANalyzer -TAREAN – is a computational pipeline for unsupervised identification of satellite repeats from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.

How to use TAREAN:

Install a local instance of the pipeline using its source code available from bitbucket repository.
Use public Galaxy-based server at https://repeatexplorer-elixir.cerit-sc.cz/. The server is provided in frame of the Elixir CZ project and is maintained by CESNET and CERIT-SC. Simple registration is required to use this service.

Development of TAREAN was supported by ELIXIR CZ research infrastructure project (MEYS Grant No: LM2015047).

References

Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) – TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads. Nucleic Acids Res., doi:10.1093/nar/gkx257

Address of the bookmark: https://bitbucket.org/petrnovak/repex_tarean

Which of the following programming language is best for a bioinformatics beginner?

Manisha Mishra — Thu, 04 Sep 2014 07:51:16 -0500

I will be doing NGS in the course of my research work and I will like to learn a programming language which is compatible with most bioinformatics tools or software. I basically want to do de-novo assembly, map reads, align reads, and expression analysis. Recommendations welcomed. Which languages would you recommend to a student wishing to enter the world of bioinformatics?

Cerulean: A hybrid assembly using high throughput short and long reads

Rahul Nayak — Tue, 05 Jun 2018 10:10:15 -0500

Cerulean extends contigs assembled using short read datasets like Illumina paired-end reads using long reads like PacBio RS long reads. Cerulean v0.1 has been implemented with bacterial genomes in mind. The method is fully described in Deshpande, V., Fung, E. D., Pham, S., & Bafna, V. (2013). Cerulean: A hybrid assembly using high throughput short and long reads. arXiv preprint arXiv:1307.7933. http://arxiv.org/abs/1307.7933

Address of the bookmark: https://sourceforge.net/projects/ceruleanassembler/

Research Scientist – Bioinformatics at Sidra Medical and Research Center

Wed, 10 Sep 2014 14:35:35 -0500

Sidra Medical and Research Center(Doha, Qatar) is looking for talented Research Scientists (Bioinformatics / NGS Data Analysis).

Research Scientists within the Bioinformatics Program are involved in research related to cutting edge genomics and analysis of omics data. The research will utilize concepts, theories and best practices obtained from bioinformatics discipline and applied to biological and other biomedical data for analysis. The role may also involve designing databases, algorithm and/or computation methods for analyzing genomics and other omics data. The scientist will be working closely with the Translational Medicine Program within a state-of-the art research setting.

Please check the details of the opening and apply here: http://careers.sidra.org/sidra/Vacan...acancyID=60181

JBrowse: Embeddable genome browser built completely with JavaScript and HTML5

Jit — Fri, 29 Jun 2018 09:19:56 -0500

JBrowse is a fast, embeddable genome browser built completely with JavaScript and HTML5, with optional run-once data formatting tools written in Perl. Headline Features: Fast, smooth scrolling and zooming. Explore your genome with unparalleled speed. Scales easily to multi-gigabase genomes and deep-coverage sequencing. Quickly open and view data files on your computer without uploading them to any server. Supports GFF3, BED, FASTA, Wiggle, BigWig, BAM, VCF (with either .tbi or .idx index), REST, and more. BAM, BigBed, BigWig, and VCF data are displayed directly from chunks of the compressed binary files, no conversion needed. Includes an optional “faceted” track selector (see demo) suitable for large installations with thousands of tracks. Very light server resource requirements. In fact, JBrowse has no back-end server code, just tools for formatting data files to be read directly over HTTP. Serve huge datasets from a single low-cost cloud instance. Can run as a stand-alone app on OSX and Windows using the Electron platform Highly extensible plugin architecture, with a large plugin registry of existing examples here https://gmod.github.io/jbrowse-registry https://jbrowse.org/

Address of the bookmark: https://github.com/GMOD/jbrowse

INTERNSHIP @ NIPGR

Sat, 13 Sep 2014 16:02:35 -0500

Applications are invited from suitable candidates for six months ‘Training Fellowship' at National Institute of Plant Genome Research (NIPGR).

About National Institute Of Plant Genome Research (NIPGR) http://www.nipgr.res.in/

The National Institute of Plant Genome Research is an autonomous institution supported by the Department of Biotechnology, Government of India. It is committed to make the institute a premier Institution for plant genomic research in the country. It was established to contribute in the achievement of such hopes as a part of national effort for meeting the challenges in the midst of fast pace of international genomic research and grasping of opportunities on long-term basis.

About the Internship:

The selected intern(s) will work in the area of in Bioinformatics under the BTISNET program of DBT in the Distributed Information Sub center (DISC) facility at NIPGR, New Delhi, under the supervision of Dr. Gitanjali Yadav, Scientist, NIPGR.

Who can apply:

Students currently pursuing the final year of Masters Degree (or equivalent) in Bioinformatics/Biotechnology with strong interest in Computational Biology and First class/division throughout academic career may apply.

Hercules: a profile HMM-based hybrid error correction algorithm for long reads

Jit — Mon, 20 Aug 2018 14:14:11 -0500

Choosing whether to use second or third generation sequencing platforms can lead to trade-offs between accuracy and read length. Several studies require long and accurate reads including de novo assembly, fusion and structural variation detection. In such cases researchers often combine both technologies and the more erroneous long reads are corrected using the short reads. Current approaches rely on various graph based alignment techniques and do not take the error profile of the underlying technology into account. Memory- and time- efficient machine learning algorithms that address these shortcomings have the potential to achieve better and more accurate integration of these two technologies. Results: We designed and developed Hercules, the first machine learning-based long read error correction algorithm. The algorithm models every long read as a profile Hidden Markov Model with respect to the underlying platformtextquoterights error profile. The algorithm learns a posterior transition/emission probability distribution for each long read and uses this to correct errors in these reads. Using datasets from two DNA-seq BAC clones (CH17-157L1 and CH17-227A2), and human brain cerebellum polyA RNA-seq, we show that Hercules-corrected reads have the highest mapping rate among all competing algorithms and highest accuracy when most of the basepairs of a long read are covered with short reads. Availability:

Hercules source code is available at https://github.com/BilkentCompGen/Hercules

Address of the bookmark: https://github.com/BilkentCompGen/Hercules

Java utilities for Next Generation Sequencing by Pierre Lindenbaum

Robert M Willioms — Mon, 15 Sep 2014 17:24:49 -0500

Java utilities for Bioinformatics

https://github.com/lindenb/jvarkit

Address of the bookmark: https://github.com/lindenb/jvarkit

LoRMA: A tool for correcting sequencing errors in long reads

Abhimanyu Singh — Thu, 06 Sep 2018 16:21:01 -0500

An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of k-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75×, the throughput of the new method is at least 20% higher.

conda install -c atgc-montpellier lorma

Address of the bookmark: https://gite.lirmm.fr/lorma/lorma-releases/wikis/home

KAU Thrissur Biotech/Bioinformatics RA/SRF/JRF/Trainee/Studentships

Fri, 26 Sep 2014 20:07:28 -0500

Applications are invited from eligible candidates for the following posts at Bioinformatics Centre (DIC), IT- BT Complex, College of Horticulture, Kerala Agricultural University, Vellanikkara, Thrissur.

1. Research Associate
Emoluments*: 14880/- + HRA
Qualification needed: Ph.D/M.Sc in Bioinformatics or Ph.D/M.Sc in Agriculture or Biotechnology with advanced Diploma in Bioinformatics
Desirable: 2 year experience in Bioinformatics.

2 Senior Research Fellow
Emoluments*: 10230/-
Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/ Biotechnology with Diploma in Bioinformatics.
Desirable: One year experience in Bioinformatics

3 Junior Research Fellow
Emoluments*: 9300/-
Qualification needed: M.Sc/ M.tech in Bioinformatics or M.Sc in Agriculture/Biotechnology/Plant Sciences with Diploma in Bioinformatics.

4 .Trainee/Studentship Bioinformatics
Emoluments*: 5000/-
Qualification needed: M.Sc in Bioinformatics with good knowledge of Bioinformatics softwares and tools.

5 Trainee/ Studentship Biotechnology
Emoluments*: 5000/-
Qualification needed: M.Sc in Biotechnology, with working knowledge in tissue culture, molecular markers and cloning of genes.

Candidates with the required qualifications and experience may give an application in the prescribed format with attested copies of certificates to prove eligibility on or before 30th November 2014. The applications are to be addressed to The Associate Dean, College of Horticulture and send to "Professor & Coordinator, Bioinformatics Centre (DIC), IT-BT Complex, Kerala Agricultural University, Vellanikkara, Thrissur, Kerala 680 656”. The envelope may be superscribed “Application for the post at Bioinformatics Centre”.

*Emoluments are likely to be revised in 2014-2015

More at http://www.kaubic.in/downloads/Notification_bic.pdf
http://www.kaubic.in/downloads/Application%20form.pdf