Pairwise Sequence Alignment Based on High-segment Pairs
Guolong Chen
Abstract
Guolong Chen
Abstract
The traditional algorithm for pairwise sequence alignment has the high complexity of time and space.Based on the dynamic programming alignment algorithm,high-segment pairs,divide and conquer are introduced.Furthermore,a new alignment algorithm called SPDCA is deduced.Simulation results show that the algorithm lower pairwise sequence alignment algorithm's requirement of time and space,that it can help find the subtle similarity between pairwise sequences,and thus that it is applicable to the search of sequence database similarity.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The traditional algorithm for pairwise sequence alignment has the high complexity of time and space.Based on the dynamic programming alignment algorithm,high-segment pairs,divide and conquer are introduced.Furthermore,a new alignment algorithm called SPDCA is deduced.Simulation results show that the algorithm lower pairwise sequence alignment algorithm's requirement of time and space,that it can help find the subtle similarity between pairwise sequences,and thus that it is applicable to the search of sequence database similarity.
Key concepts: Pairwise comparison, Sequence (biology), Similarity (geometry), Multiple sequence alignment, Alignment-free sequence analysis, Dynamic programming, Structural alignment, Computer science