A fast algorithm for the construction of universal footprinting templates in DNA

DOI10.1007/S00285-005-0357-ZzbMATH Open1086.92013OpenAlexW1999314787WikidataQ48465347 ScholiaQ48465347MaRDI QIDQ2369299FDOQ2369299

Authors: James W. Anderson, Keith R. Fox, Graham Niblo 

Publication date: 9 May 2006

Published in: Journal of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://eprints.soton.ac.uk/29879/1/dna_final.pdf

Recommendations

• Applications of graph theory in DNA sequencing by hybridization
• Succinct de Bruijn graphs
• The adjoints of DNA graphs
• Characterizations for some types of DNA graphs
• scientific article; zbMATH DE number 5831723

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• An Eulerian path approach to DNA fragment assembly

Cited In (2)

• Designing q-unique DNA sequences with integer linear programs and Euler tours in de Bruijn graphs
• deBruijn-like sequences and the irregular chromatic number of paths and cycles

This page was built for publication: A fast algorithm for the construction of universal footprinting templates in DNA

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