ArticleNucleic acids research2023
Locating, tracing and sequencing multiple expanded genetic letters in complex DNA context via a bridge-base approach.
Article in Nucleic acids research, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
8 citing papers in PubMed, 11 citations in OpenAlex.
- High-resolution melting analysis for rapid and cost-effective detection of unnatural base pairs.Biodesign research · 2026Article
- Advances and challenges in non-canonical nucleic acids data storage.Nature communications · 2026Review
- Recognition of unnatural base pairs by a eukaryotic DNA polymerase enables universal sequencing of an expanded genetic alphabet.Nucleic acids research · 2026Article
- Towards next-generation DNA encryption via an expanded genetic system.National science review · 2025Article
- A practical DNA data storage using an expanded alphabet introducing 5-methylcytosine.GigaByte (Hong Kong, China) · 2025Article
- Recognition and Sequencing of Mutagenic DNA Adduct at Single-Base Resolution Through Unnatural Base Pair.Advanced science (Weinheim, Baden-Wurttemberg, Germany) · 2024Article
- Enzyme-assisted high throughput sequencing of an expanded genetic alphabet at single base resolution.Nature communications · 2024Article
- Enzyme-Assisted High Throughput Sequencing of an Expanded Genetic Alphabet at Single Base Resolution.Research square · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
10 authors at 2 institutions in 1 country.
Funding
No grant is acknowledged in the PubMed record.
Abstract
A panel of unnatural base pairs is developed to expand genetic alphabets. One or more unnatural base pairs (UBPs) can be inserted to enlarge the capacity, diversity, and functionality of canonical DNA, so monitoring the multiple-UBPs-containing DNA by simple and convenient approaches is essential. Herein, we report a bridge-base approach to repurpose the capability of determining TPT3-NaM UBPs. The success of this approach depends on the design of isoTAT that can simultaneously pair with NaM and G as a bridge base, as well as the discovering of the transformation of NaM to A in absence of its complementary base. TPT3-NaM can be transferred to C-G or A-T by simple PCR assays with high read-through ratios and low sequence-dependent properties, permitting for the first time to dually locate the multiple sites of TPT3-NaM pairs. Then we show the unprecedented capacity of this approach to trace accurate changes and retention ratios of multiple TPT3-NaM UPBs during in vivo replications. In addition, the method can also be applied to identify multiple-site DNA lesions, transferring TPT3-NaM makers to different natural bases. Taken together, our work presents the first general and convenient approach capable of locating, tracing, and sequencing site- and number-unlimited TPT3-NaM pairs.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.