Abstract The double differential cross sections of the Drell–Yan lepton pair ($$\ell ^+\ell ^-$$ , dielectron or dimuon) production are measured as functions of the invariant mass$$m_{\ell \ell }$$ , transverse momentum$$p_{\textrm{T}} (\ell \ell )$$ , and$$\varphi ^{*}_{\eta }$$ . The$$\varphi ^{*}_{\eta }$$ observable, derived from angular measurements of the leptons and highly correlated with$$p_{\textrm{T}} (\ell \ell )$$ , is used to probe the low-$$p_{\textrm{T}} (\ell \ell )$$ region in a complementary way. Dilepton masses up to 1$$\,\text {Te\hspace{-.08em}V}$$ are investigated. Additionally, a measurement is performed requiring at least one jet in the final state. To benefit from partial cancellation of the systematic uncertainty, the ratios of the differential cross sections for various$$m_{\ell \ell }$$ ranges to those in the Z mass peak interval are presented. The collected data correspond to an integrated luminosity of 36.3$$\,\text {fb}^{-1}$$ of proton–proton collisions recorded with the CMS detector at the LHC at a centre-of-mass energy of 13$$\,\text {Te\hspace{-.08em}V}$$ . Measurements are compared with predictions based on perturbative quantum chromodynamics, including soft-gluon resummation.
more »
« less
ESKEMAP: exact sketch-based read mapping
Abstract BackgroundGiven a sequencing read, the broad goal of read mapping is to find the location(s) in the reference genome that have a “similar sequence”. Traditionally, “similar sequence” was defined as having a high alignment score and read mappers were viewed as heuristic solutions to this well-defined problem. For sketch-based mappers, however, there has not been a problem formulation to capture what problem an exact sketch-based mapping algorithm should solve. Moreover, there is no sketch-based method that can find all possible mapping positions for a read above a certain score threshold. ResultsIn this paper, we formulate the problem of read mapping at the level of sequence sketches. We give an exact dynamic programming algorithm that finds all hits above a given similarity threshold. It runs in$$\mathcal {O} (|t| + |p| + \ell ^2)$$ time and$$\mathcal {O} (\ell \log \ell )$$ space, where |t| is the number of$$k$$ -mers inside the sketch of the reference, |p| is the number of$$k$$ -mers inside the read’s sketch and$$\ell$$ is the number of times that$$k$$ -mers from the pattern sketch occur in the sketch of the text. We evaluate our algorithm’s performance in mapping long reads to the T2T assembly of human chromosome Y, where ampliconic regions make it desirable to find all good mapping positions. For an equivalent level of precision as minimap2, the recall of our algorithm is 0.88, compared to only 0.76 of minimap2.
more »
« less
- Award ID(s):
- 2138585
- PAR ID:
- 10519792
- Publisher / Repository:
- Springer Nature
- Date Published:
- Journal Name:
- Algorithms for Molecular Biology
- Volume:
- 19
- Issue:
- 1
- ISSN:
- 1748-7188
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract We study holomorphic mapsFfrom a smooth Levi non-degenerate real hypersurface$$ M_{\ell }\subset {\mathbb {C}}^n $$ into a hyperquadric$$ {\mathbb {H}}_{\ell '}^N $$ with signatures$$ \ell \le (n-1)/2 $$ and$$ \ell '\le (N-1)/2,$$ respectively. Assuming that$$ N - n < n - 1,$$ we prove that if$$ \ell = \ell ',$$ thenFis either CR transversal to$$ {\mathbb {H}}_{\ell }^N $$ at every point of$$ M_{\ell },$$ or it maps a neighborhood of$$ M_{\ell } $$ in$$ {\mathbb {C}}^n $$ into$$ {\mathbb {H}}_{\ell }^N.$$ Furthermore, in the case where$$ \ell ' > \ell ,$$ we show that ifFis not CR transversal at$$0\in M_\ell ,$$ then it must be transversally flat. The latter is best possible.more » « less
-
Abstract A family ofrdistinct sets$$\{A_1,\ldots , A_r\}$$ is anr-sunflower if for all$$1 \leqslant i < j\leqslant r$$ and$$1 \leqslant i' < j'\leqslant r$$ , we have$$A_i\cap A_j = A_{i'}\cap A_{j'}$$ . Erdős and Rado conjectured in 1960 that every family$$\mathcal {H}$$ of$$\ell $$ -element sets of size at least$$K(r)^\ell $$ contains anr-sunflower, whereK(r) is some function that depends only onr. We prove that if$$\mathcal {H}$$ is a family of$$\ell $$ -element sets of VC-dimension at mostdand$$|\mathcal H| > (C r(\log d+\log ^*\ell ))^\ell $$ for some absolute constant$$C > 0$$ , then$$\mathcal {H}$$ contains anr-sunflower. This improves a recent result of Fox, Pach, and Suk. When$$d=1$$ , we obtain a sharp bound, namely that$$|\mathcal H| > (r-1)^\ell $$ is sufficient. Along the way, we establish a strengthening of the Kahn–Kalai conjecture for set families of bounded VC-dimension, which is of independent interest.more » « less
-
Abstract In recent work with Raum, the authors considered congruences for the ordinary partition functionp(n) of the form$$p(\ell Q^r n+\beta )\equiv 0\pmod \ell $$ where$$\ell , Q\ge 5$$ are prime and$$r\in \{1,2\}$$ , and proved a number of results which show that such congruences are scarce in a precise sense. Here we improve one of our results when$$r=1$$ ; in particular, we prove (outside of trivial cases) that the set of primesQsuch that there exists$$\beta \in \mathbb {Z}$$ with$$p(\ell Q n+\beta )\equiv 0\pmod \ell $$ for allnhas density zero. The proof involves a modification of part of our previous argument and an application of a recent theorem of Dicks regarding modular forms of half-integral weight and level one modulo$$\ell $$ .more » « less
-
Abstract We study the shifted convolution problem for the divisor function in function fields in the large degree limit, that is, the average value of$$d(f) d(f+h)$$ wherefruns over monic polynomials in$$\mathbb {F}_q[T]$$ of a given degree, andhis a given monic polynomial. We prove an asymptotic formula in the range$$\deg (h) < (2-\epsilon )\deg (f)$$ . We also consider mixed correlations and self-correlations of$$r_\chi = 1 \star \chi $$ , the convolution of 1 with a Dirichlet character mod$$\ell $$ , where$$\ell $$ is a monic irreducible polynomial, proving asymptotic formulae in various ranges. This includes the case of quadratic characters, which yields results about correlations of norm-counting functions of quadratic extensions of$$\mathbb {F}_q[T]$$ . A novel feature of our work is a Voronoi summation formula (equivalently, a functional equation for the Estermann function) in$$\mathbb {F}_q[T]$$ which was not previously available.more » « less
An official website of the United States government

