Abstract Chord measures are newly discovered translation-invariant geometric measures of convex bodies in R n {{\mathbb{R}}}^{n} , in addition to Aleksandrov-Fenchel-Jessen’s area measures. They are constructed from chord integrals of convex bodies and random lines. Prescribing the L p {L}_{p} chord measures is called the L p {L}_{p} chord Minkowski problem in the L p {L}_{p} Brunn-Minkowski theory, which includes the L p {L}_{p} Minkowski problem as a special case. This article solves the L p {L}_{p} chord Minkowski problem when p > 1 p\gt 1 and the symmetric case of 0 < p < 1 0\lt p\lt 1 .
more »
« less
Efficient genome editing by CRISPR-Cas12a in common wheat via shoot apical meristem delivery
Biolistic delivery of intron-optimized LbCas12a and its variants into shoot apical meristems results in efficient multiplexed genome editing in common wheat.
more »
« less
- PAR ID:
- 10656123
- Publisher / Repository:
- The American Society of Plant Biologists (ASPB) in partnership with Oxford University Press (OUP)
- Date Published:
- Journal Name:
- Plant Physiology
- Volume:
- 199
- Issue:
- 4
- ISSN:
- 0032-0889
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Since the first phylogenetic study of the order Batrachospermales, Batrachospermum was shown to be paraphyletic. Subsequently, sections of the genus have been methodically investigated using DNA sequences and morphology in order to propose new genera and delineate species. Batrachospermum section Turfosa is the last section with multiple species yet to be examined. New sequence data of specimens from Europe and the United States were combined with the sparse sequence data already available. Phylogenetic analyses using rbcL and COI- 5P sequences showed this section to be a wellsupported clade, distinct from Batrachospermum section Batrachospermum and its segregate genera. Section Turfosa is raised to the generic rank as Paludicola gen. nov. Substantial genetic variation within the genus was discovered and 12 species are recognized based on DNA sequence data as well as morphological characters and geographic distribution. The following morphological characters were applied to distinguish species: branching pattern (pseudodichotomous or irregular), whorl size (reduced or well developed), primary fascicles (curved or straight), spermatangia origin (primary or secondary fascicles), and carposporophyte arrangement (loose or dense). Previously published species were transferred to the new genus: P. turfosa, P. keratophyta, P. orthosticha, P. phangiae, and P. periploca. Seven new species are proposed as follows: P. groenbladii from Europe; P. communis, P. johnhallii, and P. leafensis from North America; and P. aquanigra, P. diamantinensis, and P. turfosiformis from Brazil. In addition, three unsequenced species in the section, P. bakarensis, P. gombakensis, and P. tapirensis, were transferred to the new genus.more » « less
-
Abstract We prove that in either the convergent or overconvergent setting, an absolutely irreducible $$F$$-isocrystal on the absolute product of two or more smooth schemes over perfect fields of characteristic $$p$$, further equipped with actions of the partial Frobenius maps, is an external product of $$F$$-isocrystals over the multiplicands. The corresponding statement for lisse $$\overline{{\mathbb{Q}}}_{\ell }$$-sheaves, for $$\ell \neq p$$ a prime, is a consequence of Drinfeld’s lemma on the fundamental groups of absolute products of schemes in characteristic $$p$$. The latter plays a key role in V. Lafforgue’s approach to the Langlands correspondence for reductive groups with $$\ell $$-adic coefficients; the $$p$$-adic analogue will be considered in subsequent work with Daxin Xu.more » « less
-
Martelli, Pier Luigi (Ed.)Abstract MotivationPairwise sequence alignment remains a fundamental problem in computational biology and bioinformatics. Recent advances in genomics and sequencing technologies demand faster and scalable algorithms that can cope with the ever-increasing sequence lengths. Classical pairwise alignment algorithms based on dynamic programming are strongly limited by quadratic requirements in time and memory. The recently proposed wavefront alignment algorithm (WFA) introduced an efficient algorithm to perform exact gap-affine alignment in O(ns) time, where s is the optimal score and n is the sequence length. Notwithstanding these bounds, WFA’s O(s2) memory requirements become computationally impractical for genome-scale alignments, leading to a need for further improvement. ResultsIn this article, we present the bidirectional WFA algorithm, the first gap-affine algorithm capable of computing optimal alignments in O(s) memory while retaining WFA’s time complexity of O(ns). As a result, this work improves the lowest known memory bound O(n) to compute gap-affine alignments. In practice, our implementation never requires more than a few hundred MBs aligning noisy Oxford Nanopore Technologies reads up to 1 Mbp long while maintaining competitive execution times. Availability and implementationAll code is publicly available at https://github.com/smarco/BiWFA-paper. Supplementary informationSupplementary data are available at Bioinformatics online.more » « less
An official website of the United States government

