Search Results - Myer's bit-parallel algorithm

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

Get full text

Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology by 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…”
Get full text

A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment by 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…”
Get more information

Kalign 3: multiple sequence alignment of large datasets by 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…”
Get full text

Kalign 3: multiple sequence alignment of large data sets by 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…”
Get full text

Bit-parallel sequence-to-graph alignment by 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…”
Get full text

An FPGA Based Energy-Efficient Read Mapper With Parallel Filtering and In-Situ Verification by 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…”
Get full text

Practical Algorithms for Biological Sequence Analysis : Methods and Applications by 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…”
Get full text

Quantum Linear Algorithm for Edit Distance Using the Word QRAM Model by 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…”
Get full text

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

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

Bit-parallel approximate string matching algorithms with transposition by 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…”
Get full text

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

“… We accelerate the Myers' bit-parallel edit…”
Get full text

Bit-parallel sequence-to-graph alignment by 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…”
Get full text

OpenCL-based FPGA Accelerator for Semi-Global Approximate String Matching Using Diagonal Bit-Vectors by 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…”
Get full text