PSIST: Indexing protein structures using suffix trees

Proceedings - 2005 IEEE Computational Systems Bioinformatics Conference, CSB 2005

Volumn 2005, Issue , 2005, Pages 212-222

  Gao, Feng ^a   Zaki, Mohammed J ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; DATABASE SYSTEMS; FUNCTION EVALUATION; MOLECULAR STRUCTURE; TREES (MATHEMATICS); VECTORS;

DRUG DISCOVERY; FUNCTION PREDICTION; PROTEIN STRUCTURES; SUFFIX TREES;

PROTEINS;

PROTEIN;

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; CHEMISTRY; COMPUTER PROGRAM; EVALUATION; INFORMATION RETRIEVAL; METHODOLOGY; MOLECULAR GENETICS; PROTEIN CONFORMATION; PROTEIN DATABASE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS; ULTRASTRUCTURE;

ALGORITHMS; AMINO ACID SEQUENCE; DATABASES, PROTEIN; INFORMATION STORAGE AND RETRIEVAL; MOLECULAR SEQUENCE DATA; PROTEIN CONFORMATION; PROTEINS; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, PROTEIN; SOFTWARE;

EID: 33745485860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2005.46     Document Type: Conference Paper

References (29)

1. S. Altschul, T. Madden, J. Zhang, Z. Zhang, W. Miller, and D. Lipman. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research, 25(17):3389-3402, 1997.
2. Z. Aung, W. Fu, and K. Tan. An efficient index-based protein structure database searching method. Intl. Conf. on Database Systems for Advanced Applications (DASFAA), pages 311-318, 2003.
3. A. Bhattacharya, T. Can, T. Kahveci, A. Singh, and Y. Wang. Progress: Simultaneous searching of protein databases by sequence and structure. Pacific Symp. Bioinformatics (PSB), pages 264-275, 2004.
4. T. Can and Y. Wang. CTSS: a robust and efficient method for protein structure alignment based on local geometrical and biological features. IEEE Computer Society Bioinformatics Conference (CSB), pages 169-179, 2003.
5. O. Çamoǧlu, T. Kahveci, and A. Singh. Towards index-based similarity search for protein structure databases. IEEE Computer Society Bioinformatics Conference (CSB), pages 148-158, 2003.
6. I. Choi, J. Kwon, and S. Kim. Local feature frequency profile: A method to measure structural similarity in proteins. Proc. Natl. Acad. Sci, 101(11):3797-3802, 2004.
7. A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White, and S. Salzberg. Alignment of whole genomes. Nucleic Acid Research, 27(11):2369-2376, 1999.
8. A. Delcher, A. Phillippy, J. Carlton, and S. Salzberg. Fast algorithms for large-scale genome alignment and comparison. Nucleic Acid Research, 30(11):2478-2483, 2002.
9. O. Dror, H. Benyamini, R. Nussinov, and H. Wolfson. MASS: Multiple structural alignment by secondary structures. Bioinformatics, 19(12):95-104, 2003.
10. I. Eidhammer, I. Jonassen, and W. Taylor. Structure comparison and structure patterns. J. Comp. Bio., 7(5):685-716, 2000.
11. D. Gusfield. Algorithms on strings, trees, and sequences: Computer science and computational biology. Cambridge University Press, New York, 1997.
12. L. Holm and C. Sander. Protein structure comparison by alignment of distance matrices. J. Mol Biol, 233:123-138, 1993.
13. L. Holm and C. Sander. 3-d lookup: fast protein structure database searches at 90% reliability. Intl. Conf. on Intelligent Systems for Molecular Biology (ISMB), pages 179-187, 1995.
14. E. Hunt, M. Atkinson, and R. Irving. Database indexing for large dna and prtein sequence collections. Int. Conf. on Very Large Data Bases (VLDB), pages 256-271, 2003.
15. Y. Lamdan and H. Wolfson. Geometric hashing: a general and efficient model-based recognition scheme. Intl. Conf. on Computer Vision (ICCV), pages 238-249, 1988.
16. T. Madej, J. Gibrat, and S. Bryant. Threading a database of protein cores. Proteins, 23:356-369, 1995.
17. E. McCreight. A space-economic suffix tree construction algorithm. Journal of the Association for Computing Machinery, 23(2):262-272, 1976.
18. C. Meek, J. Patel, and S. Kasetty. Oasis: An online and accurate technique for local-alignment searches on biological sequences. Int. Conf. on Very Large Data Bases (VLDB), pages 910-923, 2003.
19. K. Mizoguchi and N. Go. Comparison of spatial arrangements of secondary structural elements in proteins. Protein Eng., 8:353-362, 1995.
20. A. Murzin, S. Brenner, T. Hubbard, and C. Chothia. SCOP: a structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol., 247:536-540, 1995.
21. R. Nussinov, N. Leibowit, and H. Wolfson. MUSTA: a general, efficient, automated method for multiple structure alignment and detection of common motifs: Application to proteins. J. Comp. Bio., 8(2):93-121, 2001.
22. C. Orengo and W. Taylor. SSAP: Sequential structure alignment program for protein structure comparisons. Methods in Enzymol., 266:617-634, 1996.
23. W. R. Pearson and D. J. Lipman. Improved tools for biological sequence comparison. Proc. Natl. Acad. Sci., 85:2444-2448, 1988.
24. B. Rost. Twilight zone of protein sequence alignments. Protein Eng., 12(2):85-94, 1999.
25. M. Shatsky, R. Nussinov, and H. Wolfson. Multiprot - a multiple protein structural alignment algorithm. Proteins, 56:143-156, 2004.
26. I. Shindyalov and P. Bourne. Protein structure alignment by incremental combinatorial extension(ce) of the optimal path. Protein Eng., 11(9):739-747, 1998.
27. F. Smith and M. Waterman. Identification of common molecular subsequences. J. Mol. Biol., (147):195-197, 1981.
28. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
29. X. Yuan and C. Bystroff. Non-sequential structure-based alignments reveal topology-independent core packing arrangements in proteins. Bioinformatics, Advance Access published online, Nov. 2004.