Title

Pattern Matching In Bwt-Transformed Text

Keywords

Computer science; Costs; Decoding; Filtering algorithms; Matched filters; Pattern matching; Performance evaluation; Phased arrays; Testing; USA Councils

Abstract

Summary form only given. The compressed pattern matching problem is to locate the occurrence(s) of a pattern P in a text string T using a compressed representation of T, with minimal (or no) decompression. The BWT performs a permutation of the characters in the text, such that characters in lexically similar contexts will be near to each other. The motivation for our approach is the observation that the BWT provides a lexicographic ordering of the input text as part of its inverse transformation process.

Publication Date

1-1-2002

Publication Title

Data Compression Conference Proceedings

Volume

2002-January

Number of Pages

445-

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/DCC.2002.999988

Socpus ID

24144444376 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/24144444376

This document is currently not available here.

Share

COinS