JP2003188735A - Data compressing device and method, and program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a data compressing device and method in which genome data can be efficiently compressed, and a program. <P>SOLUTION: The base sequence of a mouse, for example, is stored on a dictionary DB 13 as a dictionary sequence. The base sequence of human being as a compression target sequence is stored on a sequence DB 11. A part of the compression target sequence is defined as reference information and the whether there exists matching is searched by comparing the reference information with the base sequence of a mouse. The length of the reference information is not limited and the reference information can be made to be long as long as it is matched with the dictionary sequence. When there is matching, a token presenting information indicating the matching in the dictionary sequence and the length of the reference information is prepared and is replaced with a token being a part of the compression target and prepared at the part corresponding to the reference information. <P>COPYRIGHT: (C)2003,JPO

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data compression apparatus, method and program capable of efficiently compressing genomic data.

[0002]

2. Description of the Related Art The bases of the genome are "A", "C",
It is expressed by "G" and "T". Currently, research is being made in various countries to elucidate the genomic nucleotide sequences of various organisms. Compression techniques are commonly used to reduce the amount of data. As one of compression techniques, there is a method of replacing a part of data with data having a smaller number of bits than the original data to reduce the total information amount. For example, the base sequence of the genome is "A = 00", "C = 01",
It is replaced with “G = 10” and “T = 11”. As a result, one byte was used for each base
2 bits are used for each base, and the amount of information is 1 /
It will be about 4.

[0003]

For example, humans have about 3 billion bases, and even if one base is expressed by 2 bits as described above, the amount of human base sequence information is 3 Gbytes. Become. Currently, not only humans but also various research groups and others are proceeding with a project to examine the genomic base sequences of various kinds of plants and animals such as rice and mouse, and to investigate the correlation, and the genome data is increasing. With the increase of such genome data, the cost of managing the file storing the genome data increases. In addition, a project for genome data may be promoted by a plurality of research groups in cooperation, and the communication time for exchanging genome data at each research institution will be enormous. The present invention has been made in view of such circumstances, and an object of the present invention is to provide a data compression device, method, and program capable of efficiently compressing genome data.

[0004]

The present invention has been made to achieve the above object, and the present invention uses compression target data composed of a plurality of unit data and dictionary data composed of a plurality of unit data. In the data compressing device for compressing, the storage unit for storing the dictionary data and the reference information, which is an array of the unit data of the uncompressed portion in the compression target data, are compared with the dictionary data to find a matching portion. Search and
When a matching portion is detected as a result of the search, a unit data sequence next to the reference information and an array of unit data constituting the dictionary data, which is next to the array of unit data that matches the reference information, Recognizing the length of continuous unit data by comparing with the continuous unit data, position information indicating the start position of the matching point in the dictionary data, and the length information of the matching unit data And a compression unit that replaces the replacement information including the position information and the length information recognized by the comparison unit at the matching portion in the compression target data.

Further, in the present invention according to the above-mentioned invention, the comparison unit, when a matching portion is not found as a result of the search, arranges a unit data array shifted by one or a plurality of positions from the starting point of the reference information. New reference information,
It is characterized in that the new reference information is compared with the dictionary data.

Thus, for example, when the genomic data of a certain biological species is used as the dictionary data and the genomic data of another biological species is used as the compression target data, the compression ratio of the base sequence data and amino acid sequence data of the other biological species is obtained. Can be dramatically increased. In addition, when the genome data of multiple organisms is used as dictionary data and the data to be compressed is compressed with multiple organism species, the compression rate increases as the number of species of organisms used as dictionary data increases, resulting in worldwide compression. It is possible to suppress the increasing rate of increasing genomic data. Also,
By compressing the data, a reduction in communication costs can be expected. Further, the data management cost can be reduced.

According to the present invention, in the above invention, the similarity between the compression target data and the dictionary data is obtained by comparing the information amount before compression and the information amount after compression of the compression target data. It is characterized by further comprising a degree acquisition means.

Thus, for example, when the genome data of a certain species is used as dictionary data and the genome data of another species is used as the compression target data, the similarity between the species used as the dictionary data and the compression target You can get the degree. Further, such a degree of similarity can be obtained while the data is compressed.

