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

DOI10.1016/j.dam.2018.12.029zbMath1407.05206OpenAlexW2913655249MaRDI QIDQ1735684

Piotr Formanowicz, Tomasz Głowacki, Adam Kozak

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

zbMATH Keywords

DNA computingde Bruijn sequencesde Bruijn graphslabeled graphsDNA libraries

Mathematics Subject Classification ID

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

Cites Work

• The origins of combinatorics on words
• Classification of de Bruijn-based labeled digraphs
• On some properties of DNA graphs
• Embedding on alphabet overlap digraphs
• On a generalized model of labeled graphs
• Sampling algorithms.
• The Frobenius Problem in a Free Monoid
• DE BRUIJN SEQUENCES REVISITED
• Unnamed Item
• Unnamed Item
• Unnamed Item

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