Method and data processing device for processing genetic data - Patents.com
By forming overlapping sequence fragments and encoding genetic data irreversibly, the method addresses inefficiencies and security concerns in genetic data processing, enabling secure and efficient searching without compromising privacy.
Patent Information
- Application Number
- JP2022536935
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2019-12-20
- Filing Date
- 2020-12-16
- Publication Date
- 2024-11-07
- Estimated Expiration
- 2040-12-16
AI Technical Summary
Existing methods for processing and searching genetic data are inefficient and insecure, particularly due to the large volume of data, the time-consuming nature of sequence searches, and the impossibility of complete anonymization, which compromises data security and restricts access.
A method involving the formation of overlapping sequence fragments from genetic data, applying an irreversible and collision-resistant encoding function to generate encrypted fragment data, which is stored without order and can be searched efficiently without decryption, ensuring data security.
Enables effective and secure searching of genetic data without revealing the original data, allowing access while maintaining privacy and complying with data protection regulations.
Smart Images

Figure 0007579343000001 
Figure 0007579343000002 
Figure 0007579343000003
Abstract
Description
[Technical field]
[0001] The present invention relates to a method and a data processing device for processing, in particular for encrypting genetic data representing a set of biomolecules, such as data from nucleotide, amino acid and / or protein sequences. The present invention also relates to a method for querying a database containing encrypted genetic data generated and stored using said method. Applications of the present invention are in the fields of bioinformatics, medicine, cell biology, stem cell technology, pharmacology and / or biotechnology, in particular in the field of processing genetic data. [Background technology]
[0002] It is generally known that effective sequencing technologies have significantly increased over the last few years the possibilities for genetic data to be recorded and stored, and the extent to which genetic data is stored in clinical facility databases, for example, genetic data is obtained from multiple patients at a clinical facility and stored together with other data relating to the patients, such as identification data and data relating to the patient's life and / or health status.
[0003] These data are not only for diagnostic and therapeutic purposes in the examination and / or treatment of the patient. Rather, these data are a valuable repository of information for research and development, for example in pharmacology. Genetic data can provide information on the causes of disease or disease mechanisms. Genetic data also allow the development of personalized treatments or behavioral or nutritional recommendations and their individual application to patients. Also, for research purposes, there is an interest to access genetic data and identify, for example, specific individuals or cell samples derived from these individuals with a given genetic disposition (and, where relevant, specific disease and lifestyle conditions) for the purpose of targeting, for example, pharmacological agents, as disease models, or for the analysis of disease causes.
[0004] There is therefore interest in searching the accumulated genetic data of large numbers of individuals for the presence or absence of a given characteristic, e.g., a given amino acid sequence, and in obtaining the genetic data of the individuals thereby identified and using it for further investigation.
[0005] However, when searching for and processing individual genetic data obtained clinically or through other means, and when sharing such data (data sharing), the following problems arise, particularly in international cooperation:
[0006] The human genome has about 3 billion base pairs. In the investigation of data of a large number of individuals, for example tens of thousands of patients, a very large amount of data is generated, and it is very laborious to search for a specific search sequence or combination of search sequences. Thus, there is an interest in improving the efficiency (e.g., energy usage and / or duration) of searching genetic data.
[0007] A further constraint in the search for genetic data is the individual's own interest in protecting their data. Genetic data defines the innate and / or acquired hereditary characteristics of humans and is uniquely sensitive information. It is currently believed that even after separating genetic data from the associated personal identification data, it is still possible to match the data to a specific individual. Complete anonymization of genetic data would require its falsification, after which further reliable investigation of the data would not be possible. Thus, genetic data can at best be pseudo-named, but never fully anonymous.
[0008] Therefore, data security (protection against loss, misuse, alteration and / or other threats) is a substantial requirement for the operation of databases with genetic data. Human-related data is subject to legally regulated protection against misuse, for example in Germany by the General Data Protection Regulation (DSGVO).
[0009] Due to legal rules on data protection, access by third parties to databases with clinically derived genetic data is usually precluded, in particular physically interrupted. Since it is essentially impossible or difficult to anonymize genetic data, neither open access via data networks nor conditional access for authorized inquiries is possible. In order to be able to further exploit the potential of genetic data relating to humans for research and development or other research purposes while guaranteeing data protection, new approaches to the handling of genetic data are of interest.
[0010] It is known to store encrypted genetic data for compression purposes. Encryption can be done, for example, by using a hash function. Saving storage space by binary coding of DNA sequences has been proposed by A. Mehta et al. in “DNA compression using hash based data structure” in “International Journal of Information and Knowledge Management”, 2010, vol. 2, No. 2, pp. 383-386. The DNA sequence is fragmented into contiguous non-overlapping parts and coded into bits by a hash function. As a result, shorter sequences of bits are generated and stored as an alphabet together with a hash table (a “look-up” table). In the hash table, each DNA fragment is mapped to a letter. In this way, the method by A. Mehta et al. actually achieves compression of the genetic data. Separate storage of the hash table provides further advantages for data protection. However, a disadvantage is that the encrypted (e.g. hashed) DNA sequence is not searchable. To check whether a particular subsequence is included, the complete DNA sequence must first be unpacked. Only then can the subsequences be searched, but this again leads to the high level of effort mentioned above and compromises data security.
[0011] Furthermore, for faster retrieval of genetic data, it is known to index it by hashing (see the presentation “Bitpacking techniques for indexing genomes: I. Hash tables” by TD Wu in “Algorithms for Molecular Biology” (2016) 11:5). The so-called “reads” are mapped to the DNA sequence and a hash table is used as a “lookup” table in which the position details of the corresponding subsections in the sequence are placed. In this case, hashing makes it possible to efficiently search the DNA sequence. However, it exists in unencrypted form and is directly readable by the user.
[0012] Further uses of hash functions are known from other fields of data processing. For example, in the encryption of a password after user registration in an application on a data network with a username and a password, the password is encoded by a cryptographic hash function. There, a randomly selected string ("salt") can be added to the password first, so that hacking the password becomes more difficult. The hash value determined by the encoding is stored in a database. When a user logs into an application with his username and his password, the password is encoded with a hash function, the determined hash value is compared with the hash value in the database and the entered username is compared with the username stored for this password. This use of hash functions requires not only the correct password required for user identification, but also the correct association of username with password. For this purpose, the username (e.g. email address) is available in plain text as a stored value in addition to the table entry for the hash value. In case of a hacker attack, the username becomes directly known, but the password is still present in encoded form. However, there are many ways to break the password, so that in case of access data being obtained, it can be considered that decryption is relatively easy in the case of simple or frequently used passwords. Data security is limited by storing the plaintext username concatenated with the hash value. [Prior art documents] [Non-patent literature]
[0013] [Non-Patent Document 1] A. Mehta and B. Patel “DNA compression using hash based data structure” International Journal of Information and Knowledge Management,2010,vol.2,No.2,pp.383-386 [Non-Patent Document 2] TDWu “Bitpacking techniques for indexing genomes:I.Hash tables” Algorithms for Molecular Biology”(2016)11:5 Summary of the Invention [Problem to be solved by the invention]
[0014] The object of the present invention is to provide an improved method and an improved data processing device, in particular for the processing of a set of physiological and / or biological data, in particular genetic data, in order to encrypt and store them, thereby avoiding the drawbacks of the prior art. The method and the data processing device are intended in particular to enable the data to be searched more effectively and / or to make the search accessible, in cases where access is restricted, without the original data becoming known to third parties during the search.
[0015] This object is achieved by a method and / or data processing device for processing genetic data, a method for querying a database, a computer program product and a computer-readable storage medium having the features of the independent claims. Advantageous embodiments and uses of the invention are disclosed by the dependent claims. [Means for solving the problem]
[0016] According to a first general aspect of the present invention, the above object is achieved by a method for processing genetic data comprising a set of sequence elements each representing a biomolecule. Preferably, a given set of sequence elements comprises at least one section of genetic material, for example only coding sections, only non-coding sections, or both coding and non-coding sections. The biomolecule comprises for example nucleotides and / or amino acids. The genetic data may comprise for example at least one gene sequence. Alternatively, the genetic data may comprise short tandem repeats (STRs) or single nucleotide polymorphism (SNP) profiles in sequence form.
[0017] Each set of sequence elements can be assigned to an individual, for example a human or animal subject. The expression "genetic data" refers to at least one set of sequence elements. A single set of sequence elements, i.e. the genetic data of a single individual, or preferably multiple sets of sequence elements, i.e. the genetic data of multiple individuals, can be processed. In other words, the genetic data of multiple individuals is preferably processed, each individual's genetic data comprising a set of sequence elements, each representing a biomolecule.
[0018] A sequence fragment is formed from the genetic data of each sequence element. The sequence fragment comprises a section of a sequence element having a fragment length of at least two sequence elements. An encoding function is applied to each of the sequence fragments to generate a plurality of encrypted fragment data, each associated with one of the sequence fragments. The encoding function is a mathematical function that assigns exactly one encrypted value to each sequence fragment, represented for example by consecutive characters. The encoding function is preferably irreversible. The irreversibility of the encoding function means that there is no mathematical inverse of the encoding function. In this embodiment of the invention, it is not possible to determine the sequence fragment from the encrypted fragment data. Furthermore, the encoding function is collision resistant, i.e., an input of two different sequence fragments results in different encrypted fragment data. Alternatively, a reversible encoding function can be used, especially in certain applications of the invention where data security is not critical. The encrypted fragment data is transferred and stored in a storage device.
[0019] According to the invention, the formation of sequence fragments is performed such that sections of a series of sequence elements overlap, and each sequence element is included in at least two sequence fragments. With respect to genetic data, the sequence fragments overlap. Thus, advantageously, each sequence element is included with at least one directly adjacent sequence element of the series of sequence elements in at least two sequence fragments of the sequence fragments. Each sequence fragment is encrypted. Advantageously, the storage in the storage device can be performed without specifying the order.
[0020] The encrypted fragment data may be stored in random order if the order is not important for later querying of the storage device. However, the order of the encrypted fragment data is preserved during storage if later retrieval of the stored data also queries the location of the particular query sequence within the totality of genetic data. Preferably, the encrypted fragment data is stored such that its association with the genetic data, i.e. the set of sequence elements of the individual, is preserved. Additionally, the encrypted fragment data may be stored together with an item of location information. Location information may include, for example, the location of the cellular material within a cell bank from which the genetic data was obtained, or the location of a database in which further information relating to the cellular material from which the genetic data was obtained is stored.
[0021] According to the invention, a method for encrypting genetic data is provided. The encrypted fragment data is advantageously not only the entire genetic data, but also all subsequences with the length of the formed sequence fragments. This allows a more efficient search for the sequence of sequence elements in the stored encrypted fragment data. As a result, the technical effect is possible that it is possible to check whether the genetic data contains the sequence elements being searched for, while reducing the time and / or energy consumption. It is particularly advantageous that the search can be performed without decryption. As a further technical effect, the invention allows removing the access restrictions to the database containing the stored encrypted fragment data, without compromising the data security. Information regarding the discovery of the searched data and / or the found data can be transferred unencrypted.
[0022] Although the encrypted fragment data represents the entirety of the genetic data, due to the irreversibility of the encoding function, it is not possible to convert the encrypted fragment data back to the genetic data: due to overlapping sequence fragments and optionally different fragment lengths, this will not be possible even with more efficient hacking techniques, and likely will not be possible in the future.
[0023] According to a second general aspect of the invention, the above object is achieved by a data processing device for processing genetic data, configured to generate and store encrypted fragment data using a method according to the first general aspect of the invention or different embodiments thereof. The data processing device comprises a fragmentation device configured to form sequence fragments such that sections of a set of sequence elements overlap and each sequence element is included in at least two sequence fragments, a coding device configured to generate a plurality of encrypted fragment data, and a storage device configured to store the encrypted fragment data. The data processing device is preferably implemented by a computer. The storage device can be part of the computer or can be a separate database.
[0024] According to a third general aspect of the invention, the above object is achieved by a method for querying a database containing encrypted fragment data generated and stored using a method according to the first general aspect of the invention or different embodiments thereof. The querying method comprises the specification of at least one search sequence comprising a predetermined sequence of sequence elements each representing a biomolecule to be searched for, applying to the at least one search sequence an encoding function used to generate the encrypted fragment data in order to generate at least one encrypted search sequence, and searching for the at least one encrypted search sequence in the stored encrypted fragment data. If the search result is positive, a response that the search sequence has been found can be returned to the user, without any inferences as to a possible particular individual, together with an item of information about which genetic data or in which sample the search sequence was found.
[0025] The search may be directed to at least one of the following search queries, for example, to identify data that is typical of a particular disease pattern: -Is the search sequence included in the encrypted fragment data? -Is the search sequence contained within a specific gene section represented by the coded fragment data? -Are there combinations and / or logical combinations of multiple search sequences (e.g., sequence 1 and sequence 2 are not sequence 3)? -Where is the biological cellular material from which the genetic data was obtained (localization function)?
[0026] The present invention has the substantial advantage of being able to answer questions of biological or medical interest without the need to have complete genetic data, such as a complete DNA sequence, available again after encoding. For example, it can be ascertained whether a particular disease-associated mutation is contained within a DNA sequence without explicitly specifying that DNA sequence.
[0027] In accordance with the present invention, unlike the compression by, for example, A. Mehta et al., sequence fragments are generated that are not contiguous but rather overlapping. The inventors have found that although the data coverage is expanded, searching for specific sequences of sequence elements is more effective. In accordance with the present invention, unlike the indexing of genetic data by TDWu, only encrypted data is stored.
[0028] According to a preferred embodiment of the invention, the fragment length of each sequence fragment is at least 3. Thus, advantageously, most search queries, especially questions of biological or medical interest regarding the occurrence of sequences of biomolecules, can be addressed without unduly increasing the encoding and storage effort.
[0029] According to a particular preferred embodiment of the invention, the formation of sequence fragments is performed by progressively reading out sections of successive sequence elements from the genetic data, proceeding one step for each new section (formation of sequence fragments by window sliding with step width 1). After specification of a fragment length and a starting element in the genetic data, each sequence fragment is provided by a series of sequence element sections starting from the starting element and all subsequent sequence elements and having a given fragment length. Advantageously, thereby for each subsequence of sequence elements of each length an associated sequence fragment is generated from the genetic data, regardless of its position in the sequence.
[0030] In a database query according to the third general aspect of the invention, once a search sequence is specified, the initial search sequence may be truncated to a search sequence length equal to the fragment length of the sequence fragment from which the encrypted fragment data was generated, thereby advantageously adapting the length of the search sequence to the length of the segment fragment mapped to the encrypted fragment data.
[0031] Preferably, all sequence fragments have the same length (number of sequence elements), which ensures systematic and uniform coverage of the genetic data.
[0032] Alternatively, the sequence fragments may have different lengths. According to this alternative embodiment of the invention with different fragment lengths, the sequence fragments may form a plurality of fragment groups of sequence fragments, the sequence fragments in each fragment group respectively having the same length and the sequence fragments in the different fragment groups having different lengths, the formation of the sequence fragments being performed such that within each fragment group, sections of a series of sequence elements overlap and each sequence element is included in at least two sequence fragments. When applying a hash function as an encoding function, each fragment group provides a hash value table. This embodiment has the particular advantage that a database in which the encrypted fragment data is stored can be searched for occurrences of search sequences with different lengths, so that a high amount of information can be obtained by querying the database. In genetic data, occurrences of search sequences of freely selectable lengths (within the range of lengths of the sequence fragments of the fragment group) can be found without knowing the genetic data. The fragment length can be greater than 3, for example up to 20 or more. For example, fragment groups can be selected from the sequence fragments due to a hierarchically ordered structure of the stored data. The hierarchically ordered structure of the genetic data can be used to generate nested arrangements of the data and / or clusters, for example based on fragment size or so-called B-trees.
[0033] According to a further particularly advantageous embodiment of the invention, the encoding function is a hash function and the encrypted fragment data is a hash value. The hash function maps the sequence fragments, i.e. sequences of sequence elements of a freely selectable length, respectively, specifically irreversibly, to one hash value. The use of hash functions for encryption has particular advantages, since hash functions are available, well studied, and are irreversible, so that it is impossible or extremely difficult to decipher the genetic data from the encrypted fragment data. The encryption fragment data is obtained by encoding the genetic data of the individual in the form of a hash value. The hash values of the individual are stored in a database, for example in the form of a hash value table. The database accordingly preferably comprises a plurality of hash value tables.
[0034] To enhance data security, the hash function preferably has at least one of the following properties: - The hash function is a cryptographic hash function (which is advantageously collision-resistant, so that it is virtually impossible to obtain the same hash value for two different inputs). The hash function generates a hash value having a length equal to at least 128 bits. -The hash function at least meets the SHA2 (Secure Hash Algorithm) standard. -The hash function is constructed to act as an avalanche effect, where even small changes to the input produce a completely different hash value.
[0035] According to a further embodiment of the invention, it may be advantageous to append a probabilistically selected string to each of the sequence fragments before applying the encoding function. Advantageously, the appending, e.g. combining a randomly selected string ("salt"), can increase the input entropy before further processing of the input. Alternatively or additionally, a hash function can be applied multiple times to the sequence fragments and / or the encrypted fragment data. Advantageously, this makes it more difficult to guess the input from the hash value by brute force techniques.
[0036] According to another advantageous variant of the invention, the encrypted fragment data is stored in a database. The database is a storage device in which fragment data relating to a number of individuals obtained from one or more facilities where genetic data are obtained, preferably encrypted according to the invention, for example from a clinical facility and / or a research laboratory, is stored. The database is configured for user access. For example, it can allow free access via a network or access to user data limited to specific users.
[0037] A computer program product stored on a computer-readable storage medium and configured to form sequence fragments and generate a plurality of encrypted fragment data in a manner according to the first general aspect of the invention, a computer-readable storage medium having stored thereon a computer program product configured to form sequence fragments and generate a plurality of encrypted fragment data in a manner according to the first general aspect of the invention, and a database having a plurality of searchable encrypted fragment data generated in a manner according to the first general aspect of the invention are further independent subject matter of the present invention.
[0038] As a further independent subject of the present invention, there is provided a system comprising at least one facility, e.g. a clinical facility and / or a research laboratory, for generating anonymized genetic data and at least one facility, e.g. a university or industrial research facility, for using the data by at least one operator.
[0039] Further details and advantages of the invention will now be described with reference to the accompanying drawings, which are set forth below. [Brief description of the drawings]
[0040] [Figure 1] FIG. 1 is a schematic diagram of the processing of genetic data according to a preferred embodiment of the present invention. [Diagram 2] FIG. 11 shows further details of the encryption and storage of genetic data and database lookup according to a further embodiment of the present invention. [Diagram 3] FIG. 1 is a schematic diagram of a preferred use of the present invention for the processing of clinically derived genetic data and their retrieval by a user. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0041] Details of a preferred embodiment of the invention are described below, in particular those related to the formation of sequence fragments, their encoding and storage in a database, and querying the database. Details of the choice of encoding functions, in particular hash functions, are not described, as they are known per se from conventional encoding techniques in bioinformatics or other technical fields. By way of example, reference is made to the use of the invention in the processing of genetic data comprising nucleotide sequences. The use of the invention is not limited to these data, but is also possible for other genetic data, such as, for example, amino acid sequences (protein sequences).
[0042] Figure 1 shows diagrammatically the main steps of a method for processing genetic data according to a preferred embodiment of the invention, further details are given by way of example in Figure 2. Figure 2 also shows diagrammatically the components of a data processing apparatus 100 comprising a fragmentation device 10, an encoding device 20 and a storage device 30 / database 30A.
[0043] The method sequence according to FIG. 1 first shows in step S1 the creation of genetic data 1. The creation of the genetic data 1 comprises, for example, the sequencing of the genetic material of at least one individual. The sequencing is performed using sequencing techniques known per se. Alternatively, the creation of the genetic data 1 comprises retrieving the genetic data 1 from existing data sources, for example from freely accessible databases. The genetic data 1 typically comprises a part of the genome of the individual, but may also represent the entire genome. For example, the genetic data 1 of a particular individual relates to the genetic data of iPS cells (induced pluripotent stem cells) of that individual.
[0044] Step S1 is a creation step of the method according to the present invention. The creation of the gene data 1 in step S1 can be performed immediately before the subsequent processing of steps S2 to S4, or can be performed after a certain time period.
[0045] In step S2, sequence fragments 3 are then formed from the genetic data 1. FIG. 2 shows, by way of example, genetic data 1 consisting of sequence elements in the form of a nucleotide sequence. The nucleotide sequence consists of the nucleic acid bases adenine, thymine, guanine and cytosine, usually abbreviated as A, T, G and C. A k-mer (here, for example, k=3) is formed, such as sequence fragments 3. Starting from a start element 2 (for example, T), a stepwise read-out of sequence fragments 3 of length 3 is performed. The provision of sequence fragments 3 is performed by reading using a sliding window. As a result, a continuum 4 of sequence fragments 3 is formed. Step S2 can be implemented with a sliding window algorithm known per se.
[0046] Subsequently, in step S3, the encoding of the sequence fragment 3 is performed using the encoding device 20. The encoding device 20 applies a hash function f HThe application of the hash function results in a hash value table, the elements of which are encrypted fragment data 5 representing sequence fragments 3. This hash value table therefore contains the genome sequence of an individual in a form in which the identity of the individual cannot be inferred, or in a form equivalent thereto.
[0047] In addition to the representation in Figure 2, the hash function f H The single application of hash function f is first applied to sequence fragment 3 and then at least once to encrypted fragment data 5. H can be replaced by repeated (at least two-fold) application of
[0048] The encoding of the sequence fragments 3 provides encrypted fragment data 5 in a hash value table. Then, in step S4, the encrypted fragment data 5 (encoded sequence fragments) are stored in a storage device 30, for example a database 30A. The database 30A may be part of the data processing device 100 or may be provided separately therefrom. The encrypted fragment data 5 of the hash value tables, i.e. of the individuals, are stored in respective predefined storage sections and / or together with a sequence identification (sample ID) representing the assignment to a particular hash value table, such that the association of the encrypted fragment data 5 with the anonymous sample obtained from the individual is maintained.
[0049] For the query of the database 30A, a search sequence 6 of a nucleic acid, e.g. an ATG, is first created (step S5) and encrypted by applying a hash function (step S6), as shown in the right part of FIG. 2. This creates an encrypted search sequence 7 in the form of a hash value. The occurrence of this hash value is then searched in the database (step S7) using a search technique known per se. When the encrypted search sequence 7 is found, the hash value table to which the found search sequence belongs is obtained. Due to the data structure of the database 30A with multiple hash value tables, the execution time required for this search is constant and therefore efficient.
[0050] Further details of a preferred use of the invention are shown in Fig. 3. In this use, a system 200 is provided for generating anonymized genetic data by clinical facilities and / or laboratories and for use by an operator, e.g. a university or an industrial research facility. On the left side of Fig. 3 it is shown diagrammatically how genetic data 1 are generated, e.g. in a clinical facility 40 (step S1). In a practical example, the system 200 may include several operators and several users commonly accessing a database or several databases. The genetic data 1 are then subjected to the method of steps S2 and S3 according to the invention in order to generate encoded sequence fragments 5, which are stored in a database 30A (step S4).
[0051] A research facility 50 is interested in evaluating the genetic data 1. For example, in searching for a particular disease, the question arises whether the created search sequence 6 (step S5) is contained in the genetic data 1 (see double arrow above). However, this direct query becomes difficult or even impossible due to the excessive effort for searching the genetic data 1 and the protection of the data. Nevertheless, in order to be able to search the genetic data 1, the search sequence 6 is subjected to encoding to generate a hash value (step S6), as described above, after which a search can be performed in the database 30A (step S7). If, as a result of the search, the stored encrypted fragment data 5 contains the searched encrypted search sequence 7, the relevant genetic data 1, i.e. a data set of a particular individual, is identified. A query relating to this special data set can then be made by the research facility 50 to the clinical facility 40, while complying with the rules of data security, in order to obtain further information on the individual with the relevant search sequence and / or on the cellular material of the individual with the relevant search sequence, for example from a cell bank.
[0052] It should be noted that the given example represents only one possible use of the invention, which allows to process specific questions from the field of personalized medicine without exact knowledge of the genetic data. Only the necessary format of the search sequence and / or the search question is defined in order to achieve a match of hash values of the same data points in the database, depending on the available data and / or data format.
[0053] A further example for the use of the present invention is when a research facility wants to investigate a particular disease and for this purpose requires cellular material with specific genetic characteristics from a cell bank. If the genetic data of the material stored in the cell bank is processed according to the present invention, by applying the present invention it is possible to find suitable cell lines from the cell bank without having access to the genetic data. The research facility obtains information about which cell lines are required to carry out the planned study without having to sequence the cellular material itself, greatly reducing the cost and time consumption.
[0054] The features of the invention disclosed in the above description, in the drawings and in the claims may be relevant either alone or in any combination or subcombination for realizing the invention in its various embodiments.
Claims
1. A method for processing genetic data (1) comprising a set of sequence elements each representing a biomolecule, the method comprising: forming sequence fragments (3), each sequence fragment (3) comprising a section of said set of sequence elements having a fragment length of at least two sequence elements; applying (S3) an encoding function to each of said sequence fragments (3) to generate a plurality of encrypted fragment data (5), each associated with one of said sequence fragments (3); a step (S4) of storing the encrypted fragment data (5); Including, The step of forming sequence fragments (3) is performed such that sections of the set of sequence elements overlap and each sequence element is included in at least two sequence fragments (3); the encoding function is non-reversible and collision resistant, such that input of two different sequence fragments results in different encrypted fragment data; method.
2. The fragment length of the sequence fragment (3) is at least 3. The method of claim 1.
3. The step of forming the sequence fragment (3) comprises: Specifying the fragment length and start element (2) in the genetic data (1); providing said sequence fragments (3) by sections of said series of sequence elements starting from said starting element (2) and all subsequent sequence elements and having said fragment length; Including, The method according to claim 1 or 2.
4. All of the sequence fragments (3) have the same length. The method according to any one of claims 1 to 3.
5. The sequence fragment (3) forms a group of a plurality of fragments of the sequence fragment (3), The sequence fragments (3) in each fragment group each have the same length, The sequence fragments (3) in different fragment groups have different lengths, The step of forming the sequence fragments (3) is performed such that in each fragment group, sections of the set of sequence elements overlap and each sequence element is included in at least two sequence fragments (3). The method according to any one of claims 1 to 3.
6. The encoding function is a hash function (f H ), and the encrypted fragment data (5) includes a hash value. The method according to any one of claims 1 to 5.
7. The step of forming the sequence fragment (3) includes, before applying the encoding function, adding probabilistically selected character strings to each of said sequence fragments, respectively; The method according to any one of claims 1 to 6.
8. Genetic data (1) from a plurality of individuals is processed, the genetic data (1) for each individual comprising a set of sequence elements each representing a biomolecule; The encrypted fragment data (5) is stored in a database (30A); the characterization that the set of sequence elements, when given, comprises a section of genetic material; and The genetic data (1) represents a nucleotide sequence or an amino acid sequence; having at least one of: The method according to any one of claims 1 to 7.
9. A data processing device (100) configured to generate and store encrypted fragment data (5) using the method according to any one of claims 1 to 8, comprising: a fragmentation device (10) configured to form the sequence fragments (3) such that sections of the series of sequence elements overlap and each sequence element is included in at least two sequence fragments (3); an encoding device (20) configured to generate the plurality of encrypted fragment data (5); a storage device (30) configured to store the encrypted fragment data (5); Equipped with A data processing device (100).
10. stored on a computer readable storage medium, A method for generating the sequence fragments (3) and the plurality of encrypted fragment data (5) according to any one of claims 1 to 8, Computer program products.
11. A computer program product configured to generate the sequence fragments (3) and the plurality of encrypted fragment data (5) according to the method of any one of claims 1 to 8 is stored. A computer-readable storage medium.
12. A method for querying a database (30A) containing encrypted fragment data (5) generated and stored by the method according to any one of claims 1 to 8, comprising the steps of: providing a query sequence (6) including a predetermined set of sequence elements each representing a biomolecule; applying the encoding function used to generate the encrypted fragment data (5) to the search sequence to generate an encrypted search sequence (7); searching for said encrypted search sequence in said stored encrypted fragment data (5); Including, method.
13. said specifying said search sequence (6) includes shortening an initial search sequence to a search sequence length equal to the fragment length of said sequence fragment (3) from which said encrypted fragment data (5) was generated; The method of claim 12.
Citation Information
Patent Citations
Nucleic acid sequence assembly process and system
JP2017526046A
Uniquemer Algorithm for Identification of Conserved and Unique Subsequences
US20110125411A1
Device, system and method for securing and comparing genomic data
US20140289536A1
Efficient payload extraction from polynucleotide sequence reads
US20190377851A1
Method and apparatus for controlling access to encrypted data files in a computer system
WO1997024675A1
