JPH05128171A - Phylogenetic tree output device - Google Patents

Abstract

PURPOSE:To generate phylogenetic tree information in which two arrangements having maximum similarity are reconstructed into one new arrangement from a similarity matrix, to obtain the maximum similarity of each node based on the phylogenetic tree information, to generate the phylogenetic trees in order of maximum similarity and to arrange the phylogenetic trees in the ascending order of similarity so as to facilitate the recognition and comparison of them. CONSTITUTION:Phylogenetic tree information 5 is prepared by repeatedly generating new arrangement and similarity for a pair consisting of a similarity matrix 4 formed of the similarity between the arrangements preliminarily obtained and the maximum similarity in the similarity matrix 4. A larger one of the arrangement of the pair of the phylogenetic tree information 5 is obtained as maximum similarity and added to the information 5. Then the phylogenetic tree is generated in the order of maximum similarity of the added phylogenetic tree information 5 and outputted.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a system tree output device for outputting a system tree. In the field of molecular biology, it is necessary to look at the phylogenetic relationships of various genes during evolution. FIG. 14 shows an example thereof.

Graphic software must be used to graphically display a phylogenetic tree of DNA or protein sequences on a computer. However, this depends on the type of computer and software used, and therefore the display tool and its result. Is a constraint to use more widely. Therefore, it is desired to develop a method that does not easily suffer such restrictions.

[0003]

2. Description of the Related Art When a phylogenetic tree is displayed by the usual UPGMA method (Tateno: How to make and evaluate molecular phylogenetic tree, Kimura ed., Introduction to Molecular Susumu Kagaku, Baifukan, 1984), the similarity or distance value The arrangement of the branches does not increase monotonically, resulting in unevenness as shown in FIG. The method of creating a phylogenetic tree by the UPGMA method described above will be briefly described below.

(1) The maximum value of the similarity S (i, j) (i, j is the array number, 1 to N) in the similarity matrix previously obtained for the array to be displayed is Ask. At that time, S (i, j) is represented by smax, and the values of the paired array element numbers i, j are represented by imax, jmax.

(2) These two values imax, jmax
An array having N is set as an array group N + 1. By this grouping, S (i, j) with other arrays is recalculated. The similarity S (k, N +) between the k-th array and the array group N + 1 in which imax and jmax are grouped together
1) is an average value of S (k, imax) and S (k, jmax). When imax> N or jmax> N, the average value of all the similarities between the sequences included in the node is calculated.

(3) The above procedure is repeated until the final set of array groups 2N-1 is reached. As a result, imax, jmax, S (imax, jma at each step
x) is stored. When a phylogenetic tree is written using these results, it becomes like FIG. 14 (for details, refer to the above-mentioned book).

[0007]

The problem with the phylogenetic tree as shown in FIG. 14 is that the degree of similarity and distance do not increase monotonically, resulting in misalignment and inconvenience in distinguishing groups of protein sequences of genes. was there. Further, there is a problem that even in the case of displaying multiple alignment, it is inconvenient to read the values of the similarity or the distance in a group. Therefore, a method for displaying a phylogenetic tree without such irregularity is desired.

According to the present invention, phylogenetic tree information in which two sequences having the maximum similarity are converted into a new sequence from the similarity matrix, and the maximum similarity of each node is obtained based on this phylogenetic tree information. The purpose is to generate phylogenetic trees in the order of the maximum similarity and arrange them so that the similarity gradually increases so that they are easy to see and compare.

[0009]

FIG. 1 is a block diagram showing the principle of the present invention. In FIG. 1, the phylogenetic tree processing unit 2 generates phylogenetic tree information 5 based on the similarity matrix 4, obtains and adds the maximum similarity from the phylogenetic tree information 5, and adds the maximum similarity. A phylogenetic tree 6 is generated based on the phylogenetic tree information 5.

The similarity matrix 4 is a matrix in which the similarity between arrays is obtained in advance. The phylogenetic tree information 5 is created by repeatedly generating a new sequence and similarity for the pair of sequences having the maximum similarity in the similarity matrix 4, and the larger one of the paired sequences of the phylogenetic tree information 5 is generated. Is calculated and added as the maximum similarity.

The phylogenetic tree 6 is a phylogenetic tree in which the sequences generated from the phylogenetic tree information 5 are arranged in an easy-to-see manner. The output unit 3 outputs the system tree 6 to the display 7 and the printer 8.

[0012]

