More at https://rennisonlab.com/

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

More at https://evoldir.net/brian/evoldir/Jobs//UC-Berkeley.Tenure_track_faculty_in_genetics_genomics_evolution_and_development

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

Key Findings of the Study:

1. Alu Insertion and Tail Loss:
   The researchers discovered an Alu-mediated genetic change in a common ancestor of modern apes and humans. This change disrupted the normal function of a gene involved in tail development, leading to the suppression of tail formation.

2. Gene Disruption Mechanism:
   The Alu insertion was found within a regulatory region of the TBXT gene (also known as T or Brachyury), which is crucial for tail development in vertebrates. This insertion likely altered the gene's expression patterns, leading to tail reduction over evolutionary time.

3. Functional Evidence from Model Organisms:
   To test their hypothesis, the researchers introduced similar genetic modifications in mice. The modified mice exhibited shortened or absent tails, supporting the idea that the identified mutation played a role in tail loss in hominoids.

4. Evolutionary Implications:
   The findings suggest that small, random genomic changes—such as transposable element insertions—can have profound effects on body morphology. This study provides evidence that mobile DNA elements (like Alu) can drive major evolutionary transitions.

5. Relevance to Human Evolution:
   Understanding the genetic basis of tail loss helps in reconstructing the evolutionary history of hominins (the lineage that includes humans and our extinct relatives). It also sheds light on how genetic variations contribute to anatomical diversity among primates.

Significance of the Study:

This research highlights the role of transposable elements in shaping evolutionary traits and provides a concrete genetic explanation for a defining characteristic of humans and great apes. It also demonstrates how mutations in regulatory regions of developmental genes can lead to significant anatomical changes.

https://github.com/kakitone/MetaFinisherSC

https://github.com/kakitone/BIGMAC

Address of the bookmark: https://github.com/kakitone/BIGMAC