2007•Journal of Jimei UniversityRequires access

Pairwise Sequence Alignment Based on High-segment Pairs

Guolong Chen

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

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

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Pairwise Sequence Alignment Based on High-segment Pairs — Research Paper | ScholarLens