Marilyn Taub Faculty

S.Asensio, Y.Filmus, I.García-Marco, and K.Knauer, “Sensitivity and Hamming graphs,” Journal of Graph Theory0 (2026): 1-10. https://doi.org/10.1002/jgt.70034. 1 Introduction In 2019, Huang [1] provided a one-page proof of the fact that every induced subgraph on more than half of the vertices of the n $n$ -dimensional hypercube Q n ${Q}^{n}$ has maximum degree at least n $\sqrt{n}$ .

This section summarizes the main numerical results of our accuracy evaluation of the error simulation process of the DNA-storalator. We further give a comparison of the tool with other existing tools, highlight the different, and discuss the possible use-case examples of the tool. We validated the accuracy of the DNA-Storalator’s error simulation by comparing its output to real-world sequencing data.

Multiple sequence alignments are extensively used in biology, from phylogenetic reconstruction to structure and function prediction. Here, we suggest an out-of-the-box approach for the inference of multiple sequence alignments, which relies on algorithms developed for processing natural languages.