Work

Research on global double sequence alignment optimization algorithm based on dynamic programming

Year: 2022

Type: conference-paper

Abstract: Biological sequence alignment is one of the most basic research topics in bioinformatics. The double sequence alignment algorithm based on dynamic programming mainly uses iterative algorithm and vacancy penalty rules to compare gene sequences one by one, calculate their similarity scores, and finally obtain the best alignment between sequences through backtracking analysis. This paper studies the analysis and implementation of the global double sequence alignment optimization algorithm based on dynamic programming.

Source: International Conference on Computer Science and Communication Technology (ICCSCT)

DOI: 10.1117/12.2662630

Author: yuanzi he

Institution: Guangdong University of Science and Technology

Language: English

Topic: Genomics and Phylogenetic Studies

Subfield: Molecular Biology

Field: Biochemistry, Genetics and Molecular Biology

Domain: Life Sciences

Open Access status: bronze

Funder: Guangdong University of Science and Technology

OpenAlex ID: W4313219766