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
 NSFPAR ID:
 10137950
 Publisher / Repository:
 Proceedings of the National Academy of Sciences
 Date Published:
 Journal Name:
 Proceedings of the National Academy of Sciences
 Volume:
 117
 Issue:
 11
 ISSN:
 00278424
 Page Range / eLocation ID:
 p. 56245630
 Format(s):
 Medium: X
 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 present a Keck/MOSFIRE restoptical composite spectrum of 16 typical gravitationally lensed starforming dwarf galaxies at 1.7 ≲
z ≲ 2.6 (z _{mean}= 2.30), all chosen independent of emissionline strength. These galaxies have a median stellar mass of and a median star formation rate of $\mathrm{log}{({M}_{*}/{M}_{\odot})}_{\mathrm{med}}={8.29}_{0.43}^{+0.51}$ . We measure the faint electrontemperaturesensitive [O ${\mathrm{S}\mathrm{F}\mathrm{R}}_{\mathrm{H}\alpha}^{\mathrm{m}\mathrm{e}\mathrm{d}}={2.25}_{1.26}^{+2.15}\phantom{\rule{0.25em}{0ex}}{M}_{\odot}\phantom{\rule{0.25em}{0ex}}{\mathrm{y}\mathrm{r}}^{1}$iii ]λ 4363 emission line at 2.5σ (4.1σ ) significance when considering a bootstrapped (statisticalonly) uncertainty spectrum. This yields a directmethod oxygen abundance of ( $12+\mathrm{log}{(\mathrm{O}/\mathrm{H})}_{\mathrm{direct}}={7.88}_{0.22}^{+0.25}$ ). We investigate the applicability at high ${0.15}_{0.06}^{+0.12}\phantom{\rule{0.33em}{0ex}}{Z}_{\odot}$z of locally calibrated oxygenbased strongline metallicity relations, finding that the local reference calibrations of Bian et al. best reproduce (≲0.12 dex) our composite metallicity at fixed strongline ratio. At fixedM _{*}, our composite is well represented by thez ∼ 2.3 directmethod stellar mass—gasphase metallicity relation (MZR) of Sanders et al. When comparing to predicted MZRs from the IllustrisTNG and FIRE simulations, having recalculated our stellar masses with more realistic nonparametric star formation histories , we find excellent agreement with the FIRE MZR. Our composite is consistent with no metallicity evolution, at fixed $(\mathrm{log}{({M}_{*}/{M}_{\odot})}_{\mathrm{med}}={8.92}_{0.22}^{+0.31})$M _{*}and SFR, of the locally defined fundamental metallicity relation. We measure the doublet ratio [Oii ]λ 3729/[Oii ]λ 3726 = 1.56 ± 0.32 (1.51 ± 0.12) and a corresponding electron density of ( ${n}_{e}={1}_{0}^{+215}\phantom{\rule{0.33em}{0ex}}{\mathrm{cm}}^{3}$ ) when considering the bootstrapped (statisticalonly) error spectrum. This result suggests that lowermass galaxies have lower densities than highermass galaxies at ${n}_{e}={1}_{0}^{+74}\phantom{\rule{0.33em}{0ex}}{\mathrm{cm}}^{3}$z ∼ 2. 
Abstract We analyze preexplosion near and midinfrared (IR) imaging of the site of SN 2023ixf in the nearby spiral galaxy M101 and characterize the candidate progenitor star. The star displays compelling evidence of variability with a possible period of ≈1000 days and an amplitude of Δ
m ≈ 0.6 mag in extensive monitoring with the Spitzer Space Telescope since 2004, likely indicative of radial pulsations. Variability consistent with this period is also seen in the nearIRJ andK _{s}bands between 2010 and 2023, up to just 10 days before the explosion. Beyond the periodic variability, we do not find evidence for any IRbright presupernova outbursts in this time period. The IR brightness ( mag) and color ( ${M}_{{K}_{s}}=10.7$J −K _{s}= 1.6 mag) of the star suggest a luminous and dusty red supergiant. Modeling of the phaseaveraged spectral energy distribution (SED) yields constraints on the stellar temperature ( K) and luminosity ( ${T}_{\mathrm{eff}}={3500}_{1400}^{+800}$ ). This places the candidate among the most luminous Type II supernova progenitors with direct imaging constraints, with the caveat that many of these rely only on optical measurements. Comparison with stellar evolution models gives an initial mass of $\mathrm{log}L/{L}_{\odot}=5.1\pm 0.2$M _{init}= 17 ± 4M _{⊙}. We estimate the presupernova massloss rate of the star between 3 and 19 yr before explosion from the SED modeling at to 3 × 10^{−4} $\stackrel{\u0307}{M}\approx 3\times {10}^{5}$M _{⊙}yr^{−1}for an assumed wind velocity ofv _{w}= 10 km s^{−1}, perhaps pointing to enhanced mass loss in a pulsationdriven wind. 
Abstract We investigate how cosmic web structures affect galaxy quenching in the IllustrisTNG (TNG100) cosmological simulations by reconstructing the cosmic web within each snapshot using the D
is Per SE framework. We measure the comoving distance from each galaxy with stellar mass to the nearest node ( $\mathrm{log}({M}_{*}/{M}_{\odot})\ge 8$d _{node}) and the nearest filament spine (d _{fil}) to study the dependence of both the median specific star formation rate (〈sSFR〉) and the median gas fraction (〈f _{gas}〉) on these distances. We find that the 〈sSFR〉 of galaxies is only dependent on the cosmic web environment atz < 2, with the dependence increasing with time. Atz ≤ 0.5, galaxies are quenched at $8\le \mathrm{log}({M}_{*}/{M}_{\odot})<9$d _{node}≲ 1 Mpc, and have significantly suppressed star formation atd _{fil}≲ 1 Mpc, trends driven mostly by satellite galaxies. Atz ≤ 1, in contrast to the monotonic drop in 〈sSFR〉 of galaxies with decreasing $\mathrm{log}({M}_{*}/{M}_{\odot})<10$d _{node}andd _{fil}, galaxies—both centrals and satellites—experience an upturn in 〈sSFR〉 at $\mathrm{log}({M}_{*}/{M}_{\odot})\ge 10$d _{node}≲ 0.2 Mpc. Much of this cosmic web dependence of star formation activity can be explained by an evolution in 〈f _{gas}〉. Our results suggest that in the past ∼10 Gyr, lowmass satellites are quenched by rapid gas stripping in dense environments near nodes and gradual gas starvation in intermediatedensity environments near filaments. At earlier times, cosmic web structures efficiently channeled cold gas into most galaxies. Stateoftheart ongoing spectroscopic surveys such as the Sloan Digital Sky Survey and DESI, as well as those planned with the Subaru Prime Focus Spectrograph, JWST, and Roman, are required to test our predictions against observations. 
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 polynomial size, whereE M A J is the “exact majority” function, improving previous lower bounds againstA C C ^{0}[Williams JACM’14] andA C C ^{0}∘T H R [Williams STOC’14], [MurrayWilliams STOC’18]. This is the first nontrivial lower bound against such a circuit class.