Further, the present invention is a data compression device for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, wherein the unit data in the unit data constituting the compression target data is compressed. An array of specific unit data is used as dictionary data, reference information, which is an array of unit data at uncompressed points in the compression target data, is compared with the dictionary data to search for a matching point, and the result of the search is matched. When a point is detected, unit data that is next to the reference information and unit data that is an array of unit data that constitutes the dictionary data and that is next to the array of unit data that matches the reference information are generated. Recognizing the length where the unit data continuously match by comparing, position information indicating the start position of the matching point in the dictionary data, and the length of the matching unit data A comparing unit that recognizes information, a compressing unit that replaces replacement information including position information and length information recognized by the comparing unit at matching points in the compression target data, and a storage unit that stores the dictionary data. And are provided.

Also, in the present invention according to the above-mentioned invention, when the matching portion is not found as a result of the search, the comparison unit generates an array of unit data shifted one or more from the end point position of the dictionary data. And is additionally stored in the storage unit.

As a result, the compression rate of, for example, base sequence data or amino acid sequence data can be dramatically increased. Further, by compressing the data, it is possible to expect a reduction in communication cost. Further, the data management cost can be reduced. If there is no part that matches the dictionary data, the part that does not match can be added as new dictionary data, so that the compression rate can be further improved.

Further, the present invention is a data compression method for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, the process including storing the dictionary data, and A process of comparing reference information, which is an array of unit data of uncompressed points in the data to be compressed, with the dictionary data and searching for a matching point, and when a matching point is detected as a result of the search, the reference information By comparing the next continuous unit data and the next continuous unit data of the unit data array that constitutes the dictionary data and is the same as the reference information, the unit data is continuously generated. A step of recognizing a matching length; a step of recognizing position information indicating a start position of a matching point in the dictionary data; and a step of recognizing length information of the matching unit data, Matching location in the reduced target data, characterized by comprising a step of replacing the replacement information including the recognized position information and length information.

Further, the present invention is a data compression method for compressing compression target data composed of a plurality of unit data by using dictionary data composed of a plurality of unit data, wherein The process of making an array of specific unit data into dictionary data, the process of storing the dictionary data, and the reference information, which is an array of unit data at an uncompressed portion in the data to be compressed, are compared with the dictionary data and match. In the process of searching for a part to be searched, and when a matching part is detected as a result of the search, the unit data following the reference information and an array of the unit data forming the dictionary data match the reference information. The process of recognizing the length of continuous unit data by comparing the unit data array next to the unit data array and the matching number in the dictionary data. Recognizing the position information indicating the start position of the data and the length information of the matching unit data, and the matching position in the compression target data includes the position information and the length information recognized by the comparing unit. And a step of replacing the replacement information.

The present invention is also a data compression program for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data.
Storing the dictionary data, comparing reference information, which is an array of unit data of uncompressed points in the compression target data, with the dictionary data, searching for a matching point, and matching as a result of the search When a point is detected, unit data that is next to the reference information and unit data that is an array of unit data that constitutes the dictionary data and that is next to the array of unit data that matches the reference information are generated. A step of recognizing a length in which the unit data consecutively match by comparing, a step of recognizing position information indicating a start position of a matching point in the dictionary data, and a length information of the matching unit data. And a step of replacing the replacement information including the recognized position information and length information at the matching portion in the compression target data with a computer. Is a data compression program.

The present invention is also a data compression program for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data.
Reference is an array of unit data that is an uncompressed portion of the compression target data, a step of setting an array of specific unit data in the unit data that constitutes the compression target data as dictionary data, a step of storing the dictionary data Comparing the information with the dictionary data to search for a matching location,
When a matching portion is detected as a result of the search, a unit data sequence next to the reference information and an array of unit data constituting the dictionary data, which is next to the array of unit data that matches the reference information, A step of recognizing a length of continuous unit data by comparing the unit data with each other, position information indicating a start position of a matching point in the dictionary data, and a length of the unit data of the match. A data compression program that causes a computer to execute a step of recognizing information and a step of replacing the replacement information including the position information and the length information recognized by the comparison unit at a matching portion in the compression target data. .

[0016]

DETAILED DESCRIPTION OF THE INVENTION An embodiment of the present invention will be described below with reference to the drawings. First, the base sequence will be briefly described. As described above, the bases of the genome are represented by "A", "C", "G", and "T". The base sequences of organisms have some common parts among organism types. For example, when the nucleotide sequences of human and mouse are as shown in FIG. 10, the positions in the genome are different, but the sequence is common between the part A in the figure and the part B in the figure. There is. Such a sequence is a conserved base sequence that does not change even if the organism evolves and becomes a different species, and its commonality is often remarkable as it is a functionally significant part. The data compression apparatus of the present embodiment compresses the data of the base sequence by utilizing the property of the base sequence of such a genome.

