<mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
<mods:titleInfo>
<mods:title>A Survey of De Bruijn Graph Properties, Theorems, and Algorithms</mods:title>
</mods:titleInfo>
<mods:typeOfResource authority="primo">dissertations</mods:typeOfResource>
<mods:name type="personal">
<mods:namePart>Scherick, James Jay</mods:namePart>
<mods:role>
<mods:roleTerm type="text">creator</mods:roleTerm>
</mods:role>
</mods:name>
<mods:name type="personal">
<mods:namePart>Istrail, Sorin</mods:namePart>
<mods:role>
<mods:roleTerm type="text">Advisor</mods:roleTerm>
</mods:role>
</mods:name>

<mods:name type="corporate">
<mods:namePart>Brown University. Department of Computer Science</mods:namePart>
<mods:role>
<mods:roleTerm type="text">sponsor</mods:roleTerm>
</mods:role>
</mods:name>
<mods:originInfo>
<mods:copyrightDate>2023</mods:copyrightDate>
</mods:originInfo>
<mods:physicalDescription>
<mods:extent>xii, 37 p.</mods:extent>
<mods:digitalOrigin>born digital</mods:digitalOrigin>
</mods:physicalDescription>
<mods:note type="thesis">Master's Project (Sc. M.)--Brown University, 2023</mods:note>
<mods:genre>Master's Projects</mods:genre>
<mods:abstract>
De Bruijn graphs are a popular data structure that have a wide variety of uses. In this thesis I will be going over a large number of properties, theorems, and algorithms relating to de Bruijn graphs from articles and papers I have read. I will also be adding some additional knowledge to spaces that I found had room to grow. This information is split up into two chapters “combinatorics” and “computational biology” which are the two most common uses for de Bruijn graphs. For all sections, if you would like to learn more, I highly encourage reading the original paper or article cited in that section. Furthermore this thesis assumes the reader has some background knowledge in de Bruijn graphs and how they work.    </mods:abstract>
<mods:subject>
<mods:topic>De Bruijn graphs</mods:topic>
</mods:subject>
<mods:subject authority="fast" authorityURI="http://id.worldcat.org/fast" valueURI="http://id.worldcat.org/fast/01411643">
<mods:topic>combinatorics</mods:topic>
</mods:subject>
<mods:subject authority="fast" authorityURI="http://id.worldcat.org/fast" valueURI="http://id.worldcat.org/fast/00805020">
<mods:topic>Computational Biology</mods:topic>
</mods:subject>
<mods:language>
<mods:languageTerm authority="iso639-2b">English</mods:languageTerm>
</mods:language>
<mods:recordInfo>
<mods:recordContentSource authority="marcorg">RPB</mods:recordContentSource>
<mods:recordCreationDate encoding="iso8601">20230503</mods:recordCreationDate>
</mods:recordInfo>
<mods:identifier type="doi">10.26300/3gfx-4f70</mods:identifier></mods:mods>