Abstract Until recently, precise genome editing has been limited to a few organisms. The ability of Cas9 to generate double stranded DNA breaks at specific genomic sites has greatly expanded molecular toolkits in many organisms and cell types. Before CRISPR‐Cas9 mediated genome editing,P. patenswas unique among plants in its ability to integrate DNA via homologous recombination. However, selection for homologous recombination events was required to obtain edited plants, limiting the types of editing that were possible. Now with CRISPR‐Cas9, molecular manipulations inP. patenshave greatly expanded. This protocol describes a method to generate a variety of different genome edits. The protocol describes a streamlined method to generate the Cas9/sgRNA expression constructs, design homology templates, transform, and quickly genotype plants. © 2023 Wiley Periodicals LLC. Basic Protocol 1: Constructing the Cas9/sgRNA transient expression vector Alternate Protocol 1: Shortcut to generating single and pooled Cas9/sgRNA expression vectors Basic Protocol 2: Designing the oligonucleotide‐based homology‐directed repair (HDR) template Alternate Protocol 2: Designing the plasmid‐based HDR template Basic Protocol 3: Inducing genome editing by transforming CRISPR vector intoP. patensprotoplasts Basic Protocol 4: Identifying edited plants.
more »
« less
Zwitterlation mitigates protein bioactivity loss in vitro over PEGylation
Zwitterlation mitigates bioactivity loss over PEGylation and shows even longer circulation and lower immunogenicity.
more »
« less
- Award ID(s):
- 1708436
- PAR ID:
- 10075633
- Publisher / Repository:
- Royal Society of Chemistry (RSC)
- Date Published:
- Journal Name:
- Chemical Science
- ISSN:
- 2041-6520
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
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
-
Since the first phylogenetic study of the order Batrachospermales,Batrachospermumwas shown to be paraphyletic. Subsequently, sections of the genus have been methodically investigated usingDNAsequences and morphology in order to propose new genera and delineate species.BatrachospermumsectionTurfosais 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 usingrbcL andCOI‐5P sequences showed this section to be a well‐supported clade, distinct fromBatrachospermumsectionBatrachospermumand its segregate genera. Section Turfosais raised to the generic rank asPaludicolagen. nov. Substantial genetic variation within the genus was discovered and 12 species are recognized based onDNAsequence 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,andP. periploca. Seven new species are proposed as follows:P. groenbladiifrom Europe;P. communis,P. johnhallii, andP. leafensisfrom North America; andP. aquanigra,P. diamantinensis, andP. turfosiformisfrom Brazil. In addition, three unsequenced species in the section,P. bakarensis,P. gombakensis, andP. tapirensis, were transferred to the new genus.more » « less
-
Abstract Bacterial endosymbionts can provide benefits for their eukaryotic hosts, but it is often unclear if endosymbionts benefit from these relationships. The social amoeba Dictyostelium discoideum associates with three species of Paraburkholderia endosymbionts, including P. agricolaris and P. hayleyella. These endosymbionts can be costly to the host but are beneficial in certain contexts because they allow D. discoideum to carry prey bacteria through the dispersal stage. In experiments where no other species are present, P. hayleyella benefits from D. discoideum while P. agricolaris does not. However, the presence of other species may influence this symbiosis. We tested if P. agricolaris and P. hayleyella benefit from D. discoideum in the context of resource competition with Klebsiella pneumoniae, the typical laboratory prey of D. discoideum. Without D. discoideum, K. pneumoniae depressed the growth of both Paraburkholderia symbionts, consistent with competition. P. hayleyella was more harmed by interspecific competition than P. agricolaris. We found that P. hayleyella was rescued from competition by D. discoideum, while P. agricolaris was not. This may be because P. hayleyella is more specialized as an endosymbiont; it has a highly reduced genome compared to P. agricolaris and may have lost genes relevant for resource competition outside of its host.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