FIG. 1 is a block diagram showing the structure of the data compression apparatus 1. The configuration of the data compression device 1 will be described with reference to FIG. In FIG. 1, reference numeral 11 is a sequence DB (database) in which base sequences to be compressed are stored. A compression target sequence acquisition unit 12 acquires the compression target sequence stored in the array DB 11. 13 is the dictionary D
B, which stores the base sequence to be compared with the compression target sequence. Hereinafter, the base sequence stored in the dictionary DB 13 is called a dictionary sequence. FIG. 2 shows an example of the dictionary array stored in the dictionary DB 13. Although details will be described later, there are an embodiment in which the dictionary array is stored in advance in the dictionary DB 13, and an embodiment in which the dictionary array is not stored at the beginning. A dictionary array acquisition unit 14 acquires a dictionary array.

Reference numeral 15 denotes a comparison unit, which compares the compression target array with the dictionary array and acquires the position information of the matching position and the matching length information. Reference numeral 16 is a compression unit, which is a comparison unit 15.
The token including the position information and the length information acquired by is replaced with the compression target array for compression. 1
Reference numeral 7 denotes a similarity acquisition unit, which acquires the similarity from the compression rate.

The array DB 11 will be described. Sequence DB
11 stores three files, “nhr”, “nsq”, and “nin”. In “nhr”, header information that is information related to biological origin is recorded. Information (sequence information) indicating an actual base sequence is recorded in “nsq”. In “nin”, the length of header information and the length of sequence information are recorded.

Each file will be described with reference to the array shown in FIG. In FIG. 3, the first line is information indicating the origin of the organism. The second and third lines show the base sequence of the organism. The header information shown in the first line of FIG. 3 is recorded in the “nhr” file. The base sequences shown in the 2nd and 3rd lines are “A = 00”, “C = 01”, and “G =
10 "," T = 11 "and so on. For example, the first "AGCT" is converted to "00011011". The information thus converted is recorded in the "nsq" file. By performing the conversion in this way, one character indicating one base (1 byte = 8 bits) can be represented by 2 bits which is 1/4 the length before conversion.

Since the number of characters of the header information shown in the first line of FIG. 3 is 54, its length is 54. Also, FIG.
The number of bases shown in the second and third lines is 140, but the length of the sequence information (base sequence) becomes 35 (= 140/4) by the above replacement. The length of the array indicating the length of the header information and the length of the sequence information is 8 (4 bytes x 2). The length 54 of the header information, the length 35 of the sequence information, and the length 8 of the array are recorded in the “nin” file.

Next, the operation will be described. In the explanation of the operation,
The bases will be described as "A", "C", "G", and "T", but in reality, "A = 00", "C = 01", "G = 10",
The processing described below is executed using one base represented by 2 bits, such as "T = 11".

<First Embodiment> Here, a static compression operation will be described. In the static compression, a dictionary array is stored in the dictionary DB 13 in advance, and compression is performed using the stored dictionary array. Here, for example, it is assumed that a mouse base sequence is stored as a dictionary sequence in the dictionary DB 13, and a human base sequence as a compression target sequence is stored in the sequence DB 11.

The dictionary array acquisition unit 14 of the data compression apparatus 1
First, the dictionary array is acquired from the dictionary DB 13 (step S10 in FIG. 4), and the acquired dictionary array is compared with the comparison unit 1
Send to 5. The compression target sequence acquisition unit 12 uses the sequence DB 1
The compression target array is acquired from 1 (step S11 in FIG. 4). The compression target sequence acquisition unit 12 refers to the “nin” file in the sequence DB 11 to recognize the length in which the compression target sequence is stored, and acquires the compression target sequence of the recognized length from the “nsq” file. To do. The compression target sequence acquisition unit 12 transmits the acquired compression target sequence to the comparison unit 15.

The comparison unit 15 compares the dictionary array with the compression target array and searches for a matching portion (step S12 in FIG. 4). As shown in FIG. 5, the comparison unit 15 determines whether or not the base sequence that matches a continuous base sequence fragment of 40 bases (2 bits per base) or more from the compression processing start position of the compression target sequence is in the dictionary array. Search for. Hereafter, 40 in the compression target array to be compared for matching with the dictionary array
A base sequence fragment having more than one base is referred to as reference information. Note that FIG.
In, the dictionary array is shown folded.

