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 7 of 7 for “"Overlap graphs"”.

  1. Growth of algebras, words, and graphs

    … the equivalence of the periodicities of overlap graphs and Hilbert series coefficients.

    vt Repository record for Growth of algebras, words, and graphs (opens in a new tab)

  2. Techniques to improve genome assembly quality

    … models to approach the problem: de-Bruijn graphs and overlap graphs, along with their pros and cons. We describe our proposed techniques to improve the quality of genome assembly. Our main contribution in this work is designing a de-Bruijn graph based assembly algorithm to effectively …

    gatech Repository record for Techniques to improve genome assembly quality (opens in a new tab)

  3. On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs.

    The alphabet overlap graph is a modification of the well known de Bruijn graph. De Bruijn graphs have been highly studied and hence many properties of these graphs have been determined. However, very little is known about alphabet overlap graphs. In this work we determine the chromatic number for a …

    etsu Repository record for On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs. (opens in a new tab) Download PDF for On the chromatic number of the <em>AO</em>(2, <em>k </em>, <em>k</em>-1) graphs. (opens in a new tab)

  4. Algorithms for exact solutions to combinatorial optimization problems

    … to the optimum is close to zero.The class of the Overlap Graphs is an appropriate data structure for the SSP and other problems that comprise overlapping segments. A weighted directed graph is an overlap graph if there exists a set of strings that is with one-to-one correspondence to the vertices …

    greece Repository record for Algorithms for exact solutions to combinatorial optimization problems (opens in a new tab)

  5. COGRAM: A Computational Pipeline for Genome Assembly and Reconstruction using Graph Neural Networks

    … of a complete DNA sequence from short, overlapping reads — remains a fundamental challenge in computational biology. A central difficulty is distinguishing true genomic overlaps from spurious connections arising from repetitive sequences, a task that traditional assemblers address …

    gsu Repository record for COGRAM: A Computational Pipeline for Genome Assembly and Reconstruction using Graph Neural Networks (opens in a new tab)

  6. Real-Time DNA Streams Processing on Mobile Devices

    … is based on finding connected components in overlap graphs constructed over a real-time stream of DNA sequences as produced by MinION platform. We propose an efficient algorithm to maintain connected components when an overlap graph is streamed, and show how redundant information can be …

    buffalo Repository record for Real-Time DNA Streams Processing on Mobile Devices (opens in a new tab)

  7. Simultaneous Graph Representation Problems

    Many graphs arising in practice can be represented in a concise and intuitive way that conveys their structure. For example: A planar graph can be represented in the plane with points for vertices and non-crossing curves for edges. An interval graph can be represented on the real line with …

    waterloo Repository record for Simultaneous Graph Representation Problems (opens in a new tab)