Suchergebnisse - Myer's bit-parallel algorithm

Bit-Parallel Witnesses and Their Applications to Approximate String Matching von Hyyrö, Heikki, Navarro, Gonzalo

Volltext

Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology von Gudur, Venkateshwarlu Yellaswamy, Maheshwari, Sidharth, Bhardwaj, Swati, Acharyya, Amit, Shafik, Rishad

“… Myers bit-vector algorithm for approximate string matching (ASM) is a dynamic programming based approach that takes advantage of bit-parallel operations …”
Volltext

A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment von Kimura, Kouichi, Koike, Asako, Nakai, Kenta

“… Myers' elegant and powerful bit-parallel dynamic programming algorithm for approximate string matching has a restriction that the query length should be within the word size of the computer, typically 64 …”
Weitere Angaben

Kalign 3: multiple sequence alignment of large datasets von Lassmann, Timo

“… Results Kalign now uses a SIMD (single instruction, multiple data) accelerated version of the bit-parallel Gene Myers algorithm to estimate pairwise distances, adopts …”
Volltext

Kalign 3: multiple sequence alignment of large data sets von Lassmann, Timo

“… Kalign now uses a SIMD accelerated version of the bit-parallel Gene Myers algorithm to estimate pariwise distances, adopts a sequence embedding strategy and the bi-secting K-means algorithm …”
Volltext

Bit-parallel sequence-to-graph alignment von Rautiainen, Mikko, Mäkinen, Veli, Marschall, Tobias

“… Results We generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers …”
Volltext

An FPGA Based Energy-Efficient Read Mapper With Parallel Filtering and In-Situ Verification von Gudur, Venkateshwarlu Yellaswamy, Maheshwari, Sidharth, Acharyya, Amit, Shafik, Rishad

“… It employs approximate string matching and dynamic programming-based algorithms on a large volume of data and associated structures, making it a computationally intensive process …”
Volltext

Practical Algorithms for Biological Sequence Analysis : Methods and Applications von Retha, Ahmad

“… In this thesis I present the work I have done to implement new heuristic and exact string algorithms and show how they can be applied with existing algorithms to perform sequence analysis …”
Volltext

Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model von Equi, Massimo, Arianne Meijer-van de Griend, Mäkinen, Veli

“… Many problems that can be solved in quadratic time have bit-parallel speed-ups with factor \(w\), where \(w …”
Volltext

Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching von Hyyrö, Heikki

“… We propose a new variant of the bit-parallel NFA of Baeza-Yates and Navarro (BPD) for approximate string matching …”
Volltext

Bit-parallel approximate string matching algorithms with transposition von Hyyrö, Heikki

“… ) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size …”
Volltext

Accelerating Seed Location Filtering in DNA Read Mapping Using a Commercial Compute-in-SRAM Architecture von Golden, Courtney, Ilan, Dan, Cebry, Nicholas, Batten, Christopher

“… We accelerate the Myers' bit-parallel edit …”
Volltext

Bit-parallel sequence-to-graph alignment von Rautiainen, Mikko, Veli M kinen, Marschall, Tobias

“… Here, we generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers' bitvector algorithm for semi-global alignment …”
Volltext

OpenCL-based FPGA Accelerator for Semi-Global Approximate String Matching Using Diagonal Bit-Vectors von Castells-Rufas, David, Marco-Sola, Santiago, Aguado-Puig, Quim, Espinosa-Morales, Antonio, Moure, Juan Carlos, Alvarez, Lluc, Moreto, Miquel

“… Previous attempts to solve the same problem in FPGA use the Myers algorithm following a column approach to compute the dynamic programming table …”
Volltext