First, the case where the search result shows that the base sequence matching the reference information is in the dictionary sequence (step S13 in FIG. 4) will be described. The underline shown in the dictionary array of FIG. 6 is
The base sequence locations that match the reference information of the compression target sequence are shown. Note that in FIG. 6, the dictionary array is shown folded. The comparison unit 15 transmits information to the compression unit 16 that there is a matching portion, the start position of the matching portion in the dictionary array, and the length of the matching base.

The compression unit 16 creates a token in order to replace a part of the compression target array with the dictionary array (step S14 in FIG. 4). This token is, for example, a matching position in the dictionary array (underlined part in the dictionary array in FIG. 6).
If the matching length is 40 (the number of bases), starting from the 60th base from the start of the dictionary sequence, "1
(60, 40) ”is created. In this token, "1" is a bit flag indicating that it matches the dictionary array.

Here, the length of the reference information (the number of bases) is 4
The number 0 is not fixed but indicates the minimum length of the reference information. The length of the reference information is
It can be infinitely long as long as it matches the dictionary array.
For example, assume that the base at the start of the compression target sequence is the start of the reference information, and the continuous base sequence having a length of 40 from the compression target sequence start base matches the continuous sequence having a length of 40 from the start of the dictionary sequence. . As a result of further comparison performed by the comparison unit 15, when the 50th base sequence from the compression target sequence start base and the 50th base sequence from the start of the dictionary sequence match, the compression unit 16 sets the token to “1 (1 5,
0) ”. By making the length of the reference information variable in this way, it is possible to replace it with a token with a certain amount of information, no matter how long the length of the reference information that matches the dictionary array, and as a result, the compression rate can be increased. it can.

The start position of the matching position in the dictionary array,
After passing the information regarding the length of the matching bases to the compression unit 16, the comparison unit 15 confirms whether or not all the sequences to be compressed have been compared (step S16 in FIG. 4), and if the comparison is not completed, A contiguous base sequence fragment having a length of 40 or more from the next base of the replaced compression target sequence is used as new reference information and compared with the dictionary sequence to find a matching position. For example, when the token from the start base of the compression target sequence to the 50th base is replaced with the token, the length 4 with the 51st base from the start base of the compression target sequence as the starting point
0 or more consecutive base sequence fragments as new reference information,
Compare with dictionary array.

Next, as a result of the search, if there is no matching base sequence in the dictionary sequence (step S13 in FIG. 4).
Will be explained. The comparison unit 15 determines that there is no match and the first base of the reference information of the compression target sequence with the compression unit 16
Send to. The compression unit 16 creates the first base of the reference information of the compression target sequence as it is with a bit flag indicating that it does not match (step S15 in FIG. 4). For example, when the reference information starting from the base “A” does not match the dictionary array, “0 (0, 0,
0) Create a token such as "A". Of the tokens, the first "0" is a bit flag indicating that they do not match. Further, “(0,0)” is dummy information. In addition, “A” indicates a base that did not match.

After passing the fact that they do not match and the first base of the reference information to the compression unit 16, the comparison unit 15 confirms whether all the sequences to be compressed are compared (step in FIG. 4). S16), if the comparison is not completed, as shown in FIG. 7, the start position of the reference information of the compression target sequence is skipped by one base (2 bits), and a base sequence of 40 bases or more is newly added. Reference information. For example, if the reference information starting at the 41st base from the start of the compression target sequence does not match the dictionary sequence, the 42nd base from the start of the compression target sequence is set as the starting point of new reference information.

The comparing unit 15 searches the dictionary array for a portion that matches the new reference information, and if there is a matching portion, creates a token indicating the matching portion in the compression unit 16 as described above. If there is no matching portion, the compression unit 16 is made to create a dummy token.

As described above, the comparing section 15 and the compressing section 16 compress the array to be compressed by repeating the processing of comparing the reference information with the dictionary array and creating the token. The created token is temporarily stored in the field storing the token in the data compression device 1, and the compression target sequence acquisition unit 1
All the compression target sequences read out by 2 are stored until they are compared with the dictionary sequence. When the tokens for all the compression target arrays are created, the compression unit 16 outputs information including the created tokens as compressed data.