In the present invention, as shown in FIG. 1, the phylogenetic tree processing unit 2
Generate a new phylogenetic tree information 5 by repeatedly generating new sequences and similarities with respect to the pair of sequences having the maximum similarity in the sequence of the similarity matrix 4 obtained in advance and the phylogenetic tree information 5
The larger similarity of the paired sequences is calculated as the maximum similarity and added, and the phylogenetic tree 6 is generated in the order of the maximum similarity of the added phylogenetic tree information 5, and the output unit 3 outputs the phylogenetic tree 6 Is output (displayed, printed).

Characters of the phylogenetic tree (eg, +,-,
| Etc.) is used for output. Also, the sequence numbers and sequence names are arranged in ascending order (or descending sequence) of the maximum similarity of the phylogenetic tree information 5 with the maximum similarity added, and these sequence numbers and sequence names are output in the vertical direction Are combined to generate a graphical tree and output it graphically.

Therefore, from the similarity matrix 4, the phylogenetic tree information 5 in which the two arrays having the maximum similarity are combined into a new array is generated, and based on this phylogenetic tree information 5, the maximum similarity of each node is calculated. By obtaining and adding and generating a phylogenetic tree in the order of the maximum similarity, it is possible to arrange them so that the similarity gradually increases so that they are easy to see and compare.

[0015]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the construction and operation of an embodiment of the present invention will be sequentially described in detail with reference to FIGS.

FIG. 1 is a block diagram showing the principle of the present invention. Figure 1
In the above, the phylogenetic tree output device 1 outputs a phylogenetic tree arranged in an easy-to-read manner so that the similarity gradually increases from the similarity matrix 4 of the array obtained in advance. It is composed of the unit 3 and the like.

The phylogenetic tree processing unit 2 generates phylogenetic tree information 5 based on the similarity matrix 4, finds and adds the maximum similarity from the phylogenetic tree information 5, and adds the maximum similarity to the system. For example, a phylogenetic tree 6 is generated based on the tree information 5.

The output unit 3 outputs the system tree 6 to the display 7 and the printer 8. The similarity matrix 4 is a matrix in which the similarity between arrays is obtained in advance,
As shown in FIG. 2A, the similarity between pairs of arrays is obtained in advance and formed into a matrix.

The phylogenetic tree information 5 is repeated by generating a new sequence for the pair of sequences having the maximum similarity in the similarity matrix 4 and using the average of the similarities of the two sequences as the similarity of the new sequence. It is generated (see (b) of FIG. 2) or obtained by adding the similarity of the larger of the paired sequences of the phylogenetic tree information 5 as the maximum similarity (see FIG. 4).

The phylogenetic tree 6 is a phylogenetic tree in which the sequences generated from the phylogenetic tree information 5 are arranged in an easy-to-see manner (FIG. 9, FIG. 10, FIG. 13). The display 7 displays a phylogenetic tree.

The printer prints a tree. Next, the operation of the configuration of the first embodiment of the present invention will be sequentially and specifically described with reference to FIGS.

Here, it is assumed that N gene sequences are given and the similarity (or distance) between the i-th sequence and the j-th sequence is represented by S (i, j). Here, i, j = 1, 2 ... N. The similarity (or distance) between sequences is determined by the Needleman and Wunsch algorithm (Needleman, S, B, and Wunsch, CD, "A general method
applicable to the search for similarities in the
amino acid sequences of two proteins, J. Mol, Biol., 4
8,445-453,1970) and others.

A method of creating a phylogenetic tree by the well-known UPGMA method will be described. First, of the similarities S (i, j), the maximum value is obtained. At that time, the value of S (i, j) is smax, the value of paired array element numbers i and j is imax,
It is represented by jmax. Next these two arrays imax, jma
Let x be one array group N + 1. By this grouping, S (i, j) with other arrays is recalculated. Similarity S (k, N + 1) between the k-th array and the array group N + 1 in which imax and jmax are grouped together
Is an average value of S (k, jmax) and S (s, imax). When imax> N or jmas> N,
For the similarity between the arrays included in the node, the average value for all is calculated.

The above procedure is followed by the final set of sequence group 2
Repeat until N-1. As a result, imax, jmax, S (imax, jmax) at each step are stored. A phylogenetic tree can be drawn using these results.

