Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Double Occurrence Words"”.

  1. Patterns in Words Related to DNA Rearrangements

    … when morphic images of them appear as factors in words. In this thesis, we initiate a study of patterns in words that appear as subwords of words. We say that a pattern appears in a word if each pattern variable can be morphically mapped to a factor in the word. To gain insight into the complexity …

    usf Repository record for Patterns in Words Related to DNA Rearrangements (opens in a new tab)

  2. Properties of Graphs Used to Model DNA Recombination

    … be associated with an unsigned Gauss code, or double occurrence word. We define biologically motivated reductions that act on double occurrence words and, in turn, on their associated assembly graphs. For every double occurrence word w there is a sequence of reduction operations that may be …

    usf Repository record for Properties of Graphs Used to Model DNA Recombination (opens in a new tab)

  3. Topological Data Analysis of Properties of Four-Regular Rigid Vertex Graphs

    … assembly graphs which can also be represented by double occurrence words. Various invariants have been suggested for these graphs, some based on the structure of the graphs, and some biologically motivated. In this thesis we use a novel method of data analysis based on a technique known as …

    usf Repository record for Topological Data Analysis of Properties of Four-Regular Rigid Vertex Graphs (opens in a new tab)

  4. Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability

    … and chord diagrams are closely associated with double occurrence words, so we classify and enumerate the double occurrence words based on several notions of irreducibility. In the area of analytic probability, moments abstractly describe the shape of a probability distribution. Over the years, …

    usf Repository record for Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability (opens in a new tab)

  5. Hamiltonian Sets of Polygonal Paths in 4-Valent Spatial Graphs

    … graphs. Assembly graphs are represented by double-occurrence words called assembly words. An assembly word is strongly-irreducible if it does not contain a proper subword that is also a double-occurrence word. We prove that, for every positive integer n there is a strongly-irreducible …

    usf Repository record for Hamiltonian Sets of Polygonal Paths in 4-Valent Spatial Graphs (opens in a new tab)

  6. Methods in Discrete Mathematics to Study DNA Rearrangement Processes

    … can be modeled by subword pattern deletions in double-occurrence words (DOWs), words where each symbol appears exactly twice. The iterated deletions can be represented by a graph whose vertices are DOWs connected by an edge if one word can be obtained from the other through a pattern deletion. …

    usf Repository record for Methods in Discrete Mathematics to Study DNA Rearrangement Processes (opens in a new tab)