Efficient exact pattern-matching in proteomic sequences

This paper proposes a novel algorithm for complete exact pattern-matching focusing the specificities of protein sequences (alphabet of 20 symbols) but, also highly efficient considering larger alphabets. The searching strategy uses large search windows allowing multiple alignments per iteration. A new filtering heuristic, named compatibility rule, contributed decisively to the efficiency improvement. The new algorithm’s performance is, on average, superior in comparison with its best-rated competitors

Autoantibodies against type I IFNs in patients with life-threatening COVID-19

Interindividual clinical variability in the course of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) infection is vast. We report that at least 101 of 987 patients with life-threatening coronavirus disease 2019 (COVID-19) pneumonia had neutralizing immunoglobulin G (IgG) autoantibodies (auto-Abs) against interferon-w (IFN-w) (13 patients), against the 13 types of IFN-a (36), or against both (52) at the onset of critical disease; a few also had auto-Abs against the other three type I IFNs. The auto-Abs neutralize the ability of the corresponding type I IFNs to block SARS-CoV-2 infection in vitro. These auto-Abs were not found in 663 individuals with asymptomatic or mild SARS-CoV-2 infection and were present in only 4 of 1227 healthy individuals. Patients with auto-Abs were aged 25 to 87 years and 95 of the 101 were men. A B cell autoimmune phenocopy of inborn errors of type I IFN immunity accounts for life-threatening COVID-19 pneumonia in at least 2.6% of women and 12.5% of men

Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism

This paper presents performance results for parallel algorithms that compute the longest common subsequence of two strings. This algorithm is a representative of a class of algorithms that compute string to string distances and has computational complexity O(n(2)). The parallel algorithm uses a variable grid size, runs in O(p) supersteps (synchronization phases) and has linear communication costs. We study this algorithm in BSP context, give runtime estimations and compare the predictions to experimental values measured on three different parallel architectures, using different BSP programming libraries and an efficient implementation for sequential computation. We find that using the BSP model and the appropriate optimized BSP library improves the performance over plain MPI, and that scalability can be improved by using a tuned grid size parameter