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.
2018
2018
Shock buffet on wings encountered in edge-of-the-envelope transonic flight remains an unresolved and disputed flow phenomenon… 
2015
2015
In this study, the authors present a multiplier-less, high-speed and low-power pipeline architecture with novel dual Z-scanning… 
2012
2012
String matching algorithms in software applications like virus scanners (anti-virus) or intrusion detection systems is stressed… 
2010
2010
The sexual system of the semi-terrestrial shrimp Merguia rhizophorae is described, along with natural history observations on… 
Review
2010
Review
2010
Digital co-addition of astronomical images is a common technique for increasing signal-to-noise ratio (S/N) and image depth. A… 
2006
2006
In this paper, we propose a new CORDIC algorithm and architectures which can generate close-to-optimum rotation sequences easily… 
Highly Cited
1999
Highly Cited
1999
This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm… 
1999
1999
The authors propose an extension to the popular {2/sup n/-1, 2/sup n/, 2/sup n/+1} moduli set by adding a fourth modulus "2/sup n… 
1997
1997
In this work, a fast radix-4 redundant CORDIC algorithm with variable scale factor is proposed. The algorithm includes an on-line… 
1991
1991
A new autofocus algorithm with a very high computational efficiency is presented. Although based on a completely different…