An Efficient Algorithm for Generating Super Condensed Neighborhoods
Luís M. S. Russo,
Inesc-ID –
Abstract:
Approximate string matching is the problem of finding a pattern in a text
allowing for some errors to occur.
Indexing methods for the approximate string matching problem spend a
considerable effort generating condensed neighborhoods. In this session we
point out that condensed neighborhoods are not a minimal
representation of a pattern neighborhood. We show that we can restrict
our attention to super condensed neighborhoods which are minimal. We
then present a basic algorithm for generating Super Condensed
Neighborhoods. The algorithm runs in O(m s), where m is the
pattern size and s is the size of the super condensed
neighborhood. Previous algorithms took O(m c) time, where c is the
size of the condensed neighborhood. We present an implementation of the
algorithm using modern Bit-Parallelism and Increased Bit-Parallelism
techniques.
Date: 2005-Feb-10 Time: 16:30:00 Room: Room 425
For more information:
Upcoming Events
INESC-ID ESR Talks – February 2023

If you are a masters/PhD student or a postdoctoral fellow, come and present your work in an informal and friendly environment – and savour some tasty snacks!
Individual talks will be 10-15 minutes plus time for feedback. Enroll on your selected date by emailing pedro.ferreira[at]inesc-id.pt.
Happening on the second Wednesday of every month (4pm-5pm):
- 15 February (Alves Redol, Room 9)
- 15 March (Alves Redol, Room 9)
- 12 April (Alves Redol, Room 9)
- 10 May (Alves Redol, Room 9)
- 14 June (Alves Redol, Room 9)
- 12 July (Alves Redol, Room 9)
We hope to see you there!