SE: An algorithm for deriving sequence alignment from a pair of superimposed structures
BackgroundGenerating sequence alignments from superimposed structures is an important step in structure comparison.Many programs apply a dynamic programming algorithm to generate the sequence alignment. It is sensitive to the gap penalty used and often includes spurious gaps and misalignments. Here we present a novel algorithm, Seed Extension (SE), for deriving sequence alignment from a pair of superimposed structures.
Chin-Hsien Tai James J.Vincent Changhoon Kim Byungkook Lee
Molecular Modeling and Bioinformatics Section, Laboratory of Molecular Biology, Center for Cancer Re Molecular Modeling and Bioinformatics Section, Laboratory of Molecular Biology, Center for Cancer Re
国际会议
The 7th Asia-Pacific Bioinformatics Conference(第七届亚太生物信息学大会)
北京
英文
827
2009-01-01(万方平台首次上网日期,不代表论文的发表时间)