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 20 for “"Smith-Waterman algorithm"”.

  1. Accelerating the Smith–Waterman Algorithm with the Actor Model

    The Smith--Waterman algorithm is a fundamental tool for local sequence alignment in computational biology, but its high computational complexity poses significant challenges for large-scale datasets. This thesis investigates the parallelization of the Smith--Waterman algorithm. It introduces inter- …

    sask Repository record for Accelerating the Smith–Waterman Algorithm with the Actor Model (opens in a new tab)

  2. MR-CUDASW - GPU accelerated Smith-Waterman algorithm for medium-length (meta)genomic data

    … by using a GPU-based implementation of the Smith-Waterman algorithm. In this thesis an existing GPU-accelerated sequence alignment algorithm is adapted and expanded to reduce its completion time. A number of improvements and changes are made to the original software. Workload distribution, …

    sask Repository record for MR-CUDASW - GPU accelerated Smith-Waterman algorithm for medium-length (meta)genomic data (opens in a new tab)

  3. Exploiting Multigrain Parallelism in Pairwise Sequence Search on Emergent CMP Architectures

    … novel approaches to parallelize sequence search algorithms has become increasingly important. This thesis puts a significant step forward in bridging the gap between software and hardware by presenting an efficient and scalable model to accelerate one of the popular sequence alignment algorithms …

    vt Repository record for Exploiting Multigrain Parallelism in Pairwise Sequence Search on Emergent CMP Architectures (opens in a new tab)

  4. Detecting malicious insider threat in cloud computing environments

    … and incorporates a new implementation of the Smith Waterman algorithm based on CUDA technology. The proposed mechanisms have been evaluated in terms of the overhead that they introduce, justifying that proper execution, without exhausting the cloud infrastructure’s computational resources, is …

    greece Repository record for Detecting malicious insider threat in cloud computing environments (opens in a new tab)

  5. Analysis and optimisation of selected genomic algorithms

    … Third, a fast and accurate sequence alignment algorithm is proposed that is the core of several steps in the assembly workflow, as well as a wide range of other related analysis. Finally, a new data normalisation method is designed. Due to the probabilistic nature of genome assembly, evaluating …

    unsw Repository record for Analysis and optimisation of selected genomic algorithms (opens in a new tab)

  6. Comparative analysis of algorithms for identifying copy number variation in array CGH data

    The aim of the study is comparative analysis of algorithms for identifying copy number variation in array CGH data. Circular Binary segmentation (CBS), CGH segmentation, Price —Smith—Waterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not …

    cent-lancashire Download PDF for Comparative analysis of algorithms for identifying copy number variation in array CGH data (opens in a new tab)

  7. Development Strategies for Parallelized Genetic Sequence Data Preparation and Application of Artificial Neural Networks for Sequencing Error Correction

    A set of core component algorithms of a complete sequencing error correction pipeline for multiplexed read sequences was developed. Semi-synthetic and real-world data-sets were applied for evaluation of algorithms with performance measures and non-parametric statistical analyses. A synthetic …

    guelph Repository record for Development Strategies for Parallelized Genetic Sequence Data Preparation and Application of Artificial Neural Networks for Sequencing Error Correction (opens in a new tab)

  8. Searching Biological Sequence Databases Using Distributed Adaptive Computing

    … technologies. The search is performed using the Smith-Waterman algorithm, a common sequence comparison algorithm. To reduce the total search time, an initial search is performed using a version of the algorithm, implemented in adaptive computing hardware, which is designed to efficiently perform …

    vt Repository record for Searching Biological Sequence Databases Using Distributed Adaptive Computing (opens in a new tab)

  9. Regulocator: A Novel Method for the Identification of Conserved Elements in Genomic DNA

    … of putative regulatory element. It uses the Smith-Waterman algorithm to identify short, conserved DNA sequences (ranked by p-value) derived from 2 large DNA sequences of interest. No weighting is applied for spatial alignment. Although speed must be improved to make use of ReguLocator …

    iupui Repository record for Regulocator: A Novel Method for the Identification of Conserved Elements in Genomic DNA (opens in a new tab)

  10. Pipeline for the quality control of sequencing

    … using pairwise alignment information from the Smith-Waterman algorithm. The consensus sequences of the assemblies built by the pipeline are assumed to be reliable genes that can be used for gene annotation. Furthermore, we compared two pipelines, with and without the use of Lucy. The output …

    concordia Download PDF for Pipeline for the quality control of sequencing (opens in a new tab)

  11. WHISK: Web Hosted Information Into Summarized Knowledge

    … agglomerative hierarchical clustering and the Smith-Waterman algorithm to perform multi-document summarization on Reddit comments.This thesis presents WHISK as a pipeline for general multi-document text summarization based on SPORK. A generic data model in WHISK allows creating new drivers for …

    calpoly Repository record for WHISK: Web Hosted Information Into Summarized Knowledge (opens in a new tab)

  12. Implementing and Accelerating HMMER3 Protein Sequence Search on CUDA-Enabled GPU

    … One of the tools in HMMER, hmmsearch, and the Smith-Waterman algorithm are two important tools for protein sequence analysis that use dynamic programming. Both tools are particularly well-suited for many-core GPU architecture due to the parallel nature of sequence database searches. After …

    concordia Download PDF for Implementing and Accelerating HMMER3 Protein Sequence Search on CUDA-Enabled GPU (opens in a new tab)

  13. Accelerating The DNA Sequencing Pipeline

    … method, accelerates the run time of the ii Smith Waterman algorithm of Variant Calling, the last processing stage of the DNA sequencing pipeline, by 10%.

    toronto-retro Repository record for Accelerating The DNA Sequencing Pipeline (opens in a new tab)

  14. Analysis of the impact of sequencing errors on BLAST using fault injection

    … impact of faults, or errors. Three commonly used algorithms were used: BLAST, SSEARCH, and ProbCons. The main contributions of this work are the application of fault injection to the reliability analysis in bioinformatics and the quantitative demonstration that a small error rate in the sequence …

    uiuc Repository record for Analysis of the impact of sequencing errors on BLAST using fault injection (opens in a new tab)

  15. Various Algorithms for High Throughput Sequencing

    … ReCoil - an I/O efficient external memory algorithm designed for compression of very large datasets of short readsDNA data. Typically each position of DNA sequence is covered by multiple reads of a short read dataset and our algorithm makes use of resulting redundancy to achieve high …

    toronto-retro Repository record for Various Algorithms for High Throughput Sequencing (opens in a new tab)

  16. Improved Error Correction of NGS Data

    … based metric. Next, it employs the powerful Smith-Waterman algorithm to refine the groups and generate Multiple Sequence Alignments (MSAs). These MSAs are corrected by taking each column and looking for the correct base, determined by a user-adjustable percentage. This manuscript is …

    upv Repository record for Improved Error Correction of NGS Data (opens in a new tab)

  17. Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques

    Modern antivirus systems (AVSs) are not able to detect new polymorphic malware variants until they emerge, even when signatures of one or more variants belonging to a specific polymorphic malware family are known. Polymorphic malware can transform into functionally identical variants of themselves. …

    auckland-tech Repository record for Identifying Polymorphic Malware Variants Using Biosequence Analysis Techniques (opens in a new tab)

  18. Shlukování proteinových sekvencí na základě podobnosti primární struktury

    Diplomová práce je zaměřena na shlukování proteinových sekvencí na základě podobnosti primárních struktur. Seznamuje s daty v podobě aminokyselin, které tvoří primární strukturu proteinů. Představuje základní algoritmy pro porovnávání podobnosti proteinových sekvencí. Popisuje shlukovou analýzu a …

    brno-tech Repository record for Shlukování proteinových sekvencí na základě podobnosti primární struktury (opens in a new tab)

  19. Porovnávání mitochondriální DNA pro identifikaci druhů

    … postupy. Byly to Needleman-Wunschův algoritmus, Smith-Watermanův algoritmus a porovnávání podobností pomocí distanční matice. S metodou porovnávání pomocí distanční matice je úzce spjat převod sekvencí molekuly DNA ze znakové podoby do numerických formátů, kterým se tato práce také zabývá. K …

    brno-tech Repository record for Porovnávání mitochondriální DNA pro identifikaci druhů (opens in a new tab)

  20. Hardwarová akcelerace algoritmu pro hledání podobnosti dvou DNA řetězců

    … především dynamické algoritmy Needleman-Wunsch a Smith-Waterman.

    brno-tech Repository record for Hardwarová akcelerace algoritmu pro hledání podobnosti dvou DNA řetězců (opens in a new tab)