FIG. 2 shows similarity matrix / phyloge tree information of the present invention. FIG. 2A shows an example of the degree of similarity in the case of 27 arrays. Here, the array name of array 1 is HBA $ AEG
MO. Arrays 2 to 27 are array names as shown. The horizontal axis represents the sequence numbers 1 to 26, and the vertical axis represents the sequence numbers 2 to 27 and the sequence names. A 4-digit number such as 1792 in the center indicates the degree of similarity. Therefore, here, it is assumed that the degree of similarity between the arrays 1 to 27 is previously obtained as shown in the figure, and the procedure for generating a phylogenetic tree from this is described below.

FIG. 2B shows an example in which the new sequence and similarity of the array element number 28 are obtained from the similarity matrix of FIG. The maximum value of the similarity is 1792 in the similarity matrix of FIG. 2A, and the array 17 and the array 3 are put together to generate the array 28. The similarity between the array 28 and the array 1 is (S (3,1) + S (17,1)) / 2 = (1660 + 1665) /2=1662.5 ...・ ・ ・ ・ ・ ・ ・ ・ ・ (1) Similarly, the degree of similarity with the arrays 2, 4, ... 37 is calculated and determined as shown in (b) of FIG.

Next, the maximum similarity is 1789 in the similarity matrix of FIG. 2B, the arrays 6 and 5 are grouped together to generate an array 29. The similarity between the array 29 and the array 1 is calculated in the same manner as in the equation (1). The same procedure is repeated thereafter. At this time, the nodes necessary for drawing the phylogenetic tree, the degree of similarity, and the children, Array 1 and Array 2, are stored here as phylogenetic tree information.

FIG. 2C shows phylogenetic tree information. This is based on the similarity matrix of FIG. 2A described above from the similarity matrix 28 of FIG.
3 stores the node, the degree of similarity, the array 1, and the array 2 at the time of obtaining 3. For example, the array 28 in FIG.
Is the maximum similarity 1792 of the similarity matrix of FIG.
The paired sequences to be combined are the sequence 3 and the sequence 17, which are the sequence 1 and the sequence 2. Therefore, as shown in the figure, the node, the similarity, the array 1, and the array 2 are
28, 1792, 3, 17 are obtained and stored as the phylogenetic tree information 5 as shown. Similarly, the following is stored as illustrated.

When a phylogenetic tree is drawn based on the phylogenetic tree information shown in FIG. 2C and the similarity matrix shown in FIG. 2A, the conventional phylogenetic tree shown in FIG. 14 is usually obtained. As described above, the similarities are not uniform and difficult to see. Therefore, in the present embodiment, the following procedure is performed in order to make the phylogenetic tree easy to see and to draw the descending order of the similarities.

FIG. 3 shows the relationship between the maximum similarity and the child according to the present invention. Here, the collected sequence groups (Fig. 3
Then, for example, in the node 48), in addition to the similarity S (i, j), a new variable, maximum similarity simmax (k) (k
= N + 1, N + 2 ... 2N-1) is defined. This means imax and jmax (node 28, 4 in FIG. 3).
3) Maximum similarity simmax (imax) of each
And simmax (jmax) are substituted. However, when jmax <N and imax <N, the maximum similarity is not yet defined, so the similarity is used as it is,
simmax (node) = S (imax, jmax)
And If jmax <N and imax> N, then sim
Let max (node) = simmax (imax). When jmax> N and imax <N, simma
Let x (node) = simmax (jmax). Then, the larger the value of simmax, the more the arrangement order within the group is displayed. That is, imax, jmax
Alternatively, the order is jmax and imax. In the example of FIG. 3, simmax (jmax)> simmax (ima
In the case of x), the order is 28, 43.

Similarly, in the example of the 27 arrays described in (a) to (c) of FIG. 2, the results shown in FIG. 4 are obtained with respect to the maximum similarity and the order of array 1 and array 2. FIG. 4 shows phylogenetic tree information of the present invention. This phylogenetic tree information 5
3 is obtained by adding the maximum similarity described with reference to FIG. 3 to the nodes 28 to 53 to the phylogenetic tree information 5 of FIG. When drawing a node using this, for example, when drawing a node 33, it is better to draw the node 31 with the largest similarity and then the node 30 with the smallest similarity. The tree will be in a shape that is easy to see in the order of desired similarity.

