More at http://clark.genetics.utah.edu/

Postdoc position (m/w/d)

in the field of computational evolutionary microbiology is available
for an initially limited period of 36 months at the earliest possible
date. The weekly working time corresponds to 100% of full employment
(If the legal requirements under collective bargaining law are met, the
tariff grouping is carried out up to pay scale 13 TV-L. The obligation
to teach amounts to 4 hours.

The Genomic Microbiology Group research interests are focused on
microbial genome evolution with an emphasis on the study of lateral gene
transfer. In our research we use both computational and experimental
approaches (see www.uni-kiel.de/genomik). The position offers the
opportunity to develop an independent research profile within the group
research focus. The successful applicant is expected to be involved
in teaching of bioinformatics and molecular evolution, including the
development of teaching materials (lectures/exercises/short videos).

Your profile:
· Doctoral or PhD degree in Molecular Evolution, Bioinformatics or
related fields.
· Knowledge and experience in programming (e.g., Python) and
biostatistical analysis (e.g., with R or MatLab).
· Any of the following expertise is an advantage: the analysis of
genomic or transcriptomic data, phylogenetic reconstruction,
comparative genomics.
· Good oral and written communication skills in English.
· Ability to teach in German is an advantage (alternatively, an
indication to do so from the 2nd year on).
· Skills and motivation to communicate and interact with other
scientists.

The Christian-Albrechts-University sees itself as a modern and
cosmopolitan employer. We welcome your application regardless of your age,
gender, cultural and social background, religion, ideology, disability
or sexual identity. We promote equality of the sexes.

The Christian-Albrechts-University is committed to the employment of
people with disabilities. Preference will be given to applications from
severely handicapped persons and persons of equal standing, provided
they are suitable.

We expressly welcome applications from people with a migration background.

For enquiries regarding the position, teaching obligations and research
topic please contact Prof. Tal Dagan: tdagan@ifam.uni-kiel.de.

Applications should be submitted by email to Mrs. Haacks
(dhaacks@ifam.uni-kiel.de) as a single PDF and include: (1) a letter of
motivation (max 1 page, Arial 11, line spacing 1.15), (2) CV, (3) PhD
certificate. Please use 'GMG postdoc application - [your name]'
as a subject.

Please, refrain from sending us application photos.

Application deadline: August 31 2021 or until the position is
filled. Interviews will take place during September/October 2021. The
planned starting date for the position is flexible (but in 2021).

Our research centres on the use of genetics/genomics and phenotypic studies to address complex questions in the ecology, epidemiology and evolution of microbes. Our most recent interest focuses upon comparative genome analysis to describe the core and flexible genome of pathogenic bacteria (Campylobacter, Acinetobacter, Escherichia coli, Helicobacter, Staphylococcus and Streptococcus suis) and how this is related to population genetic structuring, the maintenance of species, and the evolution of host/niche adaptation and virulence.

More at https://sheppardlab.com/research/

GEvol is unique as it will use, for the first time, a large taxonomic group to focus on one goal: to characterise the dynamics and mechanisms of genomic innovations underlying novel traits using comparative evolutionary genomics (and related data).
Thus, projects participating in GEvol we will ask fundamental evolutionary questions such as:
1. At what level is evolution repeatable?
2. How does genomic plasticity interfere with phenotypic plasticity during evolution?
3. How do inter- and intra-specific interactions influence genomic architectures?
4. How predictable is phenotypic variation given some knowledge about the dynamics and mechanisms of underlying genome evolution?

Address of the bookmark: https://g-evol.uni-muenster.de/open-positions/

Mulan (http://mulan.dcode.org/), a novel method and a network server for comparing multiple draft and finished-quality sequences to identify functional elements conserved over evolutionary time. Mulan brings together several novel algorithms: the TBA multi-aligner program for rapid identification of local sequence conservation, and the multiTF program for detecting evolutionarily conserved transcription factor binding sites in multiple alignments. In addition, Mulan supports two-way communication with the GALA database; alignments of multiple species dynamically generated in GALA can be viewed in Mulan, and conserved transcription factor binding sites identified with Mulan/multiTF can be integrated and overlaid with extensive genome annotation data using GALA.

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

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

The biggest and perhaps most fearsome of the world's big cats, the tiger, shares 95.6 percent of its DNA with humans' cute and furry companions, domestic cats.

The new research showed that big cats have genetic mutations that enabled them to be carnivores. The team also identified mutations that allow snow leopards to thrive at high altitudes.

Reference:

http://www.nbcnews.com/science/your-cat-ferocious-tigers-share-lot-95-6-percent-their-4B11182690

http://timesofindia.indiatimes.com/home/environment/flora-fauna/Gene-mapping-of-tiger-completed/articleshow/22671681.cms

Paper:

http://www.nature.com/ncomms/2013/130917/ncomms3433/full/ncomms3433.html

Address of the bookmark: https://github.com/reubwn/hgt

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

https://alitvteam.github.io/AliTV/

Address of the bookmark: https://github.com/AliTVTeam/AliTV