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 20 of 58 for “"k-mers"”.

  1. DIPLOID GENOME POLISHING AND ASSEMBLY USING SOLID K-MERS

    Draft genomes assembled from ONT long reads are known to have a high error rate. While existing genome polishers can enhance their quality, the resulting error rate is still high. To address this issue, we develop two polishers, hypo-short and hypo-hybrid. Hypo-short utilizes Illumina short reads …

    nus Repository record for DIPLOID GENOME POLISHING AND ASSEMBLY USING SOLID K-MERS (opens in a new tab) Download file for DIPLOID GENOME POLISHING AND ASSEMBLY USING SOLID K-MERS (opens in a new tab)

  2. Proposed FPGA-Based hardware architectures for acceleration of Smith-Waterman and K-Mers algorithms

    … method based on dynamic programming, and K-Mers, a technique for counting subsequences fundamental in genomic analysis. We propose an innovative parallel hardware architecture for the SW algorithm, incorporating a systolic array structure that significantly accelerates the forward and …

    brazil-ufrn Repository record for Proposed FPGA-Based hardware architectures for acceleration of Smith-Waterman and K-Mers algorithms (opens in a new tab)

  3. Advanced convolutional neural network techniques for classification of SARS-CoV-2 variants and other viruses: a study using k-mers and chaos game representation

    … leveraging two distinct datasets: one based on k-mers image representation and the other on Chaos Game Representation (CGR). The k-mers dataset was used for taxonomic classification experiments of the SARS-CoV-2 virus, while the CGR dataset focused on classifying variants of concern (VOCs) and …

    brazil-ufrn Repository record for Advanced convolutional neural network techniques for classification of SARS-CoV-2 variants and other viruses: a study using k-mers and chaos game representation (opens in a new tab)

  4. GEM Incorporating Context into Genomic Distance Estimation

    … length-k subsequences of the genome, known as k-mers, which ignores their ordering, i.e., their context in the genome. In this thesis, we take inspiration from computational linguistics to develop a new genomic distance estimation approach that exploits not only the frequency of the k-mers but …

    rice Repository record for GEM Incorporating Context into Genomic Distance Estimation (opens in a new tab)

  5. Algorithms for Multisample Reads Binning

    … split into consecutive overlapping words, or k-mers, which are then used to build a connectivity graph. In order to reduce the complexity and improve the results of the assembly process, genome-independent methods which cluster the reads into bins can be employed. Previous methods for read …

    uconn-diss Repository record for Algorithms for Multisample Reads Binning (opens in a new tab)

  6. Studying the effects of sampling on the efficiency and accuracy of k-mer indexes

    … to store the lists of all occurrences of all k-mers in the database. One method for reducing the space needed, and also query time, is sampling where only some k-mer occurrences are stored. We classify sampling strategies used to create k-mer indexes in two ways: how they choose k-mers and how …

    msu Repository record for Studying the effects of sampling on the efficiency and accuracy of k-mer indexes (opens in a new tab)

  7. Méthodes pour l'identification et l'analyse des signatures génomiques dans le contexte de la classification des séquences biologiques virales

    … signatures génomiques intrinsèques, comme les k-mers, se présente comme une alternative prometteuse. L’analyse des variations de ces signatures peut fournir des informations essentielles sur la différenciation des sous-espèces virales et leurs caractéristiques pathogéniques. Cette thèse présente …

    uqam Download PDF for Méthodes pour l'identification et l'analyse des signatures génomiques dans le contexte de la classification des séquences biologiques virales (opens in a new tab)

  8. Differentiating Human Populations Based on k-mer Classification of Hand Bacteria

    … OTU frequencies, the frequencies of nucleotide k-mers from each OTU sequence were used to study the dissimilarities between samples. Based on the structure, 65 nucleotides of V3 hypervariable region were mapped into 47 elements, and distribution of k-mers from these mapped elements were used to …

    wvu Repository record for Differentiating Human Populations Based on k-mer Classification of Hand Bacteria (opens in a new tab)

  9. High-quality, high-throughput measurement of protein-DNA binding using HiTS-FLIP

    … that it is unable to rank all measured k-mers. Discarding all the clusters related to previously ranked k-mers has the side effect of eliminating any clusters on which k-mers could be ranked that share submotifs with previously ranked k-mers. This shortcoming affects even strong binding …

    lmu-germany Repository record for High-quality, high-throughput measurement of protein-DNA binding using HiTS-FLIP (opens in a new tab)

  10. Determining and characterizing immunological self/non-self

    … this project, peptides of specific lengths (k-mers) are generated from each protein in the proteomes of various model organisms. The set of unique k-mers for each species is stored in a library and defines its "immunological self". Using the libraries, organisms can be compared to determine the …

    sask Repository record for Determining and characterizing immunological self/non-self (opens in a new tab)

  11. Parallel gene upstream comparison via multi-level hash tables on GPU

    … and identifies all motifs of length k (k-mers) that are common to any pair of upstream regions or differ in at most d characters. This framework stores the k-mers found in each gene in a multi-level hash table. The hash table design optimizes hash table comparison (rather than hash table …

    missouri Repository record for Parallel gene upstream comparison via multi-level hash tables on GPU (opens in a new tab)

  12. K-mer-based data structures and pipelines for sequence mapping and analysis

    … computational efficiency in bioinformatics is k-mers. Here we present three works based on the k-mer paradigm that improved the existing methods and opened new possibilities for major applications domains in bioinformatics. LINKS 2.0 is an alignment-free scaffolding tool that brings 3-fold …

    ubc Repository record for K-mer-based data structures and pipelines for sequence mapping and analysis (opens in a new tab) Download PDF for K-mer-based data structures and pipelines for sequence mapping and analysis (opens in a new tab)

  13. Scalable mapping-free algorithms and K-mer data structures for genomic analysis

    … involves transforming the sequence reads into k-mers, which are short overlapping fragments of uniform size. If the size, k, is 48, then all substrings of length 48 are extracted from each sequence read and counted. The resulting frequency of each k-mer can then be used as evidence for genomic …

    gatech Repository record for Scalable mapping-free algorithms and K-mer data structures for genomic analysis (opens in a new tab)

  14. Stacked Sparse Autoencoder applied to SARS-CoV-2 virus classification based on image representations of genome sequences

    … For that, two datasets were explored: based on k-mers image representation and based on CGR image representation. The dataset based on k-mers image representation was applied in the experiments of different levels of taxonomic classification of the SARS-CoV-2 virus, and the dataset based on CGR …

    brazil-ufrn Repository record for Stacked Sparse Autoencoder applied to SARS-CoV-2 virus classification based on image representations of genome sequences (opens in a new tab)

  15. Genome misassembly detection using Stash : a data structure based on stochastic tile hashing

    … data. The key-value pairs stored in Stash are k-mers and sequence ID hashes, respectively. The stored hashed identifiers are then used to check if two queried k-mers are observed in the same set of sequences. This functionality provides utility for Stash across diverse domains of bioinformatics. …

    ubc Repository record for Genome misassembly detection using Stash : a data structure based on stochastic tile hashing (opens in a new tab) Download PDF for Genome misassembly detection using Stash : a data structure based on stochastic tile hashing (opens in a new tab)

  16. Fast edit distance calculation methods for NGS sequence similarity

    … methods have been proposed using matching k-mers. These methods extract all possible k-mers from NGS sequences and compare similarity between pairs of sequences based on the shared k-mers. However, these methods reduce the computation time at the cost accuracy.In this dissertation, our goal …

    msu Repository record for Fast edit distance calculation methods for NGS sequence similarity (opens in a new tab)

  17. Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences

    … reads. Besides an algorithm that distributes k-mers and tiles between ranks, we have also implemented numerous heuristics that are useful to adjust the algorithm based on the hardware traits. We also implemented an extension of our parallel algorithm further by using pre-generating tiles and …

    gatech Repository record for Efficient parallel algorithms for error correction and transcriptome assembly of biological sequences (opens in a new tab)

  18. CRISPR-Cas9 guide RNA efficiency prediction with pretrained DNA language models

    … (input sequences) σε επικαλυπτόμενα k-μερή (k-mers, k = 3, 4, 5, 6) και μαθαίνοντας να παλινδρομεί τα αποτελέσματα αποτελεσματικότητας. Η βελτιστοποίηση του μοντέλου περιελάμβανε τη ρύθμιση του μεγέθους των k-mers, του ρυθμού μάθησης, του dropout και άλλων υπερπαραμέτρων. Η απόδοση αξιολογήθηκε …

    athens Repository record for CRISPR-Cas9 guide RNA efficiency prediction with pretrained DNA language models (opens in a new tab)

  19. Predicting Biofilm Formation in Pseudomonas aeruginosa Using Machine Learning

    … exploratory analyses revealed a subset of k-mers that were consistently selected across model runs and associated with misclassification behaviour, indicating the presence of a weak but potentially meaningful biological signal. The study highlights the limitations of applying machine learning …

    guelph Repository record for Predicting Biofilm Formation in Pseudomonas aeruginosa Using Machine Learning (opens in a new tab)

  20. Dynamic construction of trie-based automata for approximate K-mer matching on heterogeneous CPU-GPU systems

    … this thesis describes a way to locate similar k-mers within a single stream in DNA bases. It achieves this by using the CPU to dynamically construct a trie-based automata structure while the GPU provides the k-mer matching mechanism. It will cover the implementation and optimization of GPU …

    missouri Repository record for Dynamic construction of trie-based automata for approximate K-mer matching on heterogeneous CPU-GPU systems (opens in a new tab)

Page 1 of 3