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 12 of 12 for “"MinHash"”.

  1. Enhancing the Draft Assembly with Minhash

    In this thesis, we report on the use of minhash techniques to improve the draft assembly of a genome mapping. More specifically, we use minhash to compare the scaffolds of sea urchin and sea cucumber genomes. One of the main contributions of this thesis is the implementation of minhash with the …

    unlv Repository record for Enhancing the Draft Assembly with Minhash (opens in a new tab) Download PDF for Enhancing the Draft Assembly with Minhash (opens in a new tab)

  2. Suffix Tree, Minwise Hashing and Streaming Algorithms for Big Data Analysis in Bioinformatics

    … based indexing, and (c) minwise-hashing (minhash) and locality-sensitive hashing (LSH). The streaming models are useful for large data problems where a good approximation needs to be achieved with limited space usage. We developed an approximation algorithm (KmerEstimate) using the …

    nebraska Repository record for Suffix Tree, Minwise Hashing and Streaming Algorithms for Big Data Analysis in Bioinformatics (opens in a new tab)

  3. Read alignment using deep neural networks

    … proximity preserving hashing techniques, such as Minhash and Minimizers, were utilized to quickly map a read to the target region of the reference sequence. Subsequently, a variant of global or local alignment dynamic programming is then used to give the final alignment. In this research work, we …

    colostate Repository record for Read alignment using deep neural networks (opens in a new tab)

  4. Parallel locality sensitive hashing for network discovery from time series

    … for four locality sensitive hashing methods – minhash, approximate binary correlation (ABC), symbolic aggregate approximation (SAX), and ``sketch, shingle and hash" (SSH), each with its own pre-processing, hash creation, and similarity measure. A preliminary investigation implements minhash …

    ubc Repository record for Parallel locality sensitive hashing for network discovery from time series (opens in a new tab) Download PDF for Parallel locality sensitive hashing for network discovery from time series (opens in a new tab)

  5. Applied Randomized Algorithms for Efficient Genomic Analysis

    … algorithms to practical problems. We used MinHash and HyperLogLog, both examples of Locality- Sensitive Hashing, as well as coresets, which are approximate representations for finite sum problems, to build methods capable of scaling to billions of items. Ultimately, these are all derived …

    jhu Repository record for Applied Randomized Algorithms for Efficient Genomic Analysis (opens in a new tab)

  6. Deep Hashing for Image Similarity Search

    … developing a learning based counterpart for the MinHash hashing algorithm. Second, presenting a new unsupervised hashing method UmapHash to map the neighborhood relations of data items from the feature vector space to the binary hash code space. Finally, an application of the aforementioned …

    ucf Repository record for Deep Hashing for Image Similarity Search (opens in a new tab)

  7. Some Rare LSH Gems for Large-scale Machine Learning

    … we leverage some unique properties of weighted MinHash, which is a popular LSH, to design a novel class of split-merge proposals which are significantly more informative than random sampling but at the same time efficient to compute. In the end, we show a practical usage of LSH for Indoor …

    rice Repository record for Some Rare LSH Gems for Large-scale Machine Learning (opens in a new tab)

  8. Reverse Thinking in Spatial Queries

    … NP-hard, we employ a greedy algorithm. We adopt MinHash and KMV Synopses to assist set operations. Our experimental study demonstrates the performance of the proposed algorithm. We also study the problem of maximizing spatial influence of facility bundle based on RkNN queries. We are the first to …

    unsw Repository record for Reverse Thinking in Spatial Queries (opens in a new tab)

  9. Bioinformatic Software Development For Large-Scale Microbial Genome Analysis with Applications in Disturbance Ecology and SAR11 Species Evolution

    … probabilistic data structures (i.e., ProbMinHash, SuperMinHash, Densified MinHash, and SetSketch) to estimate genomic distance, with a graph-based nearest neighbor search algorithm (called Hierarchical Navigable Small World Graphs, or HNSW), I created and implemented a new data structure, …

    gatech Repository record for Bioinformatic Software Development For Large-Scale Microbial Genome Analysis with Applications in Disturbance Ecology and SAR11 Species Evolution (opens in a new tab)

  10. Fraud detection framework using privacy preserving record linkage in telecom

    Fraud is a persistent and increasing problem in the telecom industry. Telcos work in isolation to prevent fraud. Sharing information is critical for detecting and preventing fraud. The primary constraint on sharing information is privacy preservation. Several techniques have been developed to share …

    oklahoma-thes Repository record for Fraud detection framework using privacy preserving record linkage in telecom (opens in a new tab) Restricted access

  11. Simulace kybernetických útoků a tvorba datových sad pro detekci anomálií v logových záznamech

    Bezpečnostný monitoring patrí medzi kľúčové súčasti informačných systémov dnešnej doby. Jedným z najdôležitejších aspektov bezpečnostného monitoringu je generovanie, zber a analýza logových záznamov. Táto práca sa zaoberá spracovaním dátových súborov s cieľom vytvoriť trénovacie dáta pre modely …

    brno-tech Repository record for Simulace kybernetických útoků a tvorba datových sad pro detekci anomálií v logových záznamech (opens in a new tab)