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 18 of 18 for “"graph alignment"”.
-
On the information-theoretic limits of attributed graph alignment
Graph alignment aims at recovering the vertex correspondence between two correlated graphs, which is a task that frequently occurs in graph mining applications such as social network analysis, computational biology, etc. Existing studies on graph alignment mostly identify the vertex correspondence …
-
Fundamental Limits and Algorithms for Database and Graph Alignment
Data alignment refers to a class of problems where given two sets of anonymized data pertaining to overlapping sets of users, the goal is to identify the correspondences between the two sets. If the data of a user is contained in both sets, the correlation between the two data points associated …
-
Statistical inference on structured data : sequences and graphs
… big data, structured data, such as sequences and graphs, have become central to various scientific and engineering disciplines. This dissertation explores statistical inference techniques tailored to these complex data structures, focusing on the development of novel methodologies that address the …
-
Computation of evolutionary change
… of semantic evolutionary change. It is based on graphs for representing software semantics, graph transformations for modeling evolution, and effects of graph transformations for capturing evolutionary change.</p> <p>We formulate the notions of evolution sets and the evolution distance to measure …
-
Sentence Similarity Analysis with Applications in Automatic Short Answer Grading
… from the student answers. I continue to combine graph alignment features with lexical semantic similarity measures and employ machine learning techniques to show that grade assignment error can be reduced compared to a system that considers only lexical semantic measures of similarity. I also …
-
Network Alignment Using Topological and Node Embedding Features
… different sources leads to the task of network alignment, which is the focus of this thesis. The main objective of this task is to find an optimal one-to-one correspondence among nodes in two or more networks utilizing graph topology and nodes/edges attributes. In existing works, diverse …
-
Map conflation via knowledge graph representations of digital maps
… we design MINOR (Map Conflation via Knowledge Graph Representation), a machine-learning approach consisting of three parts: (1) Knowledge Graph Construction: where each GDB is represented by a knowledge graph (2) Map Matching: where we use a knowledge graph alignment method as well as a …
-
Efficient methods for read mapping
… and the reference can be a single genome or a graph representation of multiple genomes. Therefore, it is crucial to develop efficient computational methods for these different problem classes. Moreover, continually declining sequencing costs and increasing throughput pose challenges to the …
-
Scalable and Accurate Computational Frameworks for Complex Genetic Variants: From Repeat Expansion Discovery to Somatic Mosaicism Benchmarking
… and 100x long-read coverage. A pangenome graph alignment framework using Minigraph-Cactus was used to construct a benchmarking variant set comprising over 6 million SNVs, 1.8 million indels, 51,000 structural variants, and 10,000 mobile element insertions. Systematic evaluation of six …
-
Identifying Graphs from Noisy Observational Data
… jointly. I define the general problem of graph identification which simultaneously performs these tasks; removing the noise and missing values in the observed input network and inferring the complete and accurate output network. I present a novel approach to graph identification using a …
-
Approaches to scaling and improving metagenome sequence assembly
… assembly algorithms frequently use de Bruijn graphs where reads are broken down into k-mers, or small DNA words of a fixed size k. Despite these algorithmic advances, DNA sequence assembly still scales poorly due to errors and computer memory inefficiency.In this dissertation, we develop …
-
Mine the node association: Dig into the essence of graphs
In the era of big data, graph arises as a crucial data structure. Compared with other types of data, the essence of graphs large lies in node association, which represents unique, informative and important relation between nodes. Recently, mining the node association has attracted remarkable …
-
NETWORK ALIGNMENT AND STRUCTURED SIGNALS IN RANDOM GRAPHS
… and practical methodologies for spec-tral graph inference in random graph models, with an emphasis on graph alignment, latent structure detection, and multi-graph analysis. Spectral embedding has become a central tool for statistical network analysis due to its efficiency and versatility in …
-
Improvements on ORCA for Fast Computation of Graphlet Degree Vectors of any Graphlet Order
… real-life structures or behaviors represented as graphs in many areas of the computing sciences. Comparing these graphs is a hard task, especially when we are interested in assigning a non-binary similarity score between two large graphs based on some domain-specific context. In bioinformatics, …
-
Utilizing gene co-expression networks for comparative transcriptomic analyses
The development of high-throughput technologies such as microarray and next-generation RNA sequencing (RNA-seq) has generated numerous transcriptomic data that can be used for comparative transcriptomics studies. Transcriptomes obtained from different species can reveal differentially expressed …
-
Algorithms for efficient sensitive search and sample comparison on petabase-scale genomics data
… organise the data into an annotated sequence graph structure. Graph nodes represent words extracted from the indexed sequences, while annotations store metadata by associating nodes with different attributes or sample labels. Due to the heterogeneous nature of biological sequence data, many …
-
Towards Advanced Unsupervised Representation Learning for Graph-Structured Data
… achievement achieved by deep learning on graphs, its success is predominantly tethered to the quality and quantity of labeled datasets. In response to this bottleneck, unsupervised learning is gaining traction as a promising paradigm, which circumvents the dependency on manual labeling. …