SANA: An algorithm for sequential and non-sequential protein structure alignment

Amino Acids

Volumn 39, Issue 2, 2010, Pages 417-425

  Wang, Lin ^a,b   Wu, Ling Yun ^b   Wang, Yong ^b   Zhang, Xiang Sun ^b   Chen, Luonan ^c  

^a TIANJIN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b CHINESE ACADEMY OF SCIENCES   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Circular permutation; Fold comparison; Functional sites; Protein structure alignment

Indexed keywords

ACCURACY; ALGORITHM; ARTICLE; BIOCOMPATIBILITY; BIOTRANSFORMATION; COMPARATIVE STUDY; COMPUTER PROGRAM; CONTROLLED STUDY; MATHEMATICAL COMPUTING; PRIORITY JOURNAL; PROCESS OPTIMIZATION; PROTEIN DATABASE; PROTEIN FOLDING; PROTEIN STRUCTURE; SEQUENCE ALIGNMENT; BIOLOGY; CHEMICAL STRUCTURE; PROCEDURES;

ALGORITHMS; COMPUTATIONAL BIOLOGY; DATABASES, PROTEIN; MODELS, MOLECULAR; SEQUENCE ALIGNMENT; SOFTWARE;

EID: 84755161848     PISSN: 09394451     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00726-009-0457-y     Document Type: Article

References (18)

1. Aung Z, Tan KL (2006) MatAlign: precise protein structure comparison by matrix alignment. J Bioinform Comput Biol 4:1197-1216
2. Bachar O, Fischer D, Nussinov R, Wolfson H (1993) A computer version based technique for 3-d sequence independent structural comparison of proteins. Protein Eng 6:279-288
3. Betancourt MR, Skolnick J (2001) Universal similarity measure for comparing protein structures. Biopolymers 59:305-309
4. Bhattacharya S, Bhattacharyya C, Chandra NR (2007) Comparison of protein structures comparison by growing neighborhood alignments. BMC Bioinformatics 8:77
5. Birzele F, Gewehr JE, Csaba G, Zimmer R (2007) Vorolign-fast structural alignment using Voronoi contacts. Bioinformatics 23: e205-e211
6. Chen L, Wu LY, Wang Y, Zhang SH, Zhang XS (2006) Revealing divergent evolution, identifying circular permutations and detecting active sites by protein structure comparison. BMC Struct Biol 6:18
7. Fischer D, Elofsson A, Rice DW, Eisenberg D (1996) Assessing the performance of fold recognition methods by means of a comprehensive benchmark. In: Proceedings of 1996 Pacific Symposium on Biocomputing, pp 300-318
8. Gazit H (1991) An optimal randomized parallel algorithm for finding connected components in a graph. SIAM J Comput 20:1046-1067
9. Holm L, Sander C (1993) Protein structure comparison by alignment of distance matrices. J Mol Biol 233:123-128
10. Krissinel E, Henrick K (2004) Secondary-structure matching (SSM), a new tool for fast protein structure alignment in three dimensions. Acta Crystallogr Sect D 60:2256-2268
11. Lo WC, Lyu PC (2008) CPSARST: an efficient circular permutation search tool applied to the detection of novel protein structural relationships. Genome Biol 9: R11
12. Mayr G, Domingues FS, Lackner P (2007) Comparative analysis of protein structure alignments. BMC Struct Biol 7:50
13. Menke M, Berger B, Cowen L (2008) Matt: local flexibility aids protein multiple structure alignment. PLoS Comput Biol 4:1-12
14. Novotny M, Madsen D, Kleywegt GJ (2004) Evaluation of protein fold comparison servers. Proteins Struct Funct Bioinform 54:260-270
15. Shatsky M, Nussinov R, Wolfson H (2004) A method for simultaneous alignment of multiple protein structures. Proteins Struct Funct Bioinform 56:143-156
16. Shindyalov IN, Bourne PE (1998) Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng 11:739-747
17. Van Walle I, Lasters I, Wyns L (2005) SABmark-a benchmark for sequence alignment that covers the entire known fold space. Bioinformatics 21:1267-1268
18. Ye Y, Godzik A (2003) Flexible structure alignment by chaining aligned fragment pairs allowing twists. Bioinformatics 19: e246-e255