A Method for Fast Approximate Searching of Polypeptide Structures in the PDB

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-53, Issue , 2004, Pages 65-74

  Täubig, Hanjo ^a   Buchner, Arno ^a   Griebsch, Jan ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

database index; dihedral angle; generalized suffix tree; protein structure

Indexed keywords

FORESTRY; PROTEINS; QUERY PROCESSING; TREES (MATHEMATICS);

APPROXIMATE SEARCHING; DATABASE INDEX; GENERALIZED SUFFIX TREE; INVARIANT REPRESENTATION; POLYPEPTIDE STRUCTURES; PROTEINS STRUCTURES; ROTATION INVARIANT; STRUCTURAL DATABASE; SUFFIX-TREES; TRANSLATION INVARIANTS;

DIHEDRAL ANGLE;

EID: 85134561091     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. [AT04] Aung, Z. and Tan, K.-L.: Rapid 3D protein structure database searching using information retrieval techniques. Bioinformatics. 20(7):1045–1052. May 2004.
2. [BT99] Branden, C. and Tooze, J.: Introduction to Protein Structure. Garland Publishing. New York. second. 1999.
3. +00] Berman, H. M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T. N., Weissig, H., Shindyalov, I. N., and Bourne, P. E.: The protein data bank. Nucleic Acids Research. 28(1):235–242. 2000.
4. [CHKK99] Chew, L. P., Huttenlocher, D., Kedem, K., and Kleinberg, J.: Fast detection of common geometric substructure in proteins. In: Proc. 3rd Conf. on Research in Computational Molecular Biology (RECOMB’99). pp. 104–113. ACM Press. April 1999.
5. [EJT99] Eidhammer, I., Jonassen, I., and Taylor, W. R.: Structure comparison and structure patterns. Technical Report 174. Department of Informatics, University of Bergen. Bergen, Norway. July 1999.
6. [GK97] Giegerich, R. and Kurtz, S.: From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica. 19(3):331–353. November 1997.
7. [GMB96] Gibrat, J.-F., Madej, T., and Bryant, S. H.: Surprising similarities in structure comparison. Current Opinion in Structural Biology. 6(3):377–385. June 1996.
8. [Gu97] Gusfield, D.: Algorithms on Strings, Trees, and Sequences – Computer Science and Computational Biology. Cambridge University Press. 1997.
9. [HAI02] Hunt, E., Atkinson, M. P., and Irving, R. W.: Database indexing for large DNA and protein sequence collections. The VLDB Journal. 11:256–271. 2002.
10. [HS94] Holm, L. and Sander, C.: Searching protein structure databases has come of age. Proteins: Structure, Function, and Genetics. 19(3):165–173. July 1994.
11. [KL97] Koch, I. and Lengauer, T.: Detection of distant structural similarities in a set of proteins using a fast graph-based method. In: Proc. of the 5th Int. Conf. on Intelligent Systems for Molecular Biology (ISMB’97). pp. 167–178. AAAI Press. June 1997.
12. [Kl99] Kleywegt, G. J.: Recognition of spatial motifs in protein structures. Journal of Molecular Biology. 285(4):1887–1897. January 1999.
13. [KLW96] Koch, I., Lengauer, T., and Wanke, E.: An algorithm for finding maximal common subtopologies in a set of protein structures. J. Comp. Biology. 3(2):289–306. 1996.
14. [KMR72] Karp, R. M., Miller, R. E., and Rosenberg, A. L.: Rapid identification of repeated patterns in strings, trees and arrays. In: Proc. 4th Symp. on Theory of Computing (STOC’72). pp. 125–136. ACM Press. May 1972.
15. [LNW01] Leibowitz, N., Nussinov, R., and Wolfson, H. J.: MUSTA - a general, efficient, automated method for multiple structure alignment and detection of common motifs: Application to proteins. Journal of Computational Biology. 8(2):93–121. April 2001.
16. [Ma00] Martin, A. C.: The ups and downs of protein topology; rapid comparison of protein structure. Protein Engineering. 13(12):829–837. December 2000.
17. [Ma04] Maaß, M.: Average-case analysis of approximate trie search. In: Proc. 15th Symp. on Combinatorial Pattern Matching (CPM’04). volume 3109 of LNCS. pp. 472–483. Springer. July 2004.
18. [MBHC95] Murzin, A. G., Brenner, S. E., Hubbard, T., and Chothia, C.: SCOP: A structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology. 247(4):536–540. 1995.
19. [SB98] Shindyalov, I. N. and Bourne, P. E.: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering. 11(9):739–747. September 1998.
20. +02] Sigrist, C. J., Cerutti, L., Hulo, N., Gattiker, A., Falquet, L., Pagni, M., Bairoch, A., and Bucher, P.: PROSITE: A documented database using patterns and profiles as motif descriptors. Briefings in Bioinformatics. 3(3):265–274. September 2002.
21. [SVPS95] Sagot, M.-F., Viari, A., Pothier, J., and Soldano, H.: Finding flexible patterns in a text – an application to 3d molecular matching. Computer Applications in the Biosciences. 11(1):59–70. February 1995.
22. [Uk93] Ukkonen, E.: Approximate string-matching over suffix trees. In: Proc. 4th Symp. on Combinatorial Pattern Matching (CPM’93). volume 684 of LNCS. pp. 228–242. Springer. June 1993.
23. [Uk95] Ukkonen, E.: On-line construction of suffix trees. Algorithmica. 14(3):249–260. 1995.
24. [WKHK03] Weskamp, N., Kuhn, D., Hüllermeier, E., and Klebe, G.: Efficient similarity search in protein structure databases: Improving clique-detection through clique hashing. In: Proc. of the German Conference on Bioinformatics (GCB’03). volume I. pp. 179–184. October 2003.