When it is necessary to compress the base sequences of other uncompressed organisms (step S1 in FIG. 4).
7) Then, the compression target array and the dictionary array are read again, and compression is performed by the same processing as described above. When the compression of the compression target array is completed in this way, the similarity acquisition unit 1
Reference numeral 7 acquires the species proximity between the organism of the compression target sequence and the organism of the dictionary data from the compression rate of the compression target sequence. The principle is that, as described above, when the base sequence of one organism is used as a dictionary and the base sequence of another organism is compressed, the closer the species to the dictionary organism, the more points that match, resulting in a higher compression rate. . Therefore, it is possible to estimate the closeness of the species between the organism as a dictionary and the organism to be compressed by the compression ratio.

<Embodiment 2> Here, a dynamic compression operation will be described. In the dynamic compression, unlike the above-described embodiment, the dictionary array is not stored in the dictionary DB 13 before the compression process is started. The operation of each unit is the same as the above-mentioned operation, and will be briefly described below.

The compression target sequence acquisition unit 1 of the data compression apparatus 1
2 reads the compression target array from the array DB 11 and sends it to the comparison unit 15. As shown in FIG. 8, the comparison unit 15 sets a part of the compression target sequence as a dictionary array and searches for a base sequence part that matches the dictionary sequence in the compression target sequence. For example, a length of 40 (40
Base) as a dictionary array.

The comparison unit 15 transmits the dictionary array to the dictionary array acquisition unit 14. The dictionary array acquisition unit 14 stores the acquired dictionary array in the dictionary DB 13. In addition, the comparison unit 15
The dictionary sequence is transmitted to the dictionary sequence acquisition unit 14 and the compression target sequence is searched for a base sequence that matches the dictionary sequence.

If there is a matching portion as a result of the search, the comparing section 15 sends a token to the compressing section 16 by transmitting each piece of information as described above. If they do not match as a result of the search, the dummy token is created by transmitting each information to the compression unit 16 as in the above. further,
The comparison unit 15 adds the next portion of the compression target array that is the dictionary array as a dictionary array, and transmits the dictionary array acquisition unit 14. The dictionary array acquisition unit 14 stores the passed dictionary array in the dictionary DB.
Store in 13. For example, 40 from the start of the compression target array
If the sequence up to the th base is a dictionary sequence, the 41st base is added as a dictionary sequence and stored in the dictionary DB 13.

When compressing from the next time onward, the operation shown in the first embodiment may be performed using the dictionary array acquired in the second embodiment. That is, in the case of compressing another base sequence after acquiring the dictionary sequence in the second embodiment, first, the dictionary DB 13
The matching position is searched by comparing with the dictionary array stored in. If there is no matching portion as a result of the search, only the dummy token may be output as described in the first embodiment. In addition to that, the next base that has a match as described in the second embodiment is added as a dictionary array. You may. Here, the base sequence of different species is a dictionary DB as a dictionary sequence.
When 13 are mixed, it is advisable to distinguish them by giving a type ID to each dictionary array.

Further, as described above, the nucleotide sequences conserved among different species are often functionally significant portions. Therefore, by searching a part of the base sequences in the dictionary sequence commonly used for the compressed data of different organism species, it is possible to obtain the base sequence data having biological significance. Further, this biologically meaningful base sequence data can be obtained while compressing the base sequence data.

In the above embodiment, the comparison unit 15 of the data compression apparatus 1 uses the bases of 40 or more bases as the reference information, but the number of bases is not limited to 40 or more. However, for example, if the number of bases in the reference information is 2
If the token is created as described above, the amount of information after compression becomes 6 bytes, whereas the amount of information before compression becomes 4 bits, and the amount of information before compression becomes smaller. In such a case, it is meaningless to compress, and thus the number of bases of the reference information is preferably a number such that the amount of information after compression is smaller than the amount of information before compression.

Further, the dictionary array may be stored in a tree structure as an example shown in FIG. In this case, the search speed becomes faster than the case where the structure shown in FIG. 2 is stored.

Further, in the first embodiment, when the matching portion cannot be searched, the new reference information obtained by shifting the unmatched range by one base is compared with the dictionary array. Is not limited to one base. Further, in the second embodiment, when the matching portion cannot be searched, it is assumed that a new dictionary sequence is obtained by adding one new base to the existing dictionary sequence, but the number of bases to be added is limited to one. Not a thing.

