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
Multiplier-less pipeline architecture for lifting-based two-dimensional discrete wavelet transform
In this study, the authors present a multiplier-less, high-speed and low-power pipeline architecture with novel dual Z-scanning… 
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… 
2012
2012
Fast exponential time integration scheme for option pricing with jumps
A fast exponential time integration scheme is considered for pricing European and double barrier options in jump‐diffusion models… 
Review
2010
Review
2010
Pencil-Beam Surveys for Trans-Neptunian Objects: Novel Methods for Optimization and Characterization
Digital co-addition of astronomical images is a common technique for increasing signal-to-noise ratio (S/N) and image depth. A… 
Highly Cited
2001
Highly Cited
2001
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
The performance of elliptic curve cryptosystems is primarily determined by an efficient implementation of the arithmetic… 
Highly Cited
1999
Highly Cited
1999
Shift-And Approach to Pattern Matching in LZW Compressed Text
This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm… 
1999
1999
A reverse converter for the 4-moduli superset {2/sup n/-1, 2/sup n/, 2/sup n/+1, 2/sup n+1/+1}
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… 
1998
1998
A Parallel Rational Krylov Algorithm for Eigenvalue Computations
An implementation of a parallel rational Krylov method for the generalised matrix eigenvalue problem is discussed. The… 
Highly Cited
1998
Highly Cited
1998
Fast searching on compressed text allowing errors
We present a fast compression and decompression scheme for natural language texts that allows efficient and flexible string… 
1991
1991
A NEW FREQUENCY DOMAIN AUTOFOCUS A LGORITHM FOR SAR
A new autofocus algorithm with a very high computational efficiency is presented. Although based on a completely different… 
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)