FIG. 5 shows an example of correspondence between basic forms of phylogenetic trees in graphic and characters. FIG. 5A shows an example of drawing a phylogenetic tree by graphics. (B) of FIG.
An example of the present embodiment in which a character tree is drawn with a character is shown. Here, as the characters used for displaying the phylogenetic tree, −, +,
Three types of | are used. If the symbol | cannot be used as in FORTRAN, then: or I may be used instead. In this way, since the tree is displayed using the characters, it is possible to easily print the tree using a normal printer.

FIG. 6 shows the relationship between level and depth. This is due to the information (ima
x, jmax, s (imax, jmax), simma
Based on x (i)), when the systematic diagram is drawn while tracing the paired array groups in the opposite direction from the last node 2N-1 (here, node 53) 2 schematically shows the relationship between two variables out of the following seven variables, level and depth. For example, as shown in the figure, the left node 53 is level
(0), and the right node4 is level (1). The depth of this level is depth = 1.

Node: number of each node level (k): node number of depth = k flg: indicates whether the node or array name is output depth: generation bar: specifies whether to output vertical bars position: Either of the two children leaf: Total number of output sequence names Next, the procedure for drawing a phylogenetic tree will be described in detail with reference to the flowchart in FIG. 7.

First, as an initial value, each node has a flag, fl.
Set up g (i) (i = 1, 2 ... 2N-1). If the two arrays have not yet been processed, enter a value of 0. Define the depth variable as the distance from the root, and enter 0 as the initial value. As a selection variable for writing the vertical bar symbol |, bar (k) (k = N, N + 1 ...
2N-1) is defined and 0 is substituted as an initial value. Defines the value level at each level, and the initial value level
Substitute 2N-1 as (0). 2N-1 is set as the initial value of the node node of interest. leaf is 0
And

(A) The following three ways (S2, S in FIG. 7) of the two children of the node node of interest
3, S4) (S1 in FIG. 7, node = 53 in FIG. 8D, the children are 4 and 52 (see FIG. 4)).

(1) When both flags flg are 0 (see FIG. 7)
Then S2): (1-1) When both child nodes are N or less,
The child with the larger number is the child 1, and the child with the smaller number is the child 2 (in the case of node 28 in FIG.
7, children 2 = 3).

(1-2) When both children's nodes are equal to or more than N, the one with smaller simmax is set to the child 1,
The larger one is the child 2 (node 52 in FIG. 8D)
, Child 1 = 47, simmax (47) = 168
4, children 2 = 51, simmax (51) = 179
2).

Set node to child 1 and position =
1 (node = 4 in (d) of FIG. 8). Add 1 to depth.

Further, if the flags flg of both children of the node are 0, the value of bar is set to 1. bar (level (depth-1)) = 1 Then, the process proceeds to (B).

(2) If the child has either flag of 1 (S3 in FIG. 7), 0 is selected as the node. p
Set the value of position to the child's number. That is, if the flag of child 1 is 0, position = 1 and the flag of child 2 is 0.
If so, position = 2.

Add 1 to the depth. Then proceed to (B). (3) If both children have flg of 1 (S4 in FIG. 7, node = 47 after outputting sequence numbers 22 and 21 in (d) of FIG. 8).

The current node (node 4 in (d) of FIG. 8)
Set the flag of 7) to 1. Subtract 1 from depth. Then, return to the node one step before (node = level (dep
th), and in FIG. 8D, node = 52).

If the flag of the second descendant of the node (node 51 in FIG. 8 (d)) is 0, and child 1 (FIG. 8).
In (d), when the flag of node 47) is 1, k = 2N
-1, 2N-2 ... For node-1, bar
If (k) = 0, write a blank, and if bar (k) = 1, write a vertical bar and a blank (S5 in FIG. 7).

Then, the procedure returns to the beginning (A) of the procedure. (B) Next, level (depth) = node is set. Depending on the value of node, proceed to either of the following.

(1) If node> N (see FIG. 7)
Then S6), write the + sign. If level (dep
th-1) -node-1> 1, if the number of values
Write ---- (S7 in Fig. 7).

Then, write the node number. If po
If position = 2, bar (level (dep
th-1)) = 0.

(2) If node <N (see FIG. 7)
Then S8), write the + sign. level (depth-
1) Write N --- pieces. Write the node number and array name.
A line feed is made (S8 in FIG. 7).

