CN112967759B - DNA material evidence identification STR typing comparison method based on memory stack technology - Google Patents
DNA material evidence identification STR typing comparison method based on memory stack technology Download PDFInfo
- Publication number
- CN112967759B CN112967759B CN202110489766.0A CN202110489766A CN112967759B CN 112967759 B CN112967759 B CN 112967759B CN 202110489766 A CN202110489766 A CN 202110489766A CN 112967759 B CN112967759 B CN 112967759B
- Authority
- CN
- China
- Prior art keywords
- data
- comparison
- memory stack
- str
- dna
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 46
- 238000005516 engineering process Methods 0.000 title claims abstract description 30
- 239000000463 material Substances 0.000 title claims abstract description 18
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 34
- 238000004458 analytical method Methods 0.000 claims abstract description 10
- 108700028369 Alleles Proteins 0.000 claims description 6
- 238000001514 detection method Methods 0.000 claims description 6
- 230000002776 aggregation Effects 0.000 claims description 5
- 238000004220 aggregation Methods 0.000 claims description 5
- 230000002068 genetic effect Effects 0.000 claims description 5
- 238000006243 chemical reaction Methods 0.000 claims description 4
- 238000005259 measurement Methods 0.000 claims description 3
- 230000009191 jumping Effects 0.000 claims description 2
- 238000012545 processing Methods 0.000 description 10
- 230000008569 process Effects 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 3
- 238000011840 criminal investigation Methods 0.000 description 3
- 238000013500 data storage Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000013523 data management Methods 0.000 description 2
- 238000011835 investigation Methods 0.000 description 2
- 230000001788 irregular Effects 0.000 description 2
- 239000000203 mixture Substances 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 102220493065 Protein Flattop_D16S_mutation Human genes 0.000 description 1
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000003205 genotyping method Methods 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000007781 pre-processing Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16B—BIOINFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR GENETIC OR PROTEIN-RELATED DATA PROCESSING IN COMPUTATIONAL MOLECULAR BIOLOGY
- G16B40/00—ICT specially adapted for biostatistics; ICT specially adapted for bioinformatics-related machine learning or data mining, e.g. knowledge discovery or pattern finding
Abstract
The invention relates to a DNA material evidence identification STR parting comparison method based on a memory stack technology, which comprises the following steps: acquiring DNA source data which are requested by a user to be compared; converting the DNA source data into memory stack data; establishing a comparison algorithm model library; analyzing the memory stack data; selecting a comparison algorithm model from the comparison algorithm model library according to the analysis result; and performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result. The invention can improve the parting comparison speed of DNA.
Description
Technical Field
The invention relates to the field of DNA comparison, in particular to a DNA material evidence identification STR typing comparison method based on a memory stack technology.
Background
With the deep application of DNA in criminal investigation, the following difficult problems arise:
1. in the existing traditional database, the matching speed of DNA typing tolerance is low. (note: tolerance, i.e., differential alignment, the settings may have several loci data that are completely different or several loci data that are partially different).
2. There is tolerance alignment in the case of non-supported DNA hybrid typing. The mixed typing detected by the on-site trace detection materials cannot be compared, and the requirement of detecting and solving a case by using DNA mixed typing guidance cannot be met.
3. The search engine database is difficult to combine with source data, has large data conversion quantity, is complex to operate, is difficult to maintain and needs more equipment.
Such as: the on-site detecting material is a trace detecting material, the mixed typing of a plurality of DNA (more than 2 people are included simultaneously), and the existing database comparison method can only split the mixed typing by experienced inspectors under the condition that the DNA typing data of one person is known. And (3) removing the known personnel, and combining the complete data of the other unknown personnel to input the complete data into a database for comparison. However, under the condition of no known personnel, the number of the combined personnel is huge by using an exhaustive resolution method (violent resolution), for example, a DNA mixed type comprising 24 loci of two to three persons can be split and combined into tens of millions of single person data, and the existing number of people in a database is 100000000 by assuming that the DNA mixed type is split into 10000000 person data, and the comparison formula is:
10000000×100000000= 1000000000000000 (man times) =1×10 15 (times of people)
The conventional databases such as ORACLE, SQL, HADOOP and the like and the search engine type databases cannot be compared.
In addition, along with the continuous perfection of the DNA analysis technology, the technical means are continuously abundant, the application range is also continuously expanded, and from the individual identification and identification of the biological evidence to the genotyping of the species, the sex and the ABO blood group, even at present, partial appearance characteristics of people such as the color of hair, the shape of the lower jaw and the like can be primarily described through DNA inspection, so that scientific material evidence can be provided for each link of case investigation and litigation. The scientificity and practicability of DNA identification are also well accepted and highly valued by the judicial departments and the society, thereby playing a role in the investigation of various cases and events. However, with the increasing number scale of the conventional DNA database, the tolerance alignment requirements for the alignment speed and the mixed typing data are higher and higher, and the conventional DNA database cannot meet the increasing requirements.
Disclosure of Invention
The invention aims to provide a DNA material evidence identification STR parting comparison method based on a memory stack technology, which improves DNA parting comparison speed.
In order to achieve the above object, the present invention provides the following solutions:
a DNA evidence identification STR typing comparison method based on memory stack technology, comprising:
acquiring DNA source data which are requested by a user to be compared;
converting the DNA source data into memory stack data;
establishing a comparison algorithm model library;
analyzing the memory stack data;
selecting a comparison algorithm model from the comparison algorithm model library according to the analysis result;
and performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result.
Optionally, after the step of "obtaining the DNA source data that the user requests to be aligned", before the step of "converting the DNA source data into the memory stack data", the method further includes:
acquiring the database storage type, the data volume and the comparison requirement of the DNA source data;
and performing performance detection on the CPU and the memory of the database server according to the storage type, the data volume and the comparison requirement of the database.
Optionally, after the step of converting the DNA source data into the memory stack data, before the step of establishing the comparison algorithm model library, the method further includes:
grouping and classifying the memory stack data roots according to all alleles of each locus to obtain index information;
writing the memory stack data into a memory stack by each locus according to the index information to obtain a data file;
judging whether the data file is correct or not according to the index information;
if not, the step of jumping back is to group and classify the memory stack data according to all alleles of each locus to obtain index information;
if yes, generating index files corresponding to the data files one by one according to the index information;
and storing the data file and the corresponding index file.
Optionally, after the step of converting the DNA source data into the memory stack data, before the step of establishing the comparison algorithm model library, the method further includes:
establishing a memory stack;
and writing the memory stack data into the memory stack according to the index ordering of the memory stack data.
Optionally, the comparison algorithm model library specifically includes: the method comprises a Y-STR normal parting comparison model, a Y-STR mixed parting comparison model, an STR normal parting comparison model, an STR mixed parting comparison model and a genetic relationship measurement comparison model.
Optionally, parsing the memory stack data specifically includes:
acquiring the memory stack data;
and combining all the memory stack data combination results of the parting of each site.
Optionally, selecting a comparison algorithm model from the comparison algorithm model library according to the comparison tolerance and the minimum matching number.
Optionally, after the step of performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result, the method further includes:
acquiring the data type of the DNA source data which are requested to be compared by the user;
judging whether the data type of the DNA source data which is requested to be compared by the user is the same as the data type of the STR parting comparison result;
and checking the STR parting comparison result according to the judgment result.
Optionally, after the step of performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result, the method further includes:
building a memory stack;
and classifying the memory stack data according to the difference of the comparison algorithm models and storing the memory stack data in the memory stack.
Optionally, after the step of performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result, the method further includes:
and displaying the STR typing comparison result.
According to the specific embodiment provided by the invention, the invention discloses the following technical effects:
the invention uses a DNA material evidence identification STR parting high-speed comparison processing technology based on a Memory Stack (Memory Stack) technology, and can greatly improve the speed of comparison operation.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions of the prior art, the drawings that are needed in the embodiments will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a general flow chart of a DNA evidence identification STR parting comparison method based on a memory stack technology;
FIG. 2 is a flow chart of the sorting of source data into memory stack data according to an embodiment of the present invention;
FIG. 3 is a flow chart of a memory heap establishment in accordance with an embodiment of the present invention;
FIG. 4 is a flowchart of a method for creating a memory stack according to an embodiment of the present invention;
FIG. 5 is a flowchart showing the result return according to the embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be noted that the terms "first," "second," and the like in the description and the claims of the present invention and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The invention aims to provide a DNA material evidence identification STR parting comparison method based on a memory stack technology, which improves the parting comparison speed of DNA.
In order that the above-recited objects, features and advantages of the present invention will become more readily apparent, a more particular description of the invention will be rendered by reference to the appended drawings and appended detailed description.
FIG. 1 is a flowchart of a method for comparing STR typing by DNA evidence identification based on memory stack technology, and as shown in FIG. 1, the method specifically comprises the following steps:
the first step: source data input:
the method specifically comprises the following steps:
1.1 interfacing with various types of databases through a system interface. The various interface modes are as follows: query rights, data export, text conversion, library backup file conversion. The third party software can be connected with the data analysis part of the source library system by using a plurality of programming languages.
And 1.2, performing performance detection on a CPU, a memory and the like of the source library server according to the source library data storage type, the data volume and the new application requirement. If the performance of the source library server meets the comparison requirement of the invention, a comparison service module is deployed on the source library server. Otherwise, a calculation server meeting the comparison requirement of the source data needs to be configured. The method for judging whether the performance of the source library server meets the comparison requirement of the invention is mainly based on the quantity of source data.
1.3 detecting interface safety, isolating sensitive data of source database, backup source data and tidied data.
And a second step of: the source data is consolidated into (Memory Stack) data:
as shown in fig. 2, the following are specifically included:
2.1, analyzing and converting the source data types through the query statistics of the sql statement of the existing database. The method comprises the steps of referring to a DNA material evidence identification STR typing high-speed comparison processing technology based on a Memory Stack (Memory Stack) technology, namely, preferred parameters provided by a data type application model, performing checking analysis on source library data storage types including hash types, list, string, set and the like, and processing data types with unreasonable influence speed and precision according to a time response map, such as: locus D3S1358 values were string type 15/17, converting to int type 15, 17.
2.2 data aggregation and finishing. After 2.1 data types are analyzed and converted, irregular source data types and storage modes in a source database are subjected to multiple aggregation grouping treatment, and then a large number of irregular source data types which are unfavorable for comparison are grouped and classified according to all alleles of each locus to form a classification index information table of the allele characteristics of each locus of the source database. Wherein, the aggregation grouping is to aggregate a large amount of data, such as: 1000 learning scores are grouped according to 0-60, 60-80 and 80-100, and calculated in three steps;
the specific steps are as D3S1358 field, and the source data is as follows:
| D3S1358 |
| 17/18 |
| 15/17 |
| 15/16 |
| 16/17 |
| 17 |
| 16/17 |
| 15 |
| 15/16 |
| 17 |
| 16/17 |
| 16/17 |
| 15/16 |
| 15 |
| 15 |
| 15/16 |
| 15/17 |
| 16/17 |
| 15 |
| 15/17 |
| 15/17 |
the results after grouping were as follows:
2.3 generating (Memory Stack) data file. According to the allele feature index information formed in 2.2, carrying out genome-division and piece-by-piece writing (Memory Stack) data files on the data in the source library according to a feature index rule, such as naming a data entity file of preprocessing of DNA STR mixed parting comparison: dna_str_h.msd.
2.4 checking the hard disk storage file. Various files are written in a Memory Stack format, and in order to ensure the integrity and accuracy of data and verify whether the written files deviate, the source data, the msd data files and the verification are required. The specific steps are to check the msd data file according to the characteristic index information of 2.2 strokes, if the characteristic index information and the written file numerical value deviate, the written msd data file is wrong, and then 2.2 is returned to carry out data aggregation and arrangement again. The index file records which data should be written in which position, and reads the hard disk file according to the index file information to verify whether the writing of the hard disk file has deviation.
2.5, reading in the msd data file with correct verification, converting the msd data file written in the Memory Stack format into a Memory address code before reading in the Memory, and reading in the Memory in a Memory address code mode.
2.6 generating a point-to-point (Memory Stack) address index file according to the corresponding relation between the characteristic index and the generated msd data file, and reading the point-to-point (Memory Stack) address index file into the Memory.
And a third step of: establishing a comparison algorithm model database
The method specifically comprises the following steps:
and 3.1, establishing a comparison algorithm model database. Meets the requirements of forensic science and criminal investigation DNA material evidence identification parting comparison algorithms, and the specific algorithm comprises the following steps: the method comprises the steps of Y-STR normal parting comparison, Y-STR mixed parting comparison, STR normal parting comparison, STR mixed parting comparison, DNA mixed parting evidence intensity big data test comparison and genetic relationship measurement comparison and the like;
such as: and (5) STR mixed typing comparison. D3S1358 hybrid typing is: 15/16/17, vwa mix typing: 14/17/18, D16S539 mixture typing: 9/10/11/12, the split data are combined in the following table:
all crossing full sequence combinations for STR 16-24 loci the combined results after splitting the data as set forth in the table above are: 6 x 10 = 360 possible.
P is all combined results, a n ,b n ,c n .. for mixed typing, the comparison process of the memory DNA data and STR mixed typing is realized according to the data combination result.
Fourth step: establishing a memory heap
As shown in fig. 3, the following are specifically included:
4.1 applying programming language to build WebService interface. Firstly, a memory heap is established, the size of an application area of the memory is detected, and all irrelevant data in the application area are emptied.
4.2, reading the DNA data address codes of the memory, and writing the DNA data address codes into the memory according to the index order. Data is pushed into the memory heap.
And 4.3, dividing a memory operation sharing area.
4.4, automatically timing detection data is complete, and the system is prevented from automatically releasing heap data which is being applied by the memory.
And 4.5, memory overflow control and alarm are performed, calculation errors are prevented, data are leaked, and a detection result log is recorded.
4.6 detecting the requester rights through the interface service.
4.7 performing parameter analysis on the user request comparison data (namely source data) (the user can select comparison models such as STR mixed typing comparison according to the user comparison data), the user inputs each locus information (such as D3S1358:15/16/17 and D16S 539:9/10/11), and the system performs analysis formatting on the locus information and the comparison conditions according to the locus information input by the user and the comparison models selected for comparison in the next step so as to select the comparison models for comparison in the next step.
That is to say, in the third step, a plurality of comparison models are selected, after the data are analyzed, a comparison model which is most suitable for the data can be obtained, and then the model is utilized to carry out the subsequent comparison process.
Fifth step: model building comparison algorithm
The method specifically comprises the following steps:
and 5.1, generating an optimal comparison algorithm model according to a parameter analysis result of the request comparison data, wherein the optimal comparison algorithm model comprises the following steps: inputting mixed parting data, combining all the combination possibilities of parting data of each site, setting comparison parameters (corresponding to a threshold value) such as comparison tolerance, minimum matching number and the like, and according to the input data type (a n b n c n Etc.) a typing alignment mode is selected. Such as: the method comprises the steps of embedding a comparison algorithm model into a WebService interface, wherein the comparison algorithm model comprises a Y-STR normal parting comparison model, a Y-STR mixed parting comparison model, an STR normal parting comparison model, an STR mixed parting comparison model, a genetic relationship determination model and the like.
Sixth step: building a memory stack
As shown in fig. 4, the following are specifically included:
6.1 build a memory stack. And calling a fourth step of WebService interface according to the analysis result of the data parameters of the comparison request, selecting a comparison algorithm model, and matching the DNA data written into the memory.
And 6.2, matching the data, performing matching operation, and writing the result meeting the matching condition into a memory matching result address block.
The following results are met: STR hybrid parting zero tolerance alignment: request data: D3S1358:15/16/17, D16S539:9/10/11, the satisfactory data is that D3S1358 satisfies the 15/16/17 combination possibility, while D16S539 satisfies the 9/10/11 combination possibility.
Another example is: STR normal typing is compared with the same value, and data is requested: D3S1358:15/16, D16S539:9/10, the compliance data is that D3S1358 is equal to 15/16, while D16S539 is equal to 9/10.
And 6.3, summarizing address block data of the memory matching result, and carrying out statistical analysis according to different comparison algorithm models so as to return a DNA data result meeting the conditions.
Seventh section: returning the result
As shown in fig. 5, the following are specifically included:
7.1 data return. And summarizing whether the comparison result accords with the request parameters, and checking the final result to ensure that the comparison result accords with comparison data of the user request.
The checking process comprises the following steps: and (3) performing secondary calculation on the summarized comparison results according to the user input request comparison data, and ensuring that the summarized results in the steps are accurate in percentage. If STR normal typing is performed on the same-value comparison request data, D3S1358:15/16, D16S539:9/10, carrying out secondary verification on the summarized results with smaller quantity before data return. I.e. the return data D3S1358 is equal to 15/16 and D16S539 is equal to 9/10.
And 7.2, performing visualization processing on the memory matching result according to requirements (converting computer codes and data types returned by the computer into application data, proportion and the like visualized by a user).
And 7.3, formulating a data result return strategy, and inquiring and responding. Such as: and sending the optimal return strategy to the requester when the data volume is too large, and implementing the optimal data return scheme according to the response of the requester.
7.4 intelligent feedback. According to the request record, the return data record, the task completion time, the log and the success rate, the operation parameters of each operation model are automatically updated, and the operation performance is improved.
And 7.5 updating timely. And synchronizing the external processing data according to the increment, the deletion and the modification of the source database or periodically.
7.6, establishing a maintenance log. And (5) comprehensively recording the matters such as operation input, result return, alarm, efficiency and the like.
The invention discloses the following technical effects:
the invention discloses a DNA material evidence identification STR parting high-speed comparison technology based on a Memory Stack (Memory Stack) technology on the premise of not influencing the application of an original DNA system built in each place, not adding a large amount of equipment and not changing a large data storage and management mode. Aiming at the characteristics of complex DNA comparison requirement, large comparison quantity, strong randomness, irregularity, messy data types and multiple fields, the novel DNA professional data processing technology is mainly used for forensic science and criminal investigation DNA typing complex operation and can also be applied in expansion and DNA genetic science research.
Compared with the currently popular distributed structure databases ORACLE, SQL, postgre, the non-relational databases HADOOP, redis, memcached and search engine databases, the invention has the following advantages:
1. the operation speed is high. DNA material evidence identification STR parting high-speed comparison processing technology based on Memory Stack (Memory Stack) technology is adopted, and the operation speed is greatly improved by adopting a full Memory data processing technology. Such as: the currently international popular postgre distributed open source database uses five servers to perform multi-person mixed typing on 24 loci STR, and 100000000 pieces of data matching match matching operation is completed in 25 seconds. The STR typing high-speed comparison processing technology is identified by using a DNA material evidence based on a Memory Stack (Memory Stack) technology, and can be completed in 6 seconds by using only one server with the same grade.
2. The adaptability is good. Can be compatible with various operating systems and programming languages. The method has no change to the data management and application mode of the application system which is being used by each original application unit. The high speed comparison effect can be achieved. Such as: the task of the national level database which is currently being applied is completed in tens of minutes, and the invention can be completed in a few seconds.
3. The cost is low. Without the need for adding large or high-grade equipment. Such as: for national grade 25 hundred million DNA STR typing data, 24 loci multi-person mixed typing full tolerance comparison, about two to three middle-grade servers can be completed in seconds. And a middle-grade server is used for carrying out mixed typing full tolerance comparison on hundreds of millions of DNA STR typing data and 24 loci of multiple people, and the method can be completed in second level.
4. The application range is wide. Is suitable for national, provincial and municipal crime striking databases, and is suitable for large, medium and small genetics research institutions.
5. The data security is good. The technology belongs to an external processing technology, does not modify source library data, does not relate to source library sensitive data, and does not relate to data security for any unit application.
6. The operation is stable and easy to manage.
In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other.
The principles and embodiments of the present invention have been described herein with reference to specific examples, the description of which is intended only to assist in understanding the methods of the present invention and the core ideas thereof; also, it is within the scope of the present invention to be modified by those of ordinary skill in the art in light of the present teachings. In view of the foregoing, this description should not be construed as limiting the invention.
Claims (6)
1. The DNA material evidence identification STR parting comparison method based on the memory stack technology is characterized by comprising the following steps of:
step 1: acquiring DNA source data which are requested by a user to be compared;
step 2: converting the DNA source data into memory stack data specifically comprises:
analyzing and converting the DNA source data types through the query statistics of the sql statement of the existing database;
carrying out aggregation arrangement on the data after analysis and conversion;
generating a memory stack data file;
step 3: establishing a comparison algorithm model library;
step 4: analyzing the memory stack data specifically includes:
acquiring the memory stack data;
combining all the memory stack data combination results of the parting of each site;
step 5: selecting a comparison algorithm model from the comparison algorithm model library according to the comparison tolerance and the minimum matching number displayed by the analysis result;
step 6: performing STR typing comparison on the memory stack data by using the comparison algorithm model to obtain an STR typing comparison result;
after the step 2, before the step 3, the method further comprises:
establishing a memory stack;
writing the memory stack data into the memory stack according to the index ordering of the memory stack data;
after the step 6, the method further comprises:
building a memory stack;
and classifying the memory stack data according to the difference of the comparison algorithm models and storing the memory stack data in the memory stack.
2. The memory stack technology-based DNA evidence identification STR typing alignment method according to claim 1, further comprising, after the step 1, before the step 2:
acquiring the database storage type, the data volume and the comparison requirement of the DNA source data;
and performing performance detection on the CPU and the memory of the database server according to the storage type, the data volume and the comparison requirement of the database.
3. The memory stack technology-based DNA evidence identification STR typing alignment method according to claim 1, further comprising, after the step 2, before the step 3:
step 2a: grouping and classifying the memory stack data according to all alleles of each locus to obtain index information;
step 2b: writing the memory stack data into a memory stack by each locus according to the index information to obtain a data file;
step 2c: judging whether the data file is correct or not according to the index information;
if not, jumping back to the step 2a;
if yes, generating index files corresponding to the data files one by one according to the index information;
step 2d: and storing the data file and the corresponding index file.
4. The DNA material evidence identification STR typing comparison method based on the memory stack technology according to claim 1, wherein the comparison algorithm model library specifically includes: the method comprises a Y-STR normal parting comparison model, a Y-STR mixed parting comparison model, an STR normal parting comparison model, an STR mixed parting comparison model and a genetic relationship measurement comparison model.
5. The memory stack technology-based DNA evidence identification STR typing alignment method according to claim 1, further comprising, after the step 6:
acquiring the data type of the DNA source data which are requested to be compared by the user;
judging whether the data type of the DNA source data which is requested to be compared by the user is the same as the data type of the STR parting comparison result;
and checking the STR parting comparison result according to the judgment result.
6. The memory stack technology-based DNA evidence identification STR typing alignment method according to claim 1, further comprising, after the step 6:
and displaying the STR typing comparison result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110489766.0A CN112967759B (en) | 2021-05-06 | 2021-05-06 | DNA material evidence identification STR typing comparison method based on memory stack technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110489766.0A CN112967759B (en) | 2021-05-06 | 2021-05-06 | DNA material evidence identification STR typing comparison method based on memory stack technology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112967759A CN112967759A (en) | 2021-06-15 |
| CN112967759B true CN112967759B (en) | 2023-11-14 |
Family
ID=76279808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110489766.0A Active CN112967759B (en) | 2021-05-06 | 2021-05-06 | DNA material evidence identification STR typing comparison method based on memory stack technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112967759B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115878405A (en) * | 2023-03-08 | 2023-03-31 | 杭州拓数派科技发展有限公司 | PostgreSQL database memory detection method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012177817A2 (en) * | 2011-06-22 | 2012-12-27 | Vor Data Systems, Inc. | Systems and methods for identifying a contributor's str genotype based on a dna sample having multiple contributors |
| CN110706746A (en) * | 2019-11-27 | 2020-01-17 | 北京博安智联科技有限公司 | DNA mixed typing database comparison algorithm |
| CN111723261A (en) * | 2019-03-22 | 2020-09-29 | 昆明逆火科技股份有限公司 | Search engine-based DNA comparison algorithm |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210011717A1 (en) * | 2019-05-20 | 2021-01-14 | Microsoft Technology Licensing, Llc | Verified Stack Trace Generation And Accelerated Stack-Based Analysis With Shadow Stacks |
-
2021
- 2021-05-06 CN CN202110489766.0A patent/CN112967759B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012177817A2 (en) * | 2011-06-22 | 2012-12-27 | Vor Data Systems, Inc. | Systems and methods for identifying a contributor's str genotype based on a dna sample having multiple contributors |
| CN111723261A (en) * | 2019-03-22 | 2020-09-29 | 昆明逆火科技股份有限公司 | Search engine-based DNA comparison algorithm |
| CN110706746A (en) * | 2019-11-27 | 2020-01-17 | 北京博安智联科技有限公司 | DNA mixed typing database comparison algorithm |
Non-Patent Citations (2)
| Title |
|---|
| 基于基本块指纹的二进制代码同源性分析;颜颖;方勇;刘亮;刘露平;贾鹏;;网络安全技术与应用(第03期);全文 * |
| 无比对样本的STR混合分型分析策略;王禹;毛坤云;陈嘉佳;郝兴龙;贾润;;中国法医学杂志(第06期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112967759A (en) | 2021-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112801530A (en) | Intelligent review system based on semantic splitting and working method | |
| CN113486158B (en) | Case situation comparison-based case retrieval method, device, equipment and storage medium | |
| CN112000773A (en) | Data association relation mining method based on search engine technology and application | |
| CN115409395B (en) | Quality acceptance inspection method and system for hydraulic construction engineering | |
| CN115794803B (en) | Engineering audit problem monitoring method and system based on big data AI technology | |
| CN116384889A (en) | Intelligent analysis method for information big data based on natural language processing technology | |
| CN112967759B (en) | DNA material evidence identification STR typing comparison method based on memory stack technology | |
| CN116049359A (en) | Duplicate checking algorithm based on document content analysis | |
| CN111090878A (en) | Password-fixed management system based on password points | |
| CN115794798B (en) | Market supervision informatization standard management and dynamic maintenance system and method | |
| CN114880690B (en) | Edge calculation-based source data time sequence refinement method | |
| CN111026718A (en) | Technical method for analyzing excel file of rail transit engineering cost achievement | |
| CN109710730B (en) | Patrol information system and analysis method based on natural language analysis processing | |
| KR101985961B1 (en) | Similarity Quantification System of National Research and Development Program and Searching Cooperative Program using same | |
| CN112506930B (en) | Data insight system based on machine learning technology | |
| CN113157814B (en) | Query-driven intelligent workload analysis method under relational database | |
| CN114185875A (en) | Big data unified analysis and processing system based on cloud computing | |
| CN113743453A (en) | Population quantity prediction method based on random forest | |
| CN112988972A (en) | Administrative penalty file evaluation and checking method and system based on data model | |
| CN116501788B (en) | Storehouse lake integrated data management and control platform | |
| CN114492308B (en) | Industry information indexing method and system combining knowledge discovery and text mining | |
| CN114880588B (en) | News heat prediction method based on knowledge graph | |
| CN116305212A (en) | Hadoop-based data fingerprint extraction method | |
| CN117035473A (en) | Medium plate product defect knowledge base platform and construction method thereof | |
| CN112712177A (en) | Knowledge engineering method and device based on cooperative processing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |