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).

This is the seventh school of a biennial series of international summer schools on mathematical ecology and evolution in Finland, organised by the Biomathematics Group of the University of Helsinki. The series of The Helsinki Summer School on Mathematical Ecology and Evolution is part of the EMS-ESMTB Schools in Applied Mathematics.

After the two-year break forced upon by the pandemic, we are looking forward to continue this series in August 2022, if only the covid situation permits.

The job description: "This research position focuses on the science
of bacterial evolution. It will consist of researching theoretical
principles, but could include translational applications. Phylogenomic
and bioinformatic analysis of bacterial populations in nature or
in laboratory experiments will be a key component of the work. Prior
experience is an asset though training will be possible at PMI.
Likewise, laboratory microbiological, molecular, and biochemical
skills are an asset though not essential. Communication and critical
thinking skills are essential for performing the work and for
communicating to the local and international scientific communities.
Participating in team or independent grant writing to obtain research
funding will be required. Student mentoring is a part of the NAU
mission and is a partial expectation."

https://hr.peoplesoft.nau.edu/psp/ph92prta/EMPLOYEE/HRMS/c/HRS_HRAM.HRS_APP_SCHJOB.GBL?Page=HRS_APP_JBPST&Action=U&FOCUS=Applicant&SiteId=1&JobOpeningId=608024&PostingSeq=1

Northern Arizona University is located in Flagstaff, Arizona, a
beautiful mountain town with a surprisingly vibrant restaurant
scene. Located a little over an hour from the Grand Canyon and ~45
min from Sedona, Flagstaff is a hiker's paradise. In fact, the city
of Flagstaff operates more than 50 miles of unpaved trails and there
are, on average, 266 sunny days per year with which to enjoy them.
At 7000 ft in elevation, Flagstaff experiences all four seasons,
but thesummers are mild and, in the winter, you can be on the ski
slopes within 30 min! https://www.flagstaffarizona.org/

As mentioned, joint projects with Professor Sheppard at Oxford
University are possible, including travel to his laboratory in the
United Kingdom. https://www.biology.ox.ac.uk/people/samuel-sheppard

Contact Information:
Paul.Keim@nau.edu

Paul S. Keim, Ph.D.
Regents Professor, &
Cowden Endowed Chair of Microbiology
Northern Arizona University
Flagstaff, AZ 86011-4073

Paul S Keim

Main mission:

Develop and implement strategies for whole-genome sequencing of non-model
species
Generate high-quality de novo genome assemblies using short- and long-read
sequencing technologies
Perform genome annotation and structural/functional characterization
Conduct comparative genomic analyses across related species or populations
Design and implement genome-wide association studies (GWAS) to identify
loci associated with phenotypic or adaptive traits
Integrate genomic, phenotypic, and environmental datasets
Contribute to the development of reproducible bioinformatics pipelines

Activités (Activities):

Lead the genomic component of the research project
High-molecular-weight DNA extraction optimization
Long-read genome assembly (PacBio HiFi / ONT)
Genome polishing and quality assessment (BUSCO, QUAST)
Structural and functional annotation
Variant discovery (SNPs, indels, SVs)
Population genomic analyses (FST, demographic inference)
Mixed-model GWAS accounting for structure
Workflow development (Snakemake/Nextflow)
HPC-based pipeline implementation
Publish results in peer-reviewed journals
Present findings at international conferences
Collaborate with experimental and computational team members
Contribute to project development
Mentor graduate students when appropriate

More at https://evol.mcmaster.ca/brian/evoldir/PostDocs//MontpellierU.ComparativeGenomics

Following are the list of Ancestral /sequence/ reconstruction (ASR) tools: 

inferCars

Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.

ANGES:reconstructing ANcestral GEnomeS maps

A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.

Cocos

Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.

MySSP

Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.

PARANA: Parsimonious Ancestral Reconstruction And Network Analysis

Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.

GapAdj: Gapped Adjacencies

A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).

ANCESTOR

A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.

ProCARs

Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.

FastML

A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.

maxAlike

Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.

MLGO: Maximum Likelihood for Gene Order Analysis

A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.

Image Reference : Wiki

http://www.sidowlab.org/

Annotation

https://bigd.big.ac.cn/ncov/variation/annotation

Genome wharehouse 

https://bigd.big.ac.cn/gwh/browse/index

Released Genome

https://bigd.big.ac.cn/ncov/release_genome

Download data 

ftp://download.big.ac.cn/Genome/Viruses/Coronaviridae/

Raw data

https://bigd.big.ac.cn/gsa/browse/run/?tag=Coronaviridae

Address of the bookmark: https://bigd.big.ac.cn/ncov/about

Applications are invited to an all-expenses paid position at a 5-day
"IdeasLab"* workshop to be held near Prague CZ in June 2022. Thirty
successful applicants will be drawn in equal number from the relevant
sectors biological evolution, A-Life anbd theoretical physics. The week's
activities will lead these thirty to form interdisciplinary teams which
each propose how they can advance frontiers of abiogenesis research. Up to
$5 million total funding will be available for developing these ideas
produced by the week's activities. Further details of the event,
including the online application form, are found at the link posted above

More at https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2745767/

Address of the bookmark: http://synorth.genereg.net/