15 results about "Seed sequence" patented technology

The application belongs to the technical field of image encryption and discloses a discrete fractional-order neural network chaotic image encryption system and method based on RNA dynamic transcription and DNA coding, which comprises a model construction module, a key generation module and an image encryption module; the model construction module is used for constructing a fractional-order neural network and making the encryption system in a hyperchaotic state based on the fractional-order neural network; the key generation module generates an RNA key stream through three rounds of dynamic transcription with a seed sequence as a starting point; the image encryption module encrypts an image through triple hybrid diffusion and then diffuses the image again based on the RNA key stream to obtain an encrypted image; the application realizes deep confusion and diffusion of image pixels by constructing a high-complexity fractional-order chaotic neural network and combining an RNA+DNA dual biological coding mechanism, thereby improving the security, randomness and robustness of the encryption system.

Examples of the invention relate to first and second communication devices for the transmission and reception of binary sequences in a communication system. Therefore, the first communication device (100) transmits a communication signal (510) to a second communication device (300), and the communication signal (510) comprises a first binary sequence which is formed based on a second binary sequence. The second binary sequence is in turn formed based on: permute a seed sequence s 0 or a binary complement of the seed sequence s 0 with a first permutation function p; extend or truncate the permuted seed sequence s 0 or the permuted binary complement of the seed sequence s 0 to a length L'; and permute the extended or truncated seed sequence s 0 or the extended or truncated binary complement of the seed sequence s 0 with a second permutation function π. Furthermore, examples of the invention also relate to corresponding methods and a computer program.

The invention relates to a multi-stage gene data accurate matching method and system, and the method comprises the steps: selecting K continuous basic groups from a to-be-processed read sequence as retrieval character strings according to a preset initial length K, and determining a matching interval of the retrieval character strings in a reference genome from a hash table constructed according to the length K in advance through a Kmer-Index algorithm; in the matching interval, carrying out base-by-base expansion and matching on the retrieval character string based on a pre-constructed FM index through an FM-Index algorithm until the number of matching positions of the retrieval character string and a reference genome is reduced to a preset matching frequency threshold value; and for each retrieval character string obtained after base-by-base expansion and matching, expanding according to a single base comparison mode until mismatching occurs, and taking the retrieval character string with the maximum number of matched bases as a finally determined seed sequence. According to the gene data accurate matching scheme, the seed search performance and the memory use efficiency can be improved, and the accurate matching position of the seed can be quickly searched under the condition of limited hardware resources.

The invention discloses a sequence alignment method and a seed search method and device thereof. The seed searching method comprises the steps that an index structure is constructed based on a reference genome sequence S, and the constructed index structure comprises an FM-Index index, a TBWT array, a TOCC array and a CNT array. And taking out the last base from the base fragments to be compared as an initial matching target, and locking the current matching region according to the CNT array and the initial matching target. And starting from the last but one basic group in the basic group fragment, matching two basic groups with S according to the current matching area and the constructed index structure in a reverse order every time until the number of the matched basic groups in the basic group fragment exceeds a preset threshold value, and taking the matched base sequence in the base fragment as a seed sequence. According to the method, the number of times of irregular memory access is reduced, so that the efficiency of a seed search task is improved, and a more efficient gene sequence comparison scheme is provided.

This invention provides a parallel multi-objective stochastic parameter optimization method and apparatus. The method includes: configuring the number of nodes in a parallel computing cluster and generating a random seed sequence; loading and compiling the model to be optimized and obtaining its global configuration; sending the global configuration to all processes, with each process generating an initial parameter population satisfying the global configuration constraints based on the random seeds, and serially evaluating the objective function value; each process iteratively executing a shuffling complex evolution until convergence is met; and each process outputting its optimal parameter vector and corresponding objective function value to the root process, which then determines the global optimal solution. This invention significantly improves the accuracy and efficiency of parameter optimization, solving the problem of poor model optimization performance in existing related technologies.

The application provides a privacy protection method for genome multi-sequence alignment based on secret sharing, comprising the following steps: step one, a query party splits a genome sequence in a genome dataset; step two, the query party constructs a local public sub-sequence set; step three, a computing node A acquires a seed sequence set by alignment; step four, the query party locally reconstructs a seed sequence order; step five, the query party splits the genome sequence to obtain a sequence to be aligned; step six, the query party locally constructs secret sharing data slices; step seven, the computing nodes A and B perform multi-sequence alignment on the secret sharing data slices; and step eight, the query party restores and obtains a multi-sequence alignment calculation result. The application protects the privacy information of the genome sequence in the multi-sequence alignment process when realizing high-precision approximate multi-sequence alignment, and realizes the privacy protection of the genome multi-sequence alignment.

The invention relates to the technical field of gene detection, in particular to crRNA containing double differential bases and application of the crRNA. The crRNA containing the double differential bases is crRNA having two differential bases with a seed sequence or a sequence containing the seed sequence, and the positions of the two differential bases are any one of the second base, the fourth base, the seventh base, the ninth base, the twelfth base, the fourteenth base, or the seventeenth base and the nineteenth base which are away from the fifth end of the seed sequence. A large number of experiments prove that the crRNA introduced with two differential bases can greatly improve the detection sensitivity in one-step reaction, more importantly, the difference of a single base can be effectively distinguished, and wild type crRNA and single differential base modified crRNA cannot be effectively distinguished.

