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 “"Needleman-Wunsch"”.

  1. A distributed CPU-GPU framework for large-scale pairwise alignment

    … comparison can be performed with the well-known Needleman-Wunsch alignment algorithm. However, with the rapid growth of biological databases, performing all possible comparisons with this algorithm in serial becomes extremely time-consuming. The massive computational power of graphics processing …

    missouri Repository record for A distributed CPU-GPU framework for large-scale pairwise alignment (opens in a new tab)

  2. New Methods to Improve Protein Structure Modeling

    … alignment algorithm extending the famous Needleman-Wunsch algorithm to obtain a complete set of alignments yielding Pareto optimality. Then, we use protein sequence and structural information as objectives and generate the complete Pareto optimal front of alignments between target sequence …

    odu Repository record for New Methods to Improve Protein Structure Modeling (opens in a new tab)

  3. Digital Pianoforte Tutor: A Computer based evaluator for Piano Playing

    … in Java; while Note Alignment made use of Needleman Wunsch (NW) global alignment algorithm to identify playing mistakes, and Music Visualisation made use of piano roll notation and MuseScore digital score notation to give a visual musical representation. Keywords: optical music recognition, …

    westminster

  4. Data-Driven Design of Spontaneously-Organized Super-Peptides on Atomic Single Layer Solids

    … strength using, e.g., fluorescent microscopy. Needleman-Wunsch based similarity analysis and machine learning algorithms are then used to create a scoring matrix capable of identifying robust and weak binders for the particular material amongst millions of random permutations of amino acid …

    washington Repository record for Data-Driven Design of Spontaneously-Organized Super-Peptides on Atomic Single Layer Solids (opens in a new tab)

  5. Communication avoiding parallel algorithms for amorphous problems

    Parallelizing large sized problem in parallel systems has always been a challenge for programmer. This difficulty is caused by the complexity of the existing systems as well as the target problems. This is becoming a greater issue as the data sizes are constantly growing and as a result, larger …

    uiuc Repository record for Communication avoiding parallel algorithms for amorphous problems (opens in a new tab)