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.
2019
2019
Practical shift choice in the shift-and-invert Krylov subspace evaluations of the matrix exponential
We propose two methods to find a proper shift parameter in the shift-and-invert method for computing matrix exponential matrix… 
2017
2017
Theoretical lower bounds for parallel pipelined shift-and-add constant multiplications with n-input arithmetic operators
New theoretical lower bounds for the number of operators needed in fixed-point constant multiplication blocks are presented. The… 
2015
2015
Efficient Wu Manber String Matching Algorithm for Large Number of Patterns
String matching is one of the most important concept used in computer science in various real life applications like as Intrusion… 
2012
2012
Multiple Pattern String Matching Methodologies: A Comparative Analysis
String matching algorithms in software applications like virus scanners (anti-virus) or intrusion detection systems is stressed… 
2011
2011
Simplified Quantisation in a Reduced-Lattice MIMO Decoder
Symbol detection in a lattice-reduction aided MIMO receiver depends upon appropriate quantisation in the reduced lattice and this… 
2011
2011
Mapping and Localization
Review
2010
Review
2010
Thinking Science Australia: Improving teaching and learning through science activities and reasoning
„Thinking skills‟ is one of the eight general capabilities explicitly included in the content description and achievement… 
2008
2008
Network Intrusion Detection Based on Shift-OR Circuit
+ This paper introduces a novel FPGA-based signature match co-processor that can serve as the core of a hardware-based network… 
2004
2004
A Krylov-Schur Algorithm for Matrix Products ?
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which… 
Review
1990
Review
1990
Analysis of speech and other sounds
This thesis comprises a study of various types of signal processing techniques, applied to the tasks of extracting information… 
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)