Further, in the above-mentioned embodiment, the genome data is compressed, but the present invention is not limited to this. For example, it can be applied to compression of amino acid sequence information.

In the above embodiment, the token to be replaced with the array to be compressed is, for example, "1 (50,4,4).
0) ”, such as a bit flag indicating the presence or absence of a match, the start position of the matched position in the dictionary array, and the matched length (the number of bases). The base itself was added, but the base is not limited to this. The token to be replaced may be information indicating which part in the dictionary array matches.

Each unit shown in FIG. 1 may be realized by dedicated hardware, and each unit shown in FIG. 1 is composed of a memory and a CPU (central processing unit), and functions of each unit. The function may be realized by loading a program for realizing it into a memory and executing it.

Further, a program for realizing the functions of the respective parts in FIG. 1 is recorded in a computer-readable recording medium, and the program recorded in this recording medium is read by a computer system and executed. May be. The “computer system” mentioned here includes an OS and hardware such as peripheral devices.

The "computer-readable recording medium" means a flexible disk, a magneto-optical disk,
A portable medium such as a ROM or a CD-ROM, or a storage device such as a hard disk built in a computer system. Furthermore, "computer-readable recording medium"
Means a program that dynamically holds a program for a short period of time, such as a communication line for transmitting a program through a network such as the Internet or a communication line such as a telephone line, and a server or client in that case. Such a volatile memory inside a computer system that holds a program for a certain period of time is also included. Further, the above program may be one for realizing some of the functions described above, and may be one that can realize the above functions in combination with a program already recorded in the computer system. The embodiment of the present invention has been described in detail above with reference to the drawings. However, the specific configuration is not limited to this embodiment, and includes design changes and the like without departing from the scope of the present invention.

[0049]

As described above, according to the data compression apparatus, method and program according to the present invention, it is possible to compress genomic data at a higher compression rate than before, and the compression rate allows dictionary data to be stored as dictionary data. The degree of similarity between the living organism and the living organism of the compression target data can be estimated.

[Brief description of drawings]

FIG. 1 is a block diagram showing a configuration of a data compression device according to an embodiment of the present invention.

FIG. 2 is an example of a dictionary DB in the same embodiment.

FIG. 3 is an example of a compression target array stored in an array DB in the same embodiment.

FIG. 4 is a diagram explaining an operation of the data compression apparatus in the embodiment.

FIG. 5 is a diagram illustrating a compression operation of the data compression apparatus in the embodiment.

FIG. 6 is a diagram explaining a compression operation of the data compression apparatus in the embodiment.

FIG. 7 is a diagram illustrating a compressing operation of the data compressing device in the embodiment.

FIG. 8 is a diagram illustrating a compressing operation of the data compressing device in the embodiment.

FIG. 9 is another example of the dictionary DB in the same embodiment.

FIG. 10 is a diagram for explaining the nature of the base sequence of the genome.

[Explanation of symbols]

1: data compression device, 11: array DB, 12: compression target array acquisition unit, 13: dictionary DB, 14: dictionary array acquisition unit,
15: comparison unit, 16: compression unit, 17: similarity degree acquisition unit

   ─────────────────────────────────────────────────── ─── Continued front page    (72) Inventor Toshihiko Morimoto             Stock Exchange, 3-3 Toyosu 3-chome, Koto-ku, Tokyo             Company NTT Data (72) Inventor Tetsuro Toyota             7-22 Suehiro-cho, Tsurumi-ku, Yokohama-shi, Kanagawa             RIKEN Yokohama Institute F-term (reference) 5B075 KK23 UU19                 5J064 AA02 BA11 BC01 BC14 BC29                       BD02 BD04

Claims (9)

