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 8 of 8 for “"string graph"”.
-
Efficient String Graph Construction Algorithm
… where assemblers are dominated by de Bruijn graph-based approaches, string graph-based assembly approach is getting more attention because of its ability to losslessly retain information from sequence data. Despite the advantages provided by a string graph in repeat detection and in …
-
Discovering genetic variation in populations using next generation sequencing and de novo assembly
<p>The de Bruijn Graph is a simple and efficient data structure that is used in many areas of sequence analysis including genome assembly, sequencing error correction, sequencing read compression and variant discovery. The data structure has a single parameter k, is straightforward to implement and …
-
Dynamic Optimization of Transportation Networks with Delays
… transportation network is structured by a string graph with delays on the edges, an LQ optimal controller can be found by explicitly constructing the solution to a Riccati equation. Next the problem is studied from a user perspective. A method to compensate the users in the network, so that …
-
Random Graph Generation in Hyperedge Replacement Languages
… a novel approach for the random generation of graphs in context-free hypergraph languages. It is obtained by adapting both of Mairson's generation algorithms for context-free string grammars to the setting of hyperedge replacement grammars. It provides a concrete instrument for the generation …
-
Error correction and clustering algorithms for next generation sequencing
… by different applications: de Bruijn or string graph based approach is replacing traditional overlap-layout-consensus paradigm in genome assembly, computational</p> <p>pipelines consisting of locating and counting short reads per gene location on the reference genome are replacing …
-
Reasoning with !-graphs
… of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in …
-
Pictures of processes
… focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent …
-
Restricted String Representations
A string representation of a graph assigns to every vertex a curve in the plane so that two curves intersect if and only if the represented vertices are adjacent. This work investigates string representations of graphs with an emphasis on the shapes of curves and the way they intersect. We …