Approximate String Matching with Compressed Indexes
A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed indexes, there has not been much progress on...
Main Authors: | Pedro Morales, Arlindo L. Oliveira, Luís M. S. Russo, Gonzalo Navarro |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2009-09-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/2/3/1105/ |
Similar Items
-
LEMPEL-ZIV SLIDING WINDOW UPDATE WITH SUFFIX ARRAYS
by: Artur Ferreira, et al.
Published: (2013-06-01) -
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees
by: Dominik Köppl
Published: (2021-01-01) -
Reversed Lempel–Ziv Factorization with Suffix Trees <sup>†</sup>
by: Dominik Köppl
Published: (2021-05-01) -
Compressed Communication Complexity of Hamming Distance
by: Shiori Mitsuya, et al.
Published: (2021-04-01) -
Practical Compressed Suffix Trees
by: Gonzalo Navarro, et al.
Published: (2013-05-01)