Method and system for sequencing suffixes in BWT (burrows-wheeler transform) implementation method

An implementation method and suffix technology, applied in concurrent instruction execution, machine execution devices, electrical components, etc., can solve the problems of large resource consumption and low compression rate

Active Publication Date: 2013-05-22
INST OF COMPUTING TECH CHINESE ACAD OF SCI
View PDF2 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The first object of the present invention is to propose a method and system for sorting suffixes in the BWT implementation method, and to solve the problem of large resource consumption and low compression rate of the original BWT transformation method by balancing the transformation time and resource consumption

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for sequencing suffixes in BWT (burrows-wheeler transform) implementation method
  • Method and system for sequencing suffixes in BWT (burrows-wheeler transform) implementation method
  • Method and system for sequencing suffixes in BWT (burrows-wheeler transform) implementation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0064] The present invention will be more fully described and illustrated below using exemplary embodiments of the present invention with reference to the accompanying drawings.

[0065] Figure 10 It is a flowchart of a method for sorting suffixes in a BWT implementation method of the present invention. Such as figure 1 As shown, the method includes:

[0066] Step 1, take out the suffixes that need to be sorted from the sequence to be transformed in BWT;

[0067] Step 2, judging whether the segment with the beginning element of the suffix as the broken head element has appeared in the suffix linked list, the ASCII value of the beginning element of the suffix is ​​i, if the register appear[i]=1, it has appeared, Execute step 3; if the register appear[i]=0, then it has not appeared, and execute step 4, wherein appear[i] represents whether the segment whose element represented by the number i in the ASCII table is the first element of the segment has already appeared;

[006...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method and a system for sequencing suffixes in a BWT (burrows-wheeler transform) implementation method. The method includes acquiring positions of the suffixes through bidirectional research on to-be-sequenced suffixes, sequencing the suffixes and upgrading information. Through balance of time changing and resource consumption, the problems of large resource consumption and low compression rate caused by an original BWT method are solved. By the method and the system, high data compression speed and simple data compression can be achieved, resource utilization is reasonable, and substantial resources are saved.

Description

technical field [0001] The invention relates to the field of data compression technology and hardware design, in particular to a method and system for sorting suffixes in a BWT implementation method. Background technique [0002] Data compression refers to a technical method to reduce the amount of data to reduce storage space and improve its transmission, storage and processing efficiency without losing information. Or reorganize the data according to a certain algorithm to reduce data redundancy and storage space. Data compression includes lossy compression and lossless compression. [0003] As a lossless compression, Bzip2 has higher compression efficiency than traditional GZIP or ZIP, but its compression speed is slower and consumes more resources. Bzip2 first performs pre-transformation and stroke length encoding on the files to be compressed, then uses BWT (Burrows-Wheeler Transform) to convert repeated character sequences into strings of the same letters, and then u...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H03M7/30G06F9/38
Inventor 俞健康侯锐张继璠龙冰洁李冰
Owner INST OF COMPUTING TECH CHINESE ACAD OF SCI
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap