Skip to search formSkip to main contentSkip to account menu

Bitap algorithm

Known as: Shift or algorithm, Shift-or algorithm, Shift-Or 
The bitap algorithm (also known as the shift-or, shift-and or Baeza-Yates–Gonnet algorithm) is an approximate string matching algorithm. The… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Approximate string matchingBitwise operationCommunications of the ACMDamerau–Levenshtein distance

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Quantum Latin squares and unitary error bases
In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and… 
2014
2014
Low-Complexity Multiplierless Constant Rotators Based on Combined Coefficient Selection and Shift-and-Add Implementation (CCSSI)
This paper presents a new approach to design multiplierless constant rotators. The approach is based on a combined coefficient… 
Highly Cited
2010
Highly Cited
2010
Computing Rightmost Eigenvalues for Small-Signal Stability Assessment of Large-Scale Power Systems
Knowledge of the rightmost eigenvalues of system matrices is essential in power system small-signal stability analysis. Accurate… 
Review
2005
Review
2005
Identity as a Source of Moral Motivation
Theory and research regarding moral motivation has focused for decades on the roles of moral reasoning and, to some extent, moral… 
Highly Cited
2004
Highly Cited
2004
A methodology for synthesis of efficient intrusion detection systems on FPGAs
Intrusion detection for network security is a computation intensive application demanding high system performance. System level… 
Highly Cited
2004
Highly Cited
2004
A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM
In this paper, we present a novel fixed-point 16-bit word-width 64-point FFT/IFFT processor developed primarily for the… 
Highly Cited
2003
Highly Cited
2003
Choice of Travel Mode in the Theory of Planned Behavior: The Roles of Past Behavior, Habit, and Reasoned Action
Relying on the theory of planned behavior (Ajzen, 1991), a longitudinal study investigated the effects of an intervention… 
Review
1992
Review
1992
CORDIC-based VLSI architectures for digital signal processing
The evolution of CORDIC, an iterative arithmetic computing algorithm capable of evaluating various elementary functions using a… 
Highly Cited
1992
Highly Cited
1992
A new 'shift and ratio' method for MOSFET channel-length extraction
A shift-and-ratio method for extracting MOSFET channel length is presented. In this method, channel mobility can be any function… 
Highly Cited
1989
Highly Cited
1989
Algorithm engineering for public key algorithms
Methods of implementing public key algorithms based on modular integer arithmetic (RSA) and finite-field arithmetic (Diffie… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)