Pairwise Sequences Search and Alignment Algorithm Based on Boolean Logic
Kang Ji-chang
Abstract
Kang Ji-chang
Abstract
Traditional pairwise sequences alignment algorithms are mostly based on dynamic programming,there are some problems when using dynamic programming to align for its slow speed and low accuracy.Pairwise sequences search and alignment algorithm based on Boolean logic is proposed in this paper.The algorithm searches homologous regions in the pairwise sequence using a fixed-length base fragment in one sequence,and performs the alignment between the homologous regions at once,including the alignment of the bases in the homologous regions and the alignment between the subsequence and the other sequence.It also makes use of concurrent execution mechanism to realize the parallel speed up.Simulation experimental results show that the algorithm has higer real-time and accuracy.
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.
Traditional pairwise sequences alignment algorithms are mostly based on dynamic programming,there are some problems when using dynamic programming to align for its slow speed and low accuracy.Pairwise sequences search and alignment algorithm based on Boolean logic is proposed in this paper.The algorithm searches homologous regions in the pairwise sequence using a fixed-length base fragment in one sequence,and performs the alignment between the homologous regions at once,including the alignment of the bases in the homologous regions and the alignment between the subsequence and the other sequence.It also makes use of concurrent execution mechanism to realize the parallel speed up.Simulation experimental results show that the algorithm has higer real-time and accuracy.
Key concepts: Computer science, Pairwise comparison, Subsequence, Longest common subsequence problem, Multiple sequence alignment, Algorithm, Sequence (biology), Dynamic programming