A method for constructing artificial DNA libraries based on generalized de Bruijn sequences

DOI10.1016/J.DAM.2018.12.029zbMATH Open1407.05206OpenAlexW2913655249MaRDI QIDQ1735684FDOQ1735684

Authors: Adam Kozak, Tomasz Głowacki, Piotr Formanowicz 

Publication date: 28 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.12.029

Recommendations

• scientific article; zbMATH DE number 5262968
• DNA sequence design using templates
• DNA Computing Based on Actual Biological Sequences and Accurate Reaction Control
• Deterministic polynomial-time algorithms for designing short DNA words
• scientific article; zbMATH DE number 1241376

zbMATH Keywords

DNA computingde Bruijn sequencesde Bruijn graphslabeled graphsDNA libraries

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• On some properties of DNA graphs
• Embedding on alphabet overlap digraphs
• Title not available (Why is that?)
• The origins of combinatorics on words
• Title not available (Why is that?)
• On a generalized model of labeled graphs
• Sampling algorithms.
• DE BRUIJN SEQUENCES REVISITED
• The Frobenius problem in a free monoid
• Classification of de Bruijn-based labeled digraphs
• Title not available (Why is that?)

Cited In (1)

• Reverse de Bruijn: Utilizing Reverse Peptide Synthesis to Cover All Amino Acid k-mers

This page was built for publication: A method for constructing artificial DNA libraries based on generalized de Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735684)