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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Growing test data volume and excessive test power consumption in scan-based testing are both serious concerns for the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
This paper presents a new paradigm of design methodology to reduce the complexity of application-specific finite-impulse response… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We propose efficient preconditioning algorithms for an eigenvalue problem arising in quantum physics, namely the computation of a… (More)
  • figure 3.1
  • figure 3.2
  • figure 6.1
  • figure 6.2
  • table 8.1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The Scalable Library for Eigenvalue Problem Computations (SLEPc) is a software library for computing a few eigenvalues and… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
2004
Highly Cited
2004
For the nonlinear eigenvalue problem T (λ)x = 0 we propose an iterative projection method for computing a few eigenvalues close… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
Given a text T [1 . . . n] and a pattern P [1 . . . m] over some alphabet Σ of size σ, finding the exact occurrences of P in T… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In this paper we describe an efficient algorithm for multiplication in 2m , where the field elements of 2m are represented in… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study large, sparse generalized eigenvalue problems for matrix pencils, where one of the matrices is Hamiltonian and the other… (More)
Is this relevant?
1999
1999
This paper considers the Shift-And approach to the problem of pattern matching in LZW compressed text, and gives a new algorithm… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Until now the use of high radices to implement modular multiplication has been questioned, because it involves complex… (More)
  • figure 1
Is this relevant?