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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We propose two methods to find a proper shift parameter in the shift-and-invert method for computing matrix exponential matrix… 
2012
2012
String matching algorithms in software applications like virus scanners (anti-virus) or intrusion detection systems is stressed… 
2011
2011
Symbol detection in a lattice-reduction aided MIMO receiver depends upon appropriate quantisation in the reduced lattice and this… 
2011
2011
2006
2006
Cross-correlation interference introduced by stronger GPS signals constitutes a major problem in acquisition and tracking. For… 
1997
1997
In this paper a methodology for reducing the power consumption of shift-and-add operations in general and especially of CORDIC… 
1997
1997
This dissertation proposes and evaluates compiler techniques that enhance cache locality and consequently improve the performance… 
1997
1997
A new straightforward design of a special class of elliptic IIR filters is presented. The major goal is the complexity reduction… 
Review
1990
Review
1990
This thesis comprises a study of various types of signal processing techniques, applied to the tasks of extracting information… 
1986
1986
A method for designing high-performance digital filters using only a relatively small number of shift-and-add operations per…