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

  1. 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)

  2. 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)

  3. 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 —SmithWaterman algorithm (the three algorithms are a part of ADaCGH tool) and Cluster Along Chromosome (CLAC) which is not …

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

  4. 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)

  5. 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)