A fast algorithm for the construction of universal footprinting templates in DNA
Anderson, James W., Fox, Keith R. and Niblo, Graham A. (2006) A fast algorithm for the construction of universal footprinting templates in DNA. Journal of Mathematical Biology, 52, (3), 307-342. (doi:10.1007/s00285-005-0357-z).
- Pre print
We introduce and give a complete description of a new graph to be used for DNA sequencing questions. This graph has the advantage over the classical de Bruijn graph that it fully accounts for the double stranded nature of DNA, rather than dealing with single strands. Technically, our graph may be thought of as the quotient of the de Bruijn graph under the natural involution of sending a DNA strand to its complementary strand. However, this involution has fixed points, and this complicates the structure of the quotient graph which we have therefore modified herein. As an application and motivating example, we give an efficient algorithm for constructing universal footprinting templates for n-mers. This problem may be formulated as the task of finding a shortest possible segment of DNA which contains every possible sequence of base pairs of some fixed length n. Previous work by Kwan et al has attacked this problem from a numerical point of view and generated minimal length universal footprinting templates for n=2, 3, 5, 7, together with unsubstantiated candidates for the case n=4. We show that their candidates for n=4 are indeed minimal length universal footprinting templates.
|Keywords:||DNA sequencing, universal footprinting template, de Bruijn graph, Eulerian graphs|
|Subjects:||Q Science > QA Mathematics
Q Science > QH Natural history > QH426 Genetics
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Pure Mathematics
University Structure - Pre August 2011 > School of Biological Sciences
|Date Deposited:||11 May 2006|
|Last Modified:||28 Jun 2012 10:15|
|Contact Email Address:||firstname.lastname@example.org|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)