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.
2017
2017
New theoretical lower bounds for the number of operators needed in fixed-point constant multiplication blocks are presented. The… 
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
Review
2010
Review
2010
„Thinking skills‟ is one of the eight general capabilities explicitly included in the content description and achievement… 
2006
2006
Cross-correlation interference introduced by stronger GPS signals constitutes a major problem in acquisition and tracking. For… 
Review
2004
Review
2004
There is increasing evidence that youth’s participation in challenging out-of-school activities influences their behavioral… 
2004
2004
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which… 
1997
1997
The rational Krylov sequence (RKS) method is a generalization of Arnoldi's method. It constructs an orthogonal reduction of a… 
Review
1990
Review
1990
This thesis comprises a study of various types of signal processing techniques, applied to the tasks of extracting information…