A computer-implemented method for correcting test sequences characterized in that the method comprises the steps of: receiving test sequences, and dividing each received test sequence into short strings with a preset length on the basis of one-base-by-one-base; configuring a high frequency short string list based on the divided short strings, wherein the high frequency short string list consists of short strings with a frequency of occurrence larger than a preset high frequency threshold value; traversing each received test sequence, and searching for an area [s1, s2] with the largest number of continuous high frequency short strings on each test sequence in combination with the high frequency short string list, wherein s1, s2 are respectively the numbers of the starting base and of the ending base of the searched area with the largest number of continuous high frequency short strings; taking a sequence with the length of n-1 starting from the s1-th base of the corresponding test sequence as a root node of a tree, and configuring a left side tree having the depth of s1 with four types of bases A, C, G, T as the leaves of each node; traversing the left side tree, searching for a path that consists solely of high frequency short strings, and configuring a left sequence that consists solely of high frequency short strings from a leaf node along the path upwardly; taking a sequence with the length of n-1 starting from the s2-th base of the corresponding test sequence as a root node of a tree, and configuring a right side tree having the depth of 1 n -(s2-1) with four types of bases A, C, G, T as the leaves of each node; traversing the right side tree, searching for a path consisting of high frequency short strings, and configuring a right sequence consisting solely of high frequency short strings from the root node along the path downwardly, wherein s1, s2 are respectively the numbers of the starting base and the ending base of the searched area with the largest number of continuous high frequency short strings apart from the first base of the corresponding test sequence, n is the base length of the high frequency short strings, and 1 n is the base length of the corresponding test sequence; and recovering corresponding test sequence according to the left sequence and/or right sequence and the area with the largest number of continuous high frequency short strings, by adding the obtained left sequence at the left side of the corresponding longest high frequency sequence or adding the obtained right sequence at the right side of the corresponding longest high frequency sequence. receiving test sequences, and dividing each received test sequence into short strings with a preset length on the basis of one-base-by-one-base; configuring a high frequency short string list based on the divided short strings, wherein the high frequency short string list consists of short strings with a frequency of occurrence larger than a preset high frequency threshold value; traversing each received test sequence, and searching for an area [s1, s2] with the largest number of continuous high frequency short strings on each test sequence in combination with the high frequency short string list, wherein s1, s2 are respectively the numbers of the starting base and of the ending base of the searched area with the largest number of continuous high frequency short strings; taking a sequence with the length of n-1 starting from the s1-th base of the corresponding test sequence as a root node of a tree, and configuring a left side tree having the depth of s1 with four types of bases A, C, G, T as the leaves of each node; traversing the left side tree, searching for a path that consists solely of high frequency short strings, and configuring a left sequence that consists solely of high frequency short strings from a leaf node along the path upwardly; taking a sequence with the length of n-1 starting from the s2-th base of the corresponding test sequence as a root node of a tree, and configuring a right side tree having the depth of 1 n -(s2-1) with four types of bases A, C, G, T as the leaves of each node; traversing the right side tree, searching for a path consisting of high frequency short strings, and configuring a right sequence consisting solely of high frequency short strings from the root node along the path downwardly, wherein s1, s2 are respectively the numbers of the starting base and the ending base of the searched area with the largest number of continuous high frequency short strings apart from the first base of the corresponding test sequence, n is the base length of the high frequency short strings, and 1 n is the base length of the corresponding test sequence; and recovering corresponding test sequence according to the left sequence and/or right sequence and the area with the largest number of continuous high frequency short strings, by adding the obtained left sequence at the left side of the corresponding longest high frequency sequence or adding the obtained right sequence at the right side of the corresponding longest high frequency sequence.