Parallel Compressed-Domain Pattern Matching Algorithms With Burrows Wheeler Transform For Biological Data

Loading...
Thumbnail Image
Date
2010-05
Authors
Umar, Ibrahim
Journal Title
Journal ISSN
Volume Title
Publisher
Universiti Sains Malaysia
Abstract
Data compression is one of the solution to overcome data storage problem. Unfortunately, compression may have removed a great deal of information structure that will make searching s desired piece of data difficult. Burrows-Wheeler Transform (BWT) compression offers a very effective compression ratio and a pomising potential in terms of text searching because of its close relationship with text index. We proposed two efficient parallel text searching algorithms and a compact compressed data representation for biological data derived from BWT named Compressed Semi-self Index (cSSI).
Description
Keywords
Data compression is one of the solution , to overcome data storage problem
Citation