This invention discloses a method for identifying thermosensitive UDG constraint anchor points based on dual-path evolutionary analysis. The invention employs two paths for site identification. The first path constructs a two-layer multi-sequence alignment within the sequence space defined by the UDG family type 1 gate, consisting of a whole-family layer and a cold-adapted subset layer. This is combined with column-level conservation, branch dissimilarity, and conserved functional motif neighborhood window constraints to obtain a set of functional motif constraint anchor points. The second path constructs homologous multi-sequence alignments centered on the seed sequence, fusing alignment statistics with a sequence profile hidden Markov model for joint scoring to obtain a set of seed homologous core anchor points. Finally, the results from the two paths are fused in a union within the seed sequence residue coordinate system, outputting the site index and corresponding amino acid type. This can be directly used as fixed-site constraint input for thermosensitive UDG protein engineering or generative protein design.

This invention relates to a fuzzing device and method based on thread-concurrent binary relation coverage. The fuzzing device includes: an instrumentation module for inserting thread number retrieval functions and basic block number retrieval functions before each basic block in the target program, and establishing thread spaces in shared memory; a coverage calculation module for extracting the basic block numbers and their corresponding thread numbers covered by the current execution of the target program from shared memory, and calculating the binary tuple coverage of the current execution; and a coverage evaluation module for comparing the set of binary tuples covered by the current execution with all existing sets of binary tuples to determine whether to store the set of binary tuples covered by the current execution in the seed sequence. This device enhances the ability to reach critical paths, boundary conditions, and combinations of critical states, improving exploration efficiency and the ability to trigger concurrent defects with controllable testing costs.

Examples of the invention relate to first and second communication devices for the transmission and reception of binary sequences in a communication system. Therefore, the first communication device (100) transmits a communication signal (510) to a second communication device (300), and the communication signal (510) comprises a first binary sequence which is formed based on a second binary sequence. The second binary sequence is in turn formed based on: permute a seed sequence s0 or a binary complement of the seed sequence s0 with a first permutation function p; extend or truncate the permuted seed sequence s0 or the permuted binary complement of the seed sequence s0 to a length L'; and permute the extended or truncated seed sequence s0 or the extended or truncated binary complement of the seed sequence s0 with a second permutation function π.Furthermore, examples of the invention also relate to corresponding methods and a computer program.

This disclosure proposes a method for compressing and decompressing gene data, and an electronic device. The method includes: when gene data to be compressed needs to be compressed, determining a target species matching a seed sequence set and a reference genome of the target species from a pre-established reference database; comparing the gene data and the reference genome to determine the location and difference information of the gene data within the reference genome; and processing the location and difference information to obtain the compressed gene data. Thus, based on the seed sequence set of the gene data to be compressed, the matching reference genome of the target species is directly identified, and based on the reference genome, efficient compression of the gene data is achieved, improving the compression efficiency of gene data and thereby reducing the storage space occupied by the gene data.

The invention relates to a protocol fuzz test initial seed generation method, system and device and a storage medium. The method comprises the following steps: identifying code snippets which are highly related to protocol state processing logic in source codes of the network service; protocol states and message processing logics corresponding to the protocol states are extracted from the code snippets, transfer relations between the states are analyzed and instantiated, and integrity review and automatic complementation are conducted on an instantiated state transfer relation set in combination with protocol contexts; based on a protocol initial state and a state transition relation, a seed sequence is constructed according to a state depth guide hierarchy, a seed set is optimized through a duplicate removal mechanism, a semantic missing part is analyzed by using a large language model, key interaction content is automatically complemented, and a high-quality initial seed set is generated. According to the method, the automation, high efficiency and generalization of the seed generation process can be realized, the depth and breadth of fuzzy testing are remarkably improved, and the labor cost is reduced, so that the efficiency and effect of network protocol vulnerability mining are improved.

This invention discloses a gray-box fuzzing method and system for the Some / IP protocol, comprising: calculating the generation probability of each element of each seed sequence in the acquired protocol data packet; calculating the replication probability based on the seed sequence and the corresponding sensitive element sequence; extracting sensitive elements by maximizing the conditional probability of the sensitive element sequence as the objective function; constructing a corpus using ID as an index, and using sensitive elements, relative offsets, weights, and response status codes; selecting corresponding corpora from the corpus according to the protocol status for the protocol data packet to be mutated, and replacing and mutating it with the sensitive element corresponding to the maximum weight and the relative offset; and completing the fuzzing test by monitoring the execution of the test cases. The method identifies the sensitive structure of the protocol data packet to optimize the mutation strategy, thereby improving the seed generation quality, fuzzing efficiency, and vulnerability detection capabilities through a structure-sensitive mutation strategy.

The application discloses a construction method and device for generating three-phase complementary triad based on Kronecker product, and belongs to the technical field of communication systems. The construction method comprises the following steps: taking a three-phase complementary triad (a, b, c) with a random length of M as a seed sequence; carrying out bit interleaving on the three-phase complementary triad (a, b, c) to generate a sequence d; taking a three-phase 3*3 complete complementary code K with a random length of N; connecting the complete complementary code K in series into three parts k1, k2 and k3; and respectively obtaining the Kronecker products of the sequence d and k1, k2 and k3. The construction device comprises a control circuit, a switch circuit, six input shift registers, three multipliers and three output shift registers. The sequence length and the zero correlation zone width of the three-phase complementary triad obtained by the application are adjustable, the three-phase aperiodic Z complementary sequence triad and the Golay complementary sequence triad with the maximum zero correlation zone width can be generated, and the application can be applied to orthogonal frequency division multiplexing transmission and channel estimation in a wireless communication process.

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.