Unifying Parsimonious Tree Reconciliation

Evolution is a process that is influenced by various environmental factors, e.g. the interactions between different species, genes, and biogeographical properties. Hence, it is interesting to study the combined evolutionary history of multiple species, their genes, and the environment they live in. A common approach to address this research problem is to describe each individual evolution as a phylogenetic tree and construct a tree reconciliation which is parsimonious with respect to a given event model. Unfortunately, most of the previous approaches are designed only either for host-parasite systems, for gene tree/species tree reconciliation, or biogeography. Hence, a method is desirable, which addresses the general problem of mapping phylogenetic trees and covering all varieties of coevolving systems, including e.g., predator-prey and symbiotic relationships. To overcome this gap, we introduce a generalized cophylogenetic event model considering the combinatorial complete set of local coevolutionary events. We give a dynamic programming based heuristic for solving the maximum parsimony reconciliation problem in time O(n^2), for two phylogenies each with at most n leaves. Furthermore, we present an exact branch-and-bound algorithm which uses the results from the dynamic programming heuristic for discarding partial reconciliations. The approach has been implemented as a Java application which is freely available from http://pacosy.informatik.uni-leipzig.de/coresym.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013

Attentive Learning of Sequential Handwriting Movements: A Neural Network Model

Defense Advanced research Projects Agency and the Office of Naval Research (N00014-95-1-0409, N00014-92-J-1309); National Science Foundation (IRI-97-20333); National Institutes of Health (I-R29-DC02952-01)

The near infrared imager and slitless spectrograph for JWST: V. kernel phase imaging and data analysis

Instrumentatio

The James Webb Space Telescope mission

Instrumentatio

Dairy phages escape CRISPR defence of Streptococcus thermophilus via the anti-CRISPR AcrIIA3.

Bacterial community collapse due to phage infection is a major risk in cheese making processes. As virulent phages are ubiquitous and diverse in milk fermentation factories, the use of phage-resistant lactic acid bacteria (LAB) is essential to obtain high-quality fermented dairy products. The LAB species Streptococcus thermophilus contains two type II-A CRISPR-Cas systems (CRISPR1 and CRISPR3) that can effectively protect against phage infection. However, virulent streptococcal phages carrying anti-CRISPR proteins (ACR) that block the activity of CRISPR-Cas systems have emerged in yogurt and cheese environments. For example, phages carrying AcrIIA5 can impede both CRISPR1 and CRISPR3 systems, while AcrIIA6 stops only CRISPR1. Here, we explore the activity and diversity of a third streptococcal phage anti-CRISPR protein, namely AcrIIA3. We were able to demonstrate that AcrIIA3 is efficiently active against the CRISPR3-Cas system of S. thermophilus. We used AlphaFold2 to infer the structure of AcrIIA3 and we predicted that this new family of functional ACR in virulent streptococcal phages has a new α-helical fold, with no previously identified structural homologs. Because ACR proteins are being explored as modulators in genome editing applications, we also tested AcrIIA3 against SpCas9. We found that AcrIIA3 could block SpCas9 in bacteria but not in human cells. Understanding the diversity and functioning of anti-defence mechanisms will be of importance in the design of long-term stable starter cultures

Reconciliation with non-binary gene trees revisited

10.1007/978-3-319-05269-4-33Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)8394 LNBI418-43