Comparative Investigation of Gene Regulatory Processes Underlying Avian Influenza Viruses in Chicken and Duck.

The avian influenza virus (AIV) mainly affects birds and not only causes animals' deaths, but also poses a great risk of zoonotically infecting humans. While ducks and wild waterfowl are seen as a natural reservoir for AIVs and can withstand most virus strains, chicken mostly succumb to infection with high pathogenic avian influenza (HPAI). To date, the mechanisms underlying the susceptibility of chicken and the effective immune response of duck have not been completely unraveled. In this study, we investigate the transcriptional gene regulation underlying disease progression in chicken and duck after AIV infection. For this purpose, we use a publicly available RNA-sequencing dataset from chicken and ducks infected with low-pathogenic avian influenza (LPAI) H5N2 and HPAI H5N1 (lung and ileum tissues, 1 and 3 days post-infection). Unlike previous studies, we performed a promoter analysis based on orthologous genes to detect important transcription factors (TFs) and their cooperation, based on which we apply a systems biology approach to identify common and species-specific master regulators. We found master regulators such as EGR1, FOS, and SP1, specifically for chicken and ETS1 and SMAD3/4, specifically for duck, which could be responsible for the duck's effective and the chicken's ineffective immune response.

The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances.

We study the number Nk of length-k word matches between pairs of evolutionarily related DNA sequences, as a function of k. We show that the Jukes-Cantor distance between two genome sequences-i.e. the number of substitutions per site that occurred since they evolved from their last common ancestor-can be estimated from the slope of a function F that depends on Nk and that is affine-linear within a certain range of k. Integers kmin and kmax can be calculated depending on the length of the input sequences, such that the slope of F in the relevant range can be estimated from the values F(kmin) and F(kmax). This approach can be generalized to so-called Spaced-word Matches (SpaM), where mismatches are allowed at positions specified by a user-defined binary pattern. Based on these theoretical results, we implemented a prototype software program for alignment-free sequence comparison called Slope-SpaM. Test runs on real and simulated sequence data show that Slope-SpaM can accurately estimate phylogenetic distances for distances up to around 0.5 substitutions per position. The statistical stability of our results is improved if spaced words are used instead of contiguous words. Unlike previous alignment-free methods that are based on the number of (spaced) word matches, Slope-SpaM produces accurate results, even if sequences share only local homologies.

Prot-SpaM: fast alignment-free phylogeny reconstruction based on whole-proteome sequences.

Word-based or 'alignment-free' sequence comparison has become an active research area in bioinformatics. While previous word-frequency approaches calculated rough measures of sequence similarity or dissimilarity, some new alignment-free methods are able to accurately estimate phylogenetic distances between genomic sequences. One of these approaches is Filtered Spaced Word Matches. Here, we extend this approach to estimate evolutionary distances between complete or incomplete proteomes; our implementation of this approach is called Prot-SpaM. We compare the performance of Prot-SpaM to other alignment-free methods on simulated sequences and on various groups of eukaryotic and prokaryotic taxa. Prot-SpaM can be used to calculate high-quality phylogenetic trees for dozens of whole-proteome sequences in a matter of seconds or minutes and often outperforms other alignment-free approaches. The source code of our software is available through Github: https://github.com/jschellh/ProtSpaM.