If position = 2, bar (l
It is set as (ever (depth-1)) = 0. Set the flag of this node to 1.

Increase the number of leaves by one. De next node
Set to pth-1. If position = 1, d
If ept> 1, write 2N-1-node + 1 blanks or | (S10 in FIG. 7).

Subtract 1 from the value of depth. If the number of leaves is N or less, the process returns to the beginning (A) of the procedure. If N, the procedure ends.

By writing the output results obtained by the above procedure in reverse order from the last line, a desired phylogenetic tree can be obtained. Next, a specific description will be given with reference to FIGS.

In the example of the 27 arrays described above (FIG. 4),
Start at node 53. 53 is output. For (A), the children are 4 and 52 from FIG. 4 (S in FIG. 7).
1). In both cases, the flag flg is still 0 (S in FIG. 7).
2). node = 4, position = 1, depth =
If the value is 1, proceed to (B). Let level (1) = 4. Since 4 <N = 27 (S8 in FIG. 7), + is output (S9 in FIG. 7). level (depth-1) -N =
53-27 pieces of --- are output (S9 in FIG. 7). The array number and array name are output and a line feed is performed (S9 in FIG. 7). Flg = 1 is set for SEQ ID NO: 4 (S9 in FIG. 7). Since the array 4 has been output, the lower leaf (leaf) is set to 1. By the procedure up to this point, the output result of (a) in FIG. 8 is obtained.

Node = level (depth-1)
= 53. Subtract 1 from depth. The process returns to (A) (S10 is not executed). One child of node 53
Since the flag flg of (SEQ ID NO: 4) is 1 (S6 in FIG. 7),
From (2) of (A), node = 52, position
= 2 and depth = 1, the process proceeds to (B). node
Since = 52> N = 27 (S6 in FIG. 7), + is output and the node number 52 is output (S7 in FIG. 7). postiti
Since on = 2, bar (53) = 0 is set. Return to (A).

The flg of the node 52 and the children 47 and 51 is 0.
(S2 in FIG. 7). From (1-2) of (1) of (A), a node 47 having a small simmax is set as a child 1. Proceeding to S6 and S7 in FIG. 7, +,-, and 47 are output.

Returning to (A), children 22 and 2 of node 47
The flg of 1 is 0 (S2 in FIG. 7). (1) of (A)
The node 22 having a larger number from (1-1) in FIG. Since 22 <N = 27, +,-, the array element number and the array name are output (S9 in FIG. 7). Sequence 22 is a positioni
Since on = 1 and depth = 2> 1, blank and vertical bar | are output (S10 in FIG. 7). Subtract 1 from depth and return to (A). By the procedure up to this point, the output result of (b) in FIG. 8 is obtained.

There are now 47 nodes. Child 2 array 2
Since the process of 1 is not done yet (S3 in FIG. 7), execute it,
Up to 21 array names are output (S8 and S9 in FIG. 7). Also, the process returns to the node 47 one generation before. Subtract 1 from depth. Return to (A). At this point, both children of the node 47 have flg = 1 (S4 in FIG. 7), and the process returns to the node 52 one generation before. Here, the child 1 of the node 52 has flg = 1.
Since child 2 has flg = 0, it outputs the necessary number of blanks (S5 in FIG. 7). Returning to (A), the child 1 of the node 52 has flg = 1 and the child 2 (node 51) has flg = 0 (S3 in FIG. 7), and the process proceeds to (B). The + and the node number are output for the node 51 (S6 and S7 in FIG. 7). By the procedure up to this point, the output result of FIG. 8C is obtained.

The procedure described above is then advanced to +,-, |,
The node number and array name are output. After all, the number of leaves (l
When eaf) becomes 27, a phylogenetic tree as shown in (d) of FIG. 8 is obtained.

In the systematic diagram by the character (d) of FIG. 8, since the output is made from the sequence pair having a low degree of similarity, the systematic tree output from the sequence pair having a high degree of similarity can be drawn by reversing this. The phylogenetic tree of FIG. 9 can be obtained.

FIG. 9 shows an example of representation of a phylogenetic tree by the character of the present invention. This is shown in FIG.
This is a phylogenetic tree that was drawn in reverse from the one obtained in (d) and output from the pair of sequences with high similarity. Here, three types of characters, +,-, and | are used, but other types (for example,:, I) may be used. Also for drawing branches--
The number of --may be changed arbitrarily. A phylogenetic tree may be drawn without entering the node number.

FIG. 10 shows an example of representation of a phylogenetic tree by another character of the present invention. This is an example of composition with the result of multiple alignment, and has different sequence data and similarity values from those in FIG. 9.

