5 results about "Suffix array" patented technology

The invention discloses a multi-sequence parallel comparison method based on maximum precision matching, and relates to the technical field of crossing of bioinformatics and computational biology. The method comprises the following steps: splicing character strings of a plurality of sequences to obtain a long sequence, and determining a suffix array and a longest common prefix array of the long sequence by adopting a mode of combining a bucket dividing strategy and induced sequencing; according to the suffix array, searching a maximum accurate matching fragment from the longest common prefix array, and screening an ordered and non-overlapped maximum accurate matching fragment set through a dynamic programming technology; expanding each maximum accurate matching fragment in the maximum accurate matching fragment set to all sequences to form a chain; segmenting the long sequence through a chain to obtain a plurality of sub-sequence sets; and calling third-party multi-sequence comparison software to compare the plurality of sub-sequence sets, and splicing the comparison result of each sub-sequence set to obtain a multi-sequence comparison result. According to the method, the time complexity of ultra-long or large-scale sequence data comparison is reduced.

Embodiments of the invention provide a query cardinal number determination method and apparatus, relate to the technical field of databases, and can reduce the space overhead when determining a query cardinal number. The method comprises the following steps: determining a maximum target suffix in suffix data of target data; and determining a query cardinal number of the target data based on the target suffix, a suffix array of the character string in the database and a target function used for indicating a character distribution condition.

The application relates to the technical field of server content management, in particular to a server content updating and rollback method based on static technology; the application detects storage hot area changes through an entropy value difference matrix, combines a time stamp marking feature moment, realizes accurate division and unique identification of a historical version, avoids redundant operations of full scanning, only carries out version processing on a change hot area, significantly optimizes storage space utilization, and improves the efficiency and accuracy of version tracing; the application generates an incremental patch through a binary difference algorithm accelerated by a suffix array, combines network topology optimization to build an optimal transmission path, adds error correction code check information to data blocks, reduces data transmission volume, enhances transmission fault tolerance through the error correction code, and ensures data integrity and transmission efficiency when network fluctuation or node failure occurs.

The application relates to the technical field of computers, and provides a correctness verification method, device and equipment of a large text sequence BWT and a medium. The method comprises the following steps: blocking a character string X and a suffix array thereof, recursively calling block induction sorting to contract the character string X until the characters in the contracted character string X1 are unique; in the backtracking stage of the recursion 0 layer, the order of S* type suffixes of the character string X is calculated according to the suffix array of X1, and the hash value of the descending S* type suffix sequence is calculated; according to the order of the S* type suffixes of the character string X, the L type and S type suffix predecessor character sequence and the hash value thereof of each block are calculated; the L* type suffix order and the hash value of each block of the L type BWT sequence are calculated by using a small top heap; the S* type suffix sequence and the hash value of each block of the S type BWT sequence are calculated by using a large top heap; and the two types of BWT sequences are combined, and the final verification result is output, so that the time and space overheads of BWT correctness verification are reduced.

The application relates to the field of bioinformatics, and relates to a method for improving gene sequence alignment based on BWT transformation by using a multiplication algorithm. First, a suffix array is directly calculated by using the multiplication algorithm through a reference long sequence, and then data structures required by BWT transformation are obtained. The BWT matrix does not need to be stored in space, N*N two-dimensional space is saved, and time is greatly improved. Seed sequences are subjected to pretreatment operation, the seed sequences are sorted, the same suffixes are gathered together, the intermediate result of the previous seed sequence alignment is conveniently saved, and the number of alignment times is reduced. After the sa interval is found, a search is conducted by using a BFS (Breadth-First Search) method, the BFS can guarantee that the optimal sequence score is found as soon as possible, the optimal sa is not missed, then a heap data structure is used for storage, the top of the heap is the highest score each time, the highest score item is obtained each time to conduct the next layer search, and the optimal matching result is obtained until the matching is finished.