2011•Jisuanji gongchengRequires access

Pairwise Sequences Search and Alignment Algorithm Based on Boolean Logic

Kang Ji-chang

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Computer science, Pairwise comparison, Subsequence, Longest common subsequence problem, Multiple sequence alignment, Algorithm, Sequence (biology), Dynamic programming

Related papers

Back to paper searchBrowse research topicsOriginal source
Pairwise Sequences Search and Alignment Algorithm Based on Boolean Logic — Research Paper | ScholarLens