Next, the configuration and operation of another embodiment will be described in detail with reference to FIGS. 11 to 13. (1) An example in which a phylogenetic tree is graphically displayed by using the above-described maximum similarity and the information about the order of the array 1 and the array 2 resulting therefrom is shown. In the case of 27 arrays, first, FIG.
Therefore, the node 53 is the order of the node 52 and the node 4. Further, the node 52 is the order of the node 51 and the node 47. When the array order is expanded to the node 28 and traced below, the array order of the entire 27 lines is 3, 17, 5, 6, 1.
8, 7, 16, 8, 1, 11, 9, 12, 13, 24,
25, 26, 27, 19, 14, 15, 2, 20, 2
It becomes 3, 10, 21, 22, and 4. Therefore, in this order, the array number and the array name are vertically shifted by a unit length and drawn as a graphic output (S2 in FIG. 11).
1, 21 in FIG. 12).

(2) Next, the child is joined from the node 28 in FIG. Since the children of the node 28 are 3 and 17 (S22 of FIG. 11 and S22 of FIG. 12), the result is as shown in FIG. Here, the horizontal length of the branch is determined from the similarity. Similarly, the children of the next node 29 are also combined, as shown in FIG. When the children are connected to the node 53 in the same manner, a phylogenetic tree as shown in FIG. 13 can be drawn.

[0064]

As described above, according to the present invention,
From the similarity matrix 4, the two arrays with the maximum similarity are added to the new 1
Generating the phylogenetic tree information 5 in one array, finding the maximum similarity of each node based on this phylogenetic tree information 5 and adding it, the phylogenetic tree is generated in the order of this maximum similarity. Therefore, it is possible to draw phylogenetic trees that are easy to see and compare by arranging them so that the similarity gradually increases. As a result, (1) it is possible to draw a phylogenetic tree that is easy to see from the value of similarity (or distance).

(2) Character display / printing enables use in a wide range of computers without being affected by graphics software. (3) Displaying / printing side by side with multiple alignment helps to understand the alignment result.

[Brief description of drawings]

FIG. 1 is a principle configuration diagram of the present invention.

FIG. 2 is similarity matrix / phyloge tree information of the present invention.

FIG. 3 is a relationship diagram between the maximum similarity and the child according to the present invention.

FIG. 4 is phylogenetic tree information of the present invention.

FIG. 5 is an example of correspondence between basic forms of a phylogenetic tree in graphics and characters.

FIG. 6 is a relationship diagram between level and depth.

FIG. 7 is a flowchart for explaining the operation of the present invention.

FIG. 8 is an example of representation of a phylogenetic tree by the character of the present invention.

FIG. 9 is an example of representation of a phylogenetic tree by the character of the present invention.

FIG. 10 is a representation example of a phylogenetic tree by another character of the present invention.

FIG. 11 is a procedure for drawing a phylogenetic tree with another graphic according to the present invention.

FIG. 12 is an explanatory diagram of another embodiment of the present invention.

FIG. 13 is another phylogenetic tree of the present invention.

FIG. 14 is an example of a conventional phylogenetic tree.

[Explanation of symbols]

 1: Phylogenetic tree output device 2: Phylogenetic tree processing unit 3: Output unit 4: Similarity matrix 5: Phylogenetic tree information 6: Phylogenetic tree 7: Display 8: Printer

Claims (3)

[Claims] 1. A phylogenetic tree output device for outputting a phylogenetic tree, comprising: a similarity matrix (4) which is a matrix in which the similarity between arrays is obtained in advance; and a maximum similarity of the similarity matrix (4). Repeating the generation of new sequences and similarities for the paired sequences,
The similarity of the created phylogenetic tree information (5) and the larger of the paired sequences of the phylogenetic tree information (5) is obtained as the maximum similarity, and is added to the phylogenetic tree information (5). A phylogenetic tree output device configured to generate and output a phylogenetic tree in the order of maximum similarity of the phylogenetic tree information (5). 2. A phylogenetic tree is sequentially displayed in the order of maximum similarity of the added phylogenetic tree information (5) as characters (for example, +, −, |
And the like) are used to output the system tree output device according to claim 1. 3. The sequence numbers and sequence names are arranged by expanding the added phylogenetic tree information (5) in ascending order (or descending order) of the maximum similarity, and outputting these sequence numbers and sequence names in the vertical direction.
2. The phylogenetic tree output device according to claim 1, wherein the phylogenetic tree is configured so that a child is connected to these and the phylogenetic tree is graphically generated and output.