CN111223545A - Method for keeping trace of electronic medical record - Google Patents
Method for keeping trace of electronic medical record Download PDFInfo
- Publication number
- CN111223545A CN111223545A CN202010015951.1A CN202010015951A CN111223545A CN 111223545 A CN111223545 A CN 111223545A CN 202010015951 A CN202010015951 A CN 202010015951A CN 111223545 A CN111223545 A CN 111223545A
- Authority
- CN
- China
- Prior art keywords
- character
- character string
- medical record
- text content
- trace
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H15/00—ICT specially adapted for medical reports, e.g. generation or transmission thereof
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/31—Indexing; Data structures therefor; Storage structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/34—Browsing; Visualisation therefor
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Software Systems (AREA)
- Health & Medical Sciences (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Medical Treatment And Welfare Office Work (AREA)
Abstract
The invention relates to the technical field of text editing, in particular to a method for keeping traces of an electronic medical record. The method comprises the following steps: adding a new medical record for doctor A, storing the content of each information node of the medical record in the custom attribute when the medical record is stored; after the superior doctor B modifies the medical record, the duration of the medical record is saved, the content of the modified information node is compared with the content of the information node stored in the custom attribute in a text mode, and the record of trace operation is saved; a, a doctor looks at a medical record, clicks a trace view, and takes out trace operation records from custom attributes in a document. According to the method for reserving the trace of the electronic medical record, the modification trace of the electronic medical record is saved, including newly adding content of the medical record, deleting original content, modifying information of an operator, modifying operation time point information, realizing clean display and printing, or modifying history record display and printing, and the trace can be directly displayed in a document.
Description
Technical Field
The invention relates to the technical field of text editing, in particular to a method for keeping traces of an electronic medical record.
Background
Trace preservation is an important function in electronic medical record text editing applications. The theoretical electronic medical record system has the trace reservation function in the electronic medical record application specification issued by the ministry of health. At present, most trace preservation is simple record, the same medical record is used for storing a plurality of contents, then the contents are compared in a whole text, the new version and the old version are displayed in left and right columns, and the content difference between the two files is marked. Although the method can meet the requirements of hospitals, the method is inconvenient to apply, and does not record newly-added content of medical records, delete original content, modify information of operators and modify information of operation time points.
Disclosure of Invention
The invention aims to provide a method for keeping traces of an electronic medical record, which solves the problems in the background technology.
In order to solve the above technical problems, an object of the present invention is to provide a method for retaining an electronic medical record trace, which includes the following steps:
s1, adding a new medical record by the doctor A, and storing the content of each information node of the medical record in the custom attribute when the medical record is stored;
s2, when the medical record is stored after the medical record is modified by the superior doctor B, the content of the modified information node is compared with the content of the information node stored in the custom attribute in a text mode, and the record of trace operation is stored;
s3, A doctors check the medical records, click the trace view, take out the trace operation records from the custom attributes in the document, display the trace operation records on the document, and display that a certain doctor adds or deletes at a certain moment when the mouse moves to the colored font (the red font is deleted, and the blue font is added).
Preferably, in S2, the text comparison method includes the following steps:
s2.1, acquiring the modified information node, the old text content of the information node and the new text content of the information node;
s2.2, judging whether the old text content is empty or not, if the old text content is empty and the new text content is not empty, marking all the new text content in the trace operation record as new;
s2.3, judging whether the new text content is empty, if the new text content is empty and the old text content is not empty, marking all the old text content in the trace operation record as deleted;
s2.4, obtaining a dynamic planning two-dimensional array of the minimum editing distance of the two character strings through the old text content and the new text content;
assuming the old text: cold and fever; new text: and (3) if the patient is cold and coughs, obtaining a two-dimensional array by dynamic programming of the minimum edit distance as follows:
| feeling of | Cap with heating means | Hair-like device | Baking | ||
| 0 | 1 | 2 | 3 | 4 | |
| Feeling of | 1 | 0 | 1 | 2 | 3 |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 |
| Hair- |
3 | 2 | 1 | 1 | 2 |
| Baking | 4 | 3 | 2 | 2 | 2 |
S2.5, setting different parts of the old text content and the new text content as spaces according to the dynamic programming two-dimensional array of the minimum editing distance to obtain an old text: cold; new text: cold;
s2.6, comparing the source character string (cold and fever) and the target character string (cold) of the old text content, and when the target character string is a space, using < span > </span > to cover the corresponding characters of the source character string to obtain the old text content modification characters: cold < span > fever </span >;
s2.7, old text content modification characters: the character which is indicated to be deleted, the text which is contained by < span > </span > is taken out from the old text content modification character, marked as deletion operation, and the modification time is stored as a trace operation record object in the custom node in the document together with the current modification doctor:
deleting "> < strike fever </strike > </font > at 2019-11-1119: 01: 53;
s2.8, comparing a source character string (cold cough) and a target character string (cold) of the new text content, and when the target character string is a space, using < span > </span > to include characters corresponding to the source character string to obtain a new text content modification character: cold < span > cough </span >;
s2.9, new text content modification characters: representing new characters, extracting the text contained in < span > </span > from the new text content modification characters, marking as new operation, and storing the new operation, the current doctor and the modification time as trace operation record objects in the custom nodes in the document:
the < font color ═ 0000ff ═ title ═ is newly added in 2019-11-1119: 01:53, > < add > cough [/font >.
Preferably, the equation formula of the dynamic programming is as follows:
wherein:
preferably, in S2.5, the step of calculating, according to the two-dimensional array of the dynamic programming of the minimum edit distance, that different portions of the old text content and the new text content are set as spaces includes the following steps:
s2.5.1, assuming that the dynamic programming two-dimensional array is distance, the number of rows i is distance.length-1, and the number of columns j is distance [0]. length-1; minDistance is the minimum edit distance [ i ] [ j ], s is an old text, and t is a new text;
s2.5.2, when i is greater than 0 and j is also greater than 0, judging;
s2.5.3, when i is greater than 0, the character of the s string at position i is replaced with null and i is reduced by one digit. Re-executing the judgment until i is less than or equal to 0, and finishing the judgment;
s2.5.4, when j is greater than 0, the character of the t string at the j position is replaced with null and j is reduced by one digit. Re-executing the judgment until j is less than or equal to 0, and finishing the judgment;
s2.5.5, and finally obtaining a comparison result.
Preferably, in S2.5.2, the method for determining when i is greater than 0 and j is also greater than 0 includes the steps of:
s2.5.2.1, judging whether the value of distance [ i ] [ j-1] +1 is equal to minDistance, if so, indicating that the character of the s character string at the i position is different from the character of the t character string at j, and the character of the s character string at the i position is the same as the character of the t character string at the j-1 position, replacing the character of the t character string at the j position with null, reassigning the minDistance as distance [ i ] [ j-1], and reducing j by one digit;
s2.5.2.2, if the above conditions are not equal, judging whether the value of distance [ i-1] [ j ] +1 is equal to minDistance, if so, the character of the s character string at the i position is different from the character of the t character string at j, the character of the s character string at the i-1 position is the same as the character of the t character string at the j position, replacing the character of the s character string at the i position with null, reassigning minDistance to distance [ i-1] [ j ], and reducing the number of digits of i;
s2.5.2.3, if the above conditions are not equal, judging whether distance [ i-1] [ j-1] +1 is equal to minDistance, if yes, indicating that the character of the s character string at the i position is different from the character of the t character string at j, replacing the character of the s character string at the i position with null, replacing the character of the t character string at the j position with null, and reassigning minDistance as distance [ i-1] [ j-1], wherein i and j are respectively reduced by one digit;
s2.5.2.4, if the above conditions are not satisfied, the character of the s character string at the i position is the same as the character of the t character string at j, and the i and the j are respectively reduced by one digit;
s2.5.2.5, repeating the above judgment until one of i or j is less than or equal to 0, and ending the above judgment.
Another object of the present invention is to provide an apparatus for electronic medical record trace retention, which includes a processor, a memory, and a computer program stored in the memory and running on the processor, wherein the processor implements the steps of the method for electronic medical record trace retention as described in any one of the above when executing the computer program.
A third object of the present invention is a computer-readable storage medium, in which at least one program is stored, and the at least one program is executed by the processor to implement the steps of the method for electronic medical record trace preservation as described in any one of the above.
Compared with the prior art, the invention has the beneficial effects that:
1. in the method for retaining the trace of the electronic medical record, the trace operation record is stored in the document custom attribute, and repeated front-end and back-end interaction is not required.
2. According to the method for keeping the trace of the electronic medical record, the trace can be directly displayed in a document and is convenient for a doctor to look up.
3. In the method for keeping the trace of the electronic medical record, trace operation recording is completely realized by some comparison algorithms (a minimum edit distance calculation algorithm, a text comparison algorithm and the like), and the problem of low efficiency is avoided.
4. According to the method for reserving the trace of the electronic medical record, the modification trace of the electronic medical record is saved, including newly adding content of the medical record, deleting original content, modifying information of an operator, modifying operation time point information, realizing clean display and printing, or modifying history record display and printing, and the trace can be directly displayed in a document.
Drawings
FIG. 1 is an overall process flow diagram of the present invention;
FIG. 2 is a flow chart of a method of text comparison of the present invention;
FIG. 3 is a flowchart of the calculation steps of the present invention for setting different parts of old text contents and new text contents as spaces according to the dynamically planned two-dimensional array of minimum edit distances;
FIG. 4 is a flow chart of a method of determining of the present invention;
fig. 5 is a diagram showing the structure of the device for trace-keeping of electronic medical records according to the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1-5, the present invention provides a technical solution:
the invention provides a method for reserving an electronic medical record trace, which comprises the following steps:
s1, adding a new medical record by the doctor A, and storing the content of each information node of the medical record in the custom attribute when the medical record is stored;
s2, when the medical record is stored after the medical record is modified by the superior doctor B, the content of the modified information node is compared with the content of the information node stored in the custom attribute in a text mode, and the record of trace operation is stored;
s3, A doctors check the medical records, click the trace view, take out the trace operation records from the custom attributes in the document, display the trace operation records on the document, and display that a certain doctor adds or deletes at a certain moment when the mouse moves to the colored font (the red font is deleted, and the blue font is added).
In this embodiment, in S2, the text comparison method includes the following steps:
s2.1, acquiring the modified information node, the old text content of the information node and the new text content of the information node;
s2.2, judging whether the old text content is empty or not, if the old text content is empty and the new text content is not empty, marking all the new text content in the trace operation record as new;
s2.3, judging whether the new text content is empty, if the new text content is empty and the old text content is not empty, marking all the old text content in the trace operation record as deleted;
s2.4, obtaining a dynamic planning two-dimensional array of the minimum editing distance of the two character strings through the old text content and the new text content;
wherein, assuming old text: cold and fever; new text: and (3) if the patient is cold and coughs, obtaining a two-dimensional array by dynamic programming of the minimum edit distance as follows:
| feeling of | Cap with heating means | Hair-like device | Baking | ||
| 0 | 1 | 2 | 3 | 4 | |
| Feeling of | 1 | 0 | 1 | 2 | 3 |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 |
| Hair- |
3 | 2 | 1 | 1 | 2 |
| Baking | 4 | 3 | 2 | 2 | 2 |
S2.5, setting different parts of the old text content and the new text content as spaces according to the dynamic programming two-dimensional array of the minimum editing distance to obtain an old text: cold; new text: cold;
s2.6, comparing the source character string (cold and fever) and the target character string (cold) of the old text content, and when the target character string is a space, using < span > </span > to cover the corresponding characters of the source character string to obtain the old text content modification characters: cold < span > fever </span >;
s2.7, old text content modification characters: the character which is indicated to be deleted, the text which is contained by < span > </span > is taken out from the old text content modification character, marked as deletion operation, and the modification time is stored as a trace operation record object in the custom node in the document together with the current modification doctor:
deleting "> < strike fever </strike > </font > at 2019-11-1119: 01: 53;
s2.8, comparing a source character string (cold cough) and a target character string (cold) of the new text content, and when the target character string is a space, using < span > </span > to include characters corresponding to the source character string to obtain a new text content modification character: cold < span > cough </span >;
s2.9, new text content modification characters: representing new characters, extracting the text contained in < span > </span > from the new text content modification characters, marking as new operation, and storing the new operation, the current doctor and the modification time as trace operation record objects in the custom nodes in the document:
the < font color ═ 0000ff ═ title ═ is newly added in 2019-11-1119: 01:53, > < add > cough [/font >.
Further, the equation for dynamic programming is as follows:
wherein:
further, in S2.5, the calculating step of setting different portions of the old text content and the new text content as spaces according to the dynamic programming two-dimensional array of the minimum edit distance includes the following steps:
s2.5.1, assuming that the dynamic programming two-dimensional array is distance, the number of rows i is distance.length-1, and the number of columns j is distance [0]. length-1; minDistance is the minimum edit distance [ i ] [ j ], s is an old text, and t is a new text;
s2.5.2, when i is greater than 0 and j is also greater than 0, judging;
s2.5.3, when i is greater than 0, the character of the s string at position i is replaced with null and i is reduced by one digit. Re-executing the judgment until i is less than or equal to 0, and finishing the judgment;
s2.5.4, when j is greater than 0, the character of the t string at the j position is replaced with null and j is reduced by one digit. Re-executing the judgment until j is less than or equal to 0, and finishing the judgment;
s2.5.5, and finally obtaining a comparison result.
Specifically, in S2.5.2, when i is greater than 0 and j is also greater than 0, the method for determining includes the following steps:
s2.5.2.1, judging whether the value of distance [ i ] [ j-1] +1 is equal to minDistance, if so, indicating that the character of the s character string at the i position is different from the character of the t character string at j, and the character of the s character string at the i position is the same as the character of the t character string at the j-1 position, replacing the character of the t character string at the j position with null, reassigning the minDistance as distance [ i ] [ j-1], and reducing j by one digit;
s2.5.2.2, if the above conditions are not equal, judging whether the value of distance [ i-1] [ j ] +1 is equal to minDistance, if so, the character of the s character string at the i position is different from the character of the t character string at j, the character of the s character string at the i-1 position is the same as the character of the t character string at the j position, replacing the character of the s character string at the i position with null, reassigning minDistance to distance [ i-1] [ j ], and reducing the number of digits of i;
s2.5.2.3, if the above conditions are not equal, judging whether distance [ i-1] [ j-1] +1 is equal to minDistance, if yes, indicating that the character of the s character string at the i position is different from the character of the t character string at j, replacing the character of the s character string at the i position with null, replacing the character of the t character string at the j position with null, and reassigning minDistance as distance [ i-1] [ j-1], wherein i and j are respectively reduced by one digit;
s2.5.2.4, if the above conditions are not satisfied, the character of the s character string at the i position is the same as the character of the t character string at j, and the i and the j are respectively reduced by one digit;
s2.5.2.5, repeating the above judgment until one of i or j is less than or equal to 0, and ending the above judgment.
Examples are:
in the old text: cold cough, new text: for the case of cold and fever, a two-dimensional array obtained by minimum edit distance dynamic programming is as follows:
| feeling of | Cap with heating means | Hair-like device | Baking | ||
| 0 | 1 | 2 | 3 | 4 | |
| Feeling of | 1 | 0 | 1 | 2 | 3 |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 |
| Cough with |
3 | 2 | 1 | 1 | 2 |
| Cough relieving medicine | 4 | 3 | 2 | 2 | 2 |
It is worth noting that: in the computer, the calculation of the arrays is started from 0, so that the length of the arrays is reduced by 1 in the calculation and then the calculation is carried out;
starting from row 4, column 4, the value "2" in row 4, column 4 is the minimum edit distance;
| | | ||||||
| feeling of | Cap with heating means | Hair-like device | Baking | |||
| 0 | 1 | 2 | 3 | 4 | ||
| Feeling of | 1 | 0 | 1 | 2 | 3 | |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 | |
| Cough with |
3 | 2 | 1 | 1 | 2 | |
| - | Cough relieving medicine | 4 | 3 | 2 | 2 | 2 |
Judging whether the 'cough' in the 4 th row is the same as the 'hair' in the 3 rd column and the 'fever' in the 4 th column;
row 4, column 3 has a value of "2", plus "1", and a value of "3", which is greater than the minimum edit distance "2", so the "cough" in row 4 is not the same as the "hair" in column 3 and the "fever" in column 4;
judging whether the 'fever' in the 4 th column is the same as the 'cough' in the 3 rd row and the 'cough' in the 4 th row, the value of the 4 th column in the 3 rd row is '2', the value is '1' and '3', the value is larger than the minimum edit distance '2', so the 'fever' in the 4 th column is different from the 'cough' in the 3 rd row and the 'cough' in the 4 th row;
judging whether the 'cough' in the 4 th row is different from the 'fever' in the 4 th column, if the value in the 3 rd column in the 3 rd row is 1, adding 1 and the value is 2, and the minimum edit distance is 2, so that the 'cough' in the 4 th row is different from the 'fever' in the 4 th column, replacing the 'cough' in the 4 th row with air, and replacing the 'fever' in the 4 th column with air;
the minimum edit distance becomes the value "1" in row 3, column 3;
| | | ||||||
| feeling of | Cap with heating means | Hair-like device | - | |||
| 0 | 1 | 2 | 3 | 4 | ||
| Feeling of | 1 | 0 | 1 | 2 | 3 | |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 | |
| - | Cough with |
3 | 2 | 1 | 1 | 2 |
| - | 4 | 3 | 2 | 2 | 2 |
Judging whether the 'cough' in the 3 rd row is the same as the 'cold' in the 2 nd column and the 'hair' in the 3 rd column, the value of the 2 nd column in the 3 rd row is '1', the value is '1' after being added with '1', the value is '2', and the value is larger than the minimum editing distance '1', so the 'cough' in the 3 rd row is different from the 'cold' in the 2 nd column and the 'hair' in the 3 rd column;
judging whether the 'hair' of the 3 rd column is the same as the 'common' of the 2 nd row and the 'cough' of the 3 rd row, the value of the 3 rd column of the 2 nd row is '1', the value is '1' after being added with '1', the value is '2', and the value is larger than the minimum editing distance '1', so the 'hair' of the 3 rd column is different from the 'common' of the 2 nd row and the 'cough' of the 3 rd row;
judging whether the 'cough' in the 3 rd row is different from the 'hair' in the 3 rd column, the value of the 2 nd column in the 2 nd row is 0, the sum of the '1' and the value is 1, and the sum is equal to the minimum editing distance '1', so that the 'cough' in the 3 rd row is different from the 'hair' in the 3 rd column, replacing the 'cough' in the 3 rd row with null, and replacing the 'hair' in the 3 rd column with null;
the minimum edit distance becomes the value "0" in row 2, column 2;
judging whether the top of the 2 nd row is the same as the top of the 1 st column and the top of the 2 nd column, the value of the 1 st column of the 2 nd row is 1, the sum of the 1 st column and the 2 nd column is 1, the value is 2, and the value is larger than the minimum editing distance 0, so the top of the 2 nd row is the same as the top of the 1 st column and the top of the 2 nd column;
judging whether the top in the 2 nd column is the same as the top in the 1 st row and the top in the 2 nd row, the value in the 1 st row and the 2 nd column is 1, plus 1, the value is 2, the value is larger than the minimum editing distance 0, so the top in the 2 nd column is the same as the top in the 1 st row and the top in the 2 nd row;
judging whether the top of the 2 nd row is different from the top of the 2 nd column, wherein the value of the 1 st column of the 1 st row is 0, plus 1, the value is 1 and is larger than the minimum editing distance 0, so the top of the 2 nd row is the same as the top of the 2 nd column, and the minimum editing distance is unchanged;
| | | ||||||
| feeling of | Cap with heating means | - | - | |||
| 0 | 1 | 2 | 3 | 4 | ||
| - | Feeling of | 1 | 0 | 1 | 2 | 3 |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 | |
| - | 3 | 2 | 1 | 1 | 2 | |
| - | 4 | 3 | 2 | 2 | 2 |
Judging whether the 'feeling' of the 1 st row is the same as 'the' feeling 'of the 0 th column and' the 'feeling' of the 1 st column, the value of the 0 th column of the 1 st row is '1', the value is '1' added with '1' and is '2', and the value is larger than the minimum editing distance '0', so that the 'feeling' of the 1 st row is different from 'the' feeling 'of the 0 th column and' the 'feeling' of the 1 st column;
judging whether the 'feeling' of the 1 st column is the same as the 'feeling' of the 0 th row and the 'feeling' of the 1 st row, the value of the 0 th row and the 1 st column is '1', adding '1' and the value is '2', the value is larger than the minimum editing distance '0', so the 'feeling' of the 1 st column is different from the 'feeling' of the 0 th row and the 'feeling' of the 1 st row;
judging whether the 'sense' of the 1 st row is different from the 'sense' of the 1 st column, wherein the value of the 0 th column of the 0 th row is '0', plus '1', the value is '1', and the value is larger than the minimum editing distance '0', so the 'common' of the 1 st row and the 'common' of the 1 st column are the same, and the minimum editing distance is unchanged;
| | | ||||||
| feeling of | Cap with heating means | - | - | |||
| - | 0 | 1 | 2 | 3 | 4 | |
| Feeling of | 1 | 0 | 1 | 2 | 3 | |
| Cap with heating means | 2 | 1 | 0 | 1 | 2 | |
| - | 3 | 2 | 1 | 1 | 2 | |
| - | 4 | 3 | 2 | 2 | 2 |
And finishing comparison to obtain the final result of the old text: cold; new text: it is used for treating common cold.
Referring to fig. 5, a schematic structural diagram of an apparatus for providing trace preservation of an electronic medical record according to an embodiment of the present invention is shown, and the apparatus includes a processor 101, a memory 102, and a bus 103.
The processor 101 comprises one or more processing cores, the processor 101 is connected with the processor 101 through a bus 103, the memory 102 is used for storing program instructions, and the processor 102 realizes the method for keeping the electronic medical record trace when executing the program instructions in the memory 102.
Alternatively, memory 102 may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
In addition, the present invention also provides a computer readable storage medium, in which at least one program is stored, and the at least one program is executed by the processor to implement the steps of the method for electronic medical record trace preservation as described in any one of the above.
Optionally, the present invention also provides a computer program product containing instructions which, when run on a computer, cause the computer to perform the steps of the above-described aspects of the method for electronic medical record retention.
It will be understood by those skilled in the art that all or part of the steps of implementing the above embodiments may be implemented by hardware, or may be implemented by hardware related to instructions of a program, and the program may be stored in a computer readable storage medium, where the above mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing shows and describes the general principles, essential features, and advantages of the invention. It will be understood by those skilled in the art that the present invention is not limited to the embodiments described above, and the preferred embodiments of the present invention are described in the above embodiments and the description, and are not intended to limit the present invention. The scope of the invention is defined by the appended claims and equivalents thereof.
Claims (7)
1. A method for keeping trace of electronic medical record comprises the following steps:
s1, adding a new medical record by the doctor A, and storing the content of each information node of the medical record in the custom attribute when the medical record is stored;
s2, when the medical record is stored after the medical record is modified by the superior doctor B, the content of the modified information node is compared with the content of the information node stored in the custom attribute in a text mode, and the record of trace operation is stored;
and S3, A, the doctor views the medical record, clicks the trace view, takes out the trace operation record from the custom attribute in the document and displays the trace operation record on the document.
2. The method for electronic medical record trace preservation according to claim 1, wherein: in S2, the text comparison method includes the following steps:
s2.1, acquiring the modified information node, the old text content of the information node and the new text content of the information node;
s2.2, judging whether the old text content is empty or not, if the old text content is empty and the new text content is not empty, marking all the new text content in the trace operation record as new;
s2.3, judging whether the new text content is empty, if the new text content is empty and the old text content is not empty, marking all the old text content in the trace operation record as deleted;
s2.4, obtaining a dynamic planning two-dimensional array of the minimum editing distance of the two character strings through the old text content and the new text content;
s2.5, setting different parts of the old text content and the new text content as spaces according to the dynamic programming two-dimensional array of the minimum editing distance to obtain an old text: cold; new text: cold;
s2.6, comparing the source character string and the target character string of the old text content, and when the target character string character is a space, using < span > </span > to include the corresponding character of the source character string to obtain an old text content modification character: cold < span > fever </span >;
s2.7, old text content modification characters: the character which is indicated to be deleted, the text which is contained by < span > </span > is taken out from the old text content modification character, marked as deletion operation, and the modification time is stored as a trace operation record object in the custom node in the document together with the current modification doctor:
deleting "> < strike fever </strike > </font > at 2019-11-1119: 01: 53;
s2.8, comparing the source character string and the target character string of the new text content, and when the target character string character is a space, using < span > </span > to include the corresponding character of the source character string to obtain a new text content modification character: cold < span > cough </span >;
s2.9, new text content modification characters: representing new characters, extracting the text contained in < span > </span > from the new text content modification characters, marking as new operation, and storing the new operation, the current doctor and the modification time as trace operation record objects in the custom nodes in the document:
the < font color ═ 0000ff ═ title ═ is newly added in 2019-11-1119: 01:53, > < add > cough [/font >.
3. The method for electronic medical record trace preservation according to claim 2, wherein: the equation for dynamic programming is as follows:
wherein:
4. the method for electronic medical record trace preservation according to claim 2, wherein: in S2.5, the step of calculating, according to the dynamic programming two-dimensional array of the minimum edit distance, that different portions of the old text content and the new text content are set as spaces includes the steps of:
s2.5.1, assuming that the dynamic programming two-dimensional array is distance, the number of rows i is distance.length-1, and the number of columns j is distance [0]. length-1; minDistance is the minimum edit distance [ i ] [ j ], s is an old text, and t is a new text;
s2.5.2, when i is greater than 0 and j is also greater than 0, judging;
s2.5.3, when i is larger than 0, replacing the character of the s character string at the position i with null, reducing the number of digits of i, re-executing the judgment until i is less than or equal to 0, and ending the judgment;
s2.5.4, when j is larger than 0, replacing the character of t character string at j position with null, reducing j by one digit, executing judgment again until j is smaller than or equal to 0, and ending the judgment;
s2.5.5, and finally obtaining a comparison result.
5. The method of electronic medical record trace preservation according to claim 4, wherein: in S2.5.2, the method for determining when i is greater than 0 and j is also greater than 0 includes the steps of:
s2.5.2.1, judging whether the value of distance [ i ] [ j-1] +1 is equal to minDistance, if so, indicating that the character of the s character string at the i position is different from the character of the t character string at j, and the character of the s character string at the i position is the same as the character of the t character string at the j-1 position, replacing the character of the t character string at the j position with null, reassigning the minDistance as distance [ i ] [ j-1], and reducing j by one digit;
s2.5.2.2, if the above conditions are not equal, judging whether the value of distance [ i-1] [ j ] +1 is equal to minDistance, if so, the character of the s character string at the i position is different from the character of the t character string at j, the character of the s character string at the i-1 position is the same as the character of the t character string at the j position, replacing the character of the s character string at the i position with null, reassigning minDistance to distance [ i-1] [ j ], and reducing the number of digits of i;
s2.5.2.3, if the above conditions are not equal, judging whether distance [ i-1] [ j-1] +1 is equal to minDistance, if yes, indicating that the character of the s character string at the i position is different from the character of the t character string at j, replacing the character of the s character string at the i position with null, replacing the character of the t character string at the j position with null, and reassigning minDistance as distance [ i-1] [ j-1], wherein i and j are respectively reduced by one digit;
s2.5.2.4, if the above conditions are not satisfied, the character of the s character string at the i position is the same as the character of the t character string at j, and the i and the j are respectively reduced by one digit;
s2.5.2.5, repeating the above judgment until one of i or j is less than or equal to 0, and ending the above judgment.
6. An electronic medical record trace keeping device is characterized in that: comprising a processor, a memory and a computer program stored in said memory and running on said processor, said processor implementing the steps of the method for electronic medical record retention according to any of claims 1-4 when executing said computer program.
7. A computer-readable storage medium, wherein at least one program is stored in the storage medium, and the at least one program is executed by the processor to implement the steps of the method for trace preservation of electronic medical records according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010015951.1A CN111223545A (en) | 2020-01-08 | 2020-01-08 | Method for keeping trace of electronic medical record |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010015951.1A CN111223545A (en) | 2020-01-08 | 2020-01-08 | Method for keeping trace of electronic medical record |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111223545A true CN111223545A (en) | 2020-06-02 |
Family
ID=70832276
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010015951.1A Pending CN111223545A (en) | 2020-01-08 | 2020-01-08 | Method for keeping trace of electronic medical record |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111223545A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116153452A (en) * | 2023-04-18 | 2023-05-23 | 济南科汛智能科技有限公司 | Medical electronic medical record storage system based on artificial intelligence |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1979478A (en) * | 2005-12-09 | 2007-06-13 | 北京书生国际信息技术有限公司 | File processing system and file processing method |
| US20070240035A1 (en) * | 2006-04-10 | 2007-10-11 | Balasubramanyam Sthanikam | Efficient evaluation for diff of XML documents |
| CN102968596A (en) * | 2012-10-30 | 2013-03-13 | 南京信息工程大学 | Delete marker-based office open xml (OOX) document digital watermarking method |
| CN103218765A (en) * | 2013-03-21 | 2013-07-24 | 无锡曼荼罗软件有限公司 | Method and system for retaining medical document modifying traces |
| CN103294915A (en) * | 2013-05-28 | 2013-09-11 | 美合实业（苏州）有限公司 | Multifunctional medical information recording device |
| CN104834509A (en) * | 2014-02-11 | 2015-08-12 | 蓝网科技有限公司 | Method of editing vector diagram in electronic medical record editor |
| CN105589838A (en) * | 2015-12-24 | 2016-05-18 | 中国电子科技集团公司第三十三研究所 | Electronic official document trace reserving method based on file comparison |
| CN106682533A (en) * | 2017-01-13 | 2017-05-17 | 上海鹰谷信息科技有限公司 | Method for modifying record trace contents in electronic experimental records |
| US20180068074A1 (en) * | 2016-09-05 | 2018-03-08 | Boe Technology Group Co., Ltd. | Method, apparatus and system of generating electronic medical record information |
-
2020
- 2020-01-08 CN CN202010015951.1A patent/CN111223545A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1979478A (en) * | 2005-12-09 | 2007-06-13 | 北京书生国际信息技术有限公司 | File processing system and file processing method |
| US20070240035A1 (en) * | 2006-04-10 | 2007-10-11 | Balasubramanyam Sthanikam | Efficient evaluation for diff of XML documents |
| CN102968596A (en) * | 2012-10-30 | 2013-03-13 | 南京信息工程大学 | Delete marker-based office open xml (OOX) document digital watermarking method |
| CN103218765A (en) * | 2013-03-21 | 2013-07-24 | 无锡曼荼罗软件有限公司 | Method and system for retaining medical document modifying traces |
| CN103294915A (en) * | 2013-05-28 | 2013-09-11 | 美合实业（苏州）有限公司 | Multifunctional medical information recording device |
| CN104834509A (en) * | 2014-02-11 | 2015-08-12 | 蓝网科技有限公司 | Method of editing vector diagram in electronic medical record editor |
| CN105589838A (en) * | 2015-12-24 | 2016-05-18 | 中国电子科技集团公司第三十三研究所 | Electronic official document trace reserving method based on file comparison |
| US20180068074A1 (en) * | 2016-09-05 | 2018-03-08 | Boe Technology Group Co., Ltd. | Method, apparatus and system of generating electronic medical record information |
| CN106682533A (en) * | 2017-01-13 | 2017-05-17 | 上海鹰谷信息科技有限公司 | Method for modifying record trace contents in electronic experimental records |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116153452A (en) * | 2023-04-18 | 2023-05-23 | 济南科汛智能科技有限公司 | Medical electronic medical record storage system based on artificial intelligence |
| CN116153452B (en) * | 2023-04-18 | 2023-06-30 | 济南科汛智能科技有限公司 | Medical electronic medical record storage system based on artificial intelligence |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107766309B (en) | Data table generation method and device, storage medium and electronic device | |
| US20180012039A1 (en) | Anonymization processing device, anonymization processing method, and program | |
| CN111292817A (en) | Electronic medical record generation method and device | |
| CN111125598A (en) | Intelligent data query method, device, equipment and storage medium | |
| JP2006309446A (en) | Classification dictionary updating device, classification dictionary updating program, and classification dictionary updating method | |
| CN110765754A (en) | Text data typesetting method and device, computer equipment and storage medium | |
| JP6982049B2 (en) | Methods, equipment, equipment and storage media for managing indexes | |
| CN115543402B (en) | Software knowledge graph increment updating method based on code submission | |
| CN107463669B (en) | Method and device for analyzing webpage data crawled by crawler | |
| CN111223545A (en) | Method for keeping trace of electronic medical record | |
| CN111444368B (en) | Method and device for constructing user portrait, computer equipment and storage medium | |
| Cox | Speaking Stata: Loops, again and again | |
| CN112002384A (en) | Method and device for summarizing medical record information, computer equipment and storage medium | |
| WO2019085118A1 (en) | Topic model-based associated word analysis method, and electronic apparatus and storage medium | |
| CN113065947A (en) | Data processing method, device, equipment and storage medium | |
| CN113051321B (en) | Data importing method, device, equipment and storage medium | |
| CN113282218A (en) | Multi-dimensional report generation method, device, equipment and storage medium | |
| CN113569170A (en) | Webpage table data extraction method and device, computer equipment and storage medium | |
| CN113177392A (en) | Method for synchronizing row segment information in proofreading interface, computing device and storage medium | |
| CN111695016A (en) | Novel technical scheme for intelligent flow direction data matching in pharmaceutical industry | |
| CN114490627A (en) | Data processing method and device, electronic equipment and storage medium | |
| CN115034189A (en) | Table data processing method and device, computer equipment and storage medium | |
| CN112835886A (en) | Data table field adding method and device | |
| CN105224881B (en) | A kind of two-way K anonymous methods under mass-rent database | |
| CN112202822B (en) | Database injection detection method and device, electronic equipment and storage medium |
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 | ||
| CB02 | Change of applicant information |
Address after: 361000 unit 404, No. 24, guanri Road, phase II, software park, Xiamen, Fujian Applicant after: XIAMEN ZHIYE SOFTWARE ENGINEERING CO.,LTD. Address before: 361000 No.24 guanri Road, Siming District, Xiamen City, Fujian Province Applicant before: XIAMEN ZHIYE SOFTWARE ENGINEERING CO.,LTD. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200602 |
|
| RJ01 | Rejection of invention patent application after publication |