Sequence mappability is an important task in genome resequencing. In the (
Motivated by applications in wireless networks and the Internet of Things, we consider a model of n nodes trying to reach consensus with high probability on their majority bit. Each node i is assigned a bit at time 0 and is a finite automaton with m bits of memory (i.e.,
 Award ID(s):
 1705007
 Publication Date:
 NSFPAR ID:
 10137950
 Journal Name:
 Proceedings of the National Academy of Sciences
 Volume:
 117
 Issue:
 11
 Page Range or eLocationID:
 p. 56245630
 ISSN:
 00278424
 Publisher:
 Proceedings of the National Academy of Sciences
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract k ,m )mappability problem, for a given sequenceT of lengthn , the goal is to compute a table whosei th entry is the number of indices such that the length$$j \ne i$$ $j\ne i$m substrings ofT starting at positionsi andj have at mostk mismatches. Previous works on this problem focused on heuristics computing a rough approximation of the result or on the case of . We present several efficient algorithms for the general case of the problem. Our main result is an algorithm that, for$$k=1$$ $k=1$ , works in$$k=O(1)$$ $k=O\left(1\right)$ space and, with high probability, in$$O(n)$$ $O\left(n\right)$ time. Our algorithm requires a careful adaptation of the$$O(n \cdot \min \{m^k,\log ^k n\})$$ $O(n\xb7min\{{m}^{k},{log}^{k}n\})$k errata trees of Cole et al. [STOC 2004] to avoid multiple counting of pairs of substrings. Our technique can also be applied to solve the allpairs Hamming distance problem introduced by Crochemore et al. [WABI 2017]. We further develop time algorithms to compute$$O(n^2)$$ $O\left({n}^{2}\right)$all (k ,m )mappability tables for a fixedm and all or a fixed$$k\in \{0,\ldots ,m\}$$ $k\in \{0,\dots ,m\}$k and all . Finally, we show that, for$$m\in \{k,\ldots ,n\}$$ $m\in \{k,\dots ,n\}$ , the ($$k,m = \Theta (\log n)$$ $k,m=\Theta (logn)$k ,m )mappability problem cannot be solved in strongly subquadratic time unless the Strong Exponential Time Hypothesis fails. This is an improved and extended version of a paper presented at SPIRE 2018. 
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathsf {Quasi}\text {}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ $\mathrm{Quasi}\mathrm{NP}=\mathrm{NTIME}\left[{n}^{{\left(\mathrm{log}n\right)}^{O\left(1\right)}}\right]$ , by showing that$\mathcal { C}$ $C$ admits nontrivial satisfiability and/or$\mathcal { C}$ $C$# SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a nontrivial# SAT algorithm for a circuit class . Say that a symmetric Boolean function${\mathcal C}$ $C$f (x _{1},…,x _{n}) issparse if it outputs 1 onO (1) values of . We show that for every sparse${\sum }_{i} x_{i}$ ${\sum}_{i}{x}_{i}$f , and for all “typical” , faster$\mathcal { C}$ $C$# SAT algorithms for circuits imply lower bounds against the circuit class$\mathcal { C}$ $C$ , which may be$f \circ \mathcal { C}$ $f\circ C$stronger than itself. In particular:$\mathcal { C}$ $C$# SAT algorithms forn ^{k}size circuits running in 2^{n}/$\mathcal { C}$ $C$n ^{k}time (for allk ) implyN E X P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$# SAT algorithms for size$2^{n^{{\varepsilon }}}$ ${2}^{{n}^{\epsilon}}$ circuits running in$\mathcal { C}$ $C$ time (for some$2^{nn^{{\varepsilon }}}$ ${2}^{n{n}^{\epsilon}}$ε > 0) implyQ u a s i N P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i N P does not haveE M A J ∘A C C ^{0}∘T H R circuits of polynomialmore » 
Abstract The bimodal absorption system imaging campaign (BASIC) aims to characterize the galaxy environments of a sample of 36 H
i selected partial Lyman limit systems (pLLSs) and Lyman limit systems (LLSs) in 23 QSO fields atz ≲ 1. These pLLSs/LLSs provide a unique sample of absorbers with unbiased and wellconstrained metallicities, allowing us to explore the origins of metalrich and lowmetallicity circumgalactic medium (CGM) atz < 1. Here we present Keck/KCWI and Very Large Telescope/MUSE observations of 11 of these QSO fields (19 pLLSs) that we combine with Hubble Space Telescope/Advanced Camera for Surveys imaging to identify and characterize the absorberassociated galaxies at 0.16 ≲z ≲ 0.84. We find 23 unique absorberassociated galaxies, with an average of one associated galaxy per absorber. For seven absorbers, all with <10% solar metallicities, we find no associated galaxies with within $\mathrm{log}{M}_{\star}\gtrsim 9.0$ρ /R _{vir}and ∣Δv ∣/v _{esc}≤ 1.5 with respect to the absorber. We do not find any strong correlations between the metallicities or Hi column densities of the gas and most of the galaxy properties, except for the stellar mass of the galaxies: the lowmetallicity ([X/H] ≤ −1.4) systems have a probability of for having a host galaxy with ${0.39}_{0.15}^{+0.16}$ within $\mathrm{log}{M}_{\star}\ge 9.0$ρ /R _{vir}≤ 1.5, while the higher metallicity absorbers havemore » 
The product selectivity of many heterogeneous electrocatalytic processes is profoundly affected by the liquid side of the electrocatalytic interface. The electrocatalytic reduction of CO to hydrocarbons on Cu electrodes is a prototypical example of such a process. However, probing the interactions of surfacebound intermediates with their liquid reaction environment poses a formidable experimental challenge. As a result, the molecular origins of the dependence of the product selectivity on the characteristics of the electrolyte are still poorly understood. Herein, we examined the chemical and electrostatic interactions of surfaceadsorbed CO with its liquid reaction environment. Using a series of quaternary alkyl ammonium cations (
${\mathrm{m}\mathrm{e}\mathrm{t}\mathrm{h}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ ,${\mathrm{e}\mathrm{t}\mathrm{h}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ ,${\mathrm{p}\mathrm{r}\mathrm{o}\mathrm{p}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ , and${\mathrm{b}\mathrm{u}\mathrm{t}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ ), we systematically tuned the properties of this environment. With differential electrochemical mass spectrometry (DEMS), we show that ethylene is produced in the presence of${\mathrm{m}\mathrm{e}\mathrm{t}\mathrm{h}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ and${\mathrm{e}\mathrm{t}\mathrm{h}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ cations, whereas this product is not synthesized in${\mathrm{p}\mathrm{r}\mathrm{o}\mathrm{p}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$  and${\mathrm{b}\mathrm{u}\mathrm{t}\mathrm{y}\mathrm{l}}_{4}{\mathrm{N}}^{+}$ containing electrolytes. Surfaceenhanced infrared absorption spectroscopymore » 
Abstract We present a chemodynamical study of the Grus I ultrafaint dwarf galaxy (UFD) from mediumresolution (
R ∼ 11,000) Magellan/IMACS spectra of its individual member stars. We identify eight confirmed members of Grus I, based on their low metallicities and coherent radial velocities, and four candidate members for which only velocities are derived. In contrast to previous work, we find that Grus I has a very low mean metallicity of 〈[Fe/H]〉 = −2.62 ± 0.11 dex, making it one of the most metalpoor UFDs. Grus I has a systemic radial velocity of −143.5 ± 1.2 km s^{−1}and a velocity dispersion of km s^{−1}, which results in a dynamical mass of ${\sigma}_{\mathrm{rv}}={2.5}_{0.8}^{+1.3}$ ${M}_{1/2}({r}_{h})={8}_{4}^{+12}\times {10}^{5}$M _{⊙}and a masstolight ratio ofM/L _{V}= ${440}_{250}^{+650}$M _{⊙}/L _{⊙}. Under the assumption of dynamical equilibrium, our analysis confirms that Grus I is a darkmatterdominated UFD (M/L > 80M _{⊙}/L _{⊙}). However, we do not resolve a metallicity dispersion (σ _{[Fe/H]}< 0.44 dex). Our results indicate that Grus I is a fairly typical UFD with parameters that agree with mass–metallicity and metallicityluminosity trends for faint galaxies. This agreement suggests that Grus I has not lost an especially significant amount of mass from tidal encounters with the Milky Way, in linemore »