[Claims] 1. A data compression apparatus for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, the storage unit storing the dictionary data, and the compression target data. The reference information, which is an array of unit data of an uncompressed portion, is searched for a matching portion by comparing with the dictionary data, and when a matching portion is detected as a result of the search, a unit that is continuous next to the reference information is detected. By comparing the data and the unit data that is an array of the unit data that constitutes the dictionary data and that is next to the array of the unit data that matches the reference information, the length of the unit data that continuously matches can be determined. A comparing unit for recognizing and recognizing the position information indicating the start position of the matching point in the dictionary data and the length information of the matching unit data, and the matching point in the compression target data And a compression unit that replaces replacement information including position information and length information recognized by the comparison unit. 2. The comparison unit, when a matching portion is not found as a result of the search, sets one or more unit data arrays shifted from the position of the start point of the reference information as new reference information, The data compression apparatus according to claim 1, wherein the reference data is compared with the dictionary data. 3. Further comprising a similarity degree obtaining unit for obtaining the degree of similarity between the compression target data and the dictionary data by comparing the information amount before compression and the information amount after compression of the compression target data. The data compression apparatus according to claim 1, wherein the data compression apparatus is a data compression apparatus. 4. A data compression device for compressing compression target data composed of a plurality of unit data by using dictionary data composed of a plurality of unit data, wherein specific unit data in the unit data constituting the compression target data. Is used as dictionary data, reference information, which is an array of unit data at uncompressed points in the compression target data, is compared with the dictionary data to search for a matching point, and a matching point is detected as a result of the search. In this case, by comparing the unit data that follows the reference information and the unit data that is an array of unit data that constitutes the dictionary data and that is next after the array of unit data that matches the reference information, Recognizing the lengths of unit data that continuously match, and recognizing the position information indicating the start position of the matching point in the dictionary data and the length information of the matching unit data. A comparison unit, a compression unit that replaces replacement information including position information and length information recognized by the comparison unit at matching points in the compression target data, and a storage unit that stores the dictionary data. A data compression device characterized by the above. 5. The comparison unit adds an array of unit data shifted by one or more from the end point position of the dictionary data to the storage unit when no matching portion is found as a result of the search. The data compression device according to claim 4, wherein the data compression device is stored. 6. A data compression method for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, the process comprising storing the dictionary data, The process of comparing the reference information, which is an array of unit data of the uncompressed portion, with the dictionary data to search for a matching portion, and if a matching portion is detected as a result of the search, the reference information is continued next to the reference information. The length at which the unit data are consecutively matched by comparing the unit data and the unit data that is an array of the unit data that constitutes the dictionary data and that is next to the array of the unit data that matches the reference information. Recognizing the position information indicating the start position of the matching point in the dictionary data, and the length information of the matching unit data, and the compression target data. Matching location in the data compression method, characterized in that it comprises a step of replacing the replacement information including the recognized position information and length information. 7. A data compression method for compressing compression target data composed of a plurality of unit data by using dictionary data composed of a plurality of unit data, wherein specific unit data in the unit data constituting the compression target data. To make the array data into dictionary data, to store the dictionary data, and to compare the reference data, which is an array of the unit data of the uncompressed part in the data to be compressed, with the dictionary data to search for a matching part. In the process of, when a matching portion is detected as a result of the search, unit data that is continuous next to the reference information, and an array of unit data that constitutes the dictionary data, of the unit data that matches the reference information A process of recognizing the length of continuous unit data by comparing the unit data next to the sequence, and the start position of the matching point in the dictionary data A process of recognizing the position information indicated and the length information of the matching unit data, and replacing the replacement information including the position information and the length information recognized by the comparing unit at the matching position in the compression target data. A data compression method comprising the steps of: 8. A data compression program for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, the step of storing the dictionary data; Comparing the reference information, which is an array of the unit data of the uncompressed portion, with the dictionary data, and searching for a matching portion, and if a matching portion is detected as a result of the search, the reference information is continued next to the reference information. The length at which the unit data are consecutively matched by comparing the unit data and the unit data that is an array of the unit data that constitutes the dictionary data and that is next to the array of the unit data that matches the reference information. The step of recognizing the position information indicating the start position of the matching point in the dictionary data and the length information of the matching unit data. If the matching locations in the compressed data, data compression program for executing a step of replacing the replacement information including the recognized position information and length information into the computer. 9. A data compression program for compressing compression target data composed of a plurality of unit data using dictionary data composed of a plurality of unit data, wherein specific unit data in the unit data constituting the compression target data. A step of storing the dictionary data as an array data, a step of storing the dictionary data, and a reference information which is an array of unit data of an uncompressed part in the compression target data is compared with the dictionary data to search for a matching part. And, when a matching portion is detected as a result of the search, unit data that is continuous next to the reference information, and an array of unit data that constitutes the dictionary data, of unit data that matches the reference information A step of recognizing the length of continuous unit data by comparing the unit data next to the array, and the dictionary data Recognizing the position information indicating the start position of the matching point and the length information of the matching unit data, at the matching point in the compression target data, the position information and the length recognized by the comparison unit. A data compression program that causes a computer to perform the steps of substituting replacement information, including information.