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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com