• In a GitHub or GitLab repository
• Free to use
• Written in markdown or similar

NOTE: This list of courses is selected only based on the above criteria.
There are no checks on quality.

https://glittr.org/?per_page=25&sort_by=stargazers&sort_direction=desc

Address of the bookmark: https://glittr.org/?per_page=25&sort_by=stargazers&sort_direction=desc

The group is both computational and experimental.

We ask biological questions to large datasets made using novel genomics techniques, with the help of computers. One of the strengths in the group are the many connections to high-profile experimental laboratories which supply data to be analyzed.

Lab webpage @ http://people.binf.ku.dk/albin/Sandelin_group_at_the_Bioinformatic_Centre/The_Sandelin_group.html

Address of the bookmark: https://biokit.readthedocs.io/en/latest/index.html

Contact The Director, National Bureau of Agriculturally Important Microorganisms, Kusmaur, Maunath Bhanjan-275101 (U.P.); Phone: 0547-2530080, Fax: 0547-2530358, e mail: nbaimicar@gmail.com; website: www.nbaim.org.in OR

Dr. Dhananjaya P. Singh, Senior Scientist & CCPI, NABG project, NBAIM, Maunath Bhanjan, 275101; Mob.- 09415291703; e mail - dpsfarm@rediffmail.com, nabg.nbaim@gmail.com

More at http://www.nbaim.org.in/Announc.aspx?cd=36

Address of the bookmark: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4783527/

The project is on bacterial gene gain and loss and emerging pathogenicity, and is described in full here: https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015 . The EMBL-EBI / Cambridge Computational Biomedical Postdoctoral (“EBPOD”)

The closing date for applications is 3 September 2015. Nick Goldman EMBL-European Bioinformatics Institute Nick Goldman

More at https://www.ebi.ac.uk/research/postdocs/ebpods/projects/goldman-welch-2015

Following are the genome assembly tools based on string graph:

1.SGA (String Graph Assembler) https://github.com/jts/sga

Assembles large genomes from high coverage short read data. SGA is designed as a modular set of programs, which are used to form an assembly pipeline. SGA implements a set of assembly algorithms based on the FM-index. As the FM-index is a compressed data structure, the algorithms are very memory efficient. The SGA assembly has three distinct phases. The first phase corrects base calling errors in the reads. The second phase assembles contigs from the corrected reads. The third phase uses paired end and/or mate pair data to build scaffolds from the contigs. The output of this software is a PDF report that allows the properties of the genome and data quality to be visually explored. By providing more information to the user at the start of an assembly project, this software will help increase awareness of the factors that make a given assembly easy or difficult, assist in the selection of software and parameters and help to troubleshoot an assembly if it runs into problems.

2. SAGE: String-overlap Assembly of GEnomes https://github.com/lucian-ilie/SAGE2

SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers.

3. FSG: Fast String Graph

The new integrated assembler has been assessed on a standard benchmark, showing that fast string graph (FSG) is significantly faster than SGA while maintaining a moderate use of main memory, and showing practical advantages in running FSG on multiple threads. Moreover, we have studied the effect of coverage rates on the running times.

4.  BASE https://github.com/dhlbh/BASE

It enhances the classic seed-extension approach by indexing the reads efficiently to generate adaptive seeds that have high probability to appear uniquely in the genome. Such seeds form the basis for BASE to build extension trees and then to use reverse validation to remove the branches based on read coverage and paired-end information, resulting in high-quality consensus sequences of reads sharing the seeds. Such consensus sequences are then extended to contigs. BASE is a practically efficient tool for constructing contig, with significant improvement in quality for long NGS reads. It is relatively easy to extend BASE to include scaffolding.

5. Fermi https://github.com/lh3/fermi/

Fermi is a de novo assembler with a particular focus on assembling Illumina short sequence reads from a mammal-sized genome. In addition to the role of a typical assembler, fermi also aims to preserve heterozygotes which are often collapsed by other assemblers. Its ultimate goal is to find a minimal set of unitigs to represent all the information in raw reads.

If you want to learn about String Graph assembler, please read the following papers -

i) The Fragment Assembly String Graph - E. W. Myers

This paper describes the String Graph concept.

ii) Efficient construction of an assembly string graph using the FM-index - Jared T. Simpson and Richard Durbin

This earlier paper from Simpson and Durbin

iii) Efficient de novo assembly of large genomes using compressed data structures - Jared T. Simpson and Richard Durbin

Gene expression and protein expression patterns between normal and non-normal tissues is a growing area of research that may lead to the identification of candidate genes for understanding the etiology of common, complex diseases.

Lab homepage @ http://ritchielab.psu.edu/ritchielab/

./wtdbg2 -x rs -g 4.6m -t 16 -i reads.fa.gz -fo prefix
./wtpoa-cns -t 16 -i prefix.ctg.lay.gz -fo prefix.ctg.fa

Address of the bookmark: https://github.com/ruanjue/wtdbg2

Essential requirements: Experience of using bioinformatics tools.

Experience of working in Linux. Basic knowledge of computer network administration.

Desirable: Knowledge of Linux installation/administration and proficiency in either of the following:

Shell/PERL/Java/Python/VB/Oracle/MySQL/C/CUDA.

Qualification: PhD. or First class M.Sc degree in Bioinformatics or Biotechnology/life science with specialization in Bioinformatics.

Fellowships: Rs 22,000/- with HRA for PhD qualified, Rs 16000/- with HRA for NET/BET/BINC/GATE qualified and 12000/- with HRA for non NET qualified applicants.

Interested candidates may send their complete biodata along with a write-up of their experience and suitability for the position to Dr. Dinesh Gupta by email only to dinesh@icgeb.res.in within 15 days of publication of this advertisement. Kindly mark the email with subject “Application for BIF-RA-2013”

Closing date for applications: 18 October 2013

Only short listed candidates will be invited for an interview at ICGEB.

No TA/DA will be paid for attending the interview.

Advertisement: http://www.icgeb.org/tl_files/Vacancies/BIF-RA-Advt.pdf