Bejerano et al, Bioninformatics 17 (10), 927 (2001).* |
Gerstein, M., “Measurements of the effectiveness of transitive sequences comparison, through a third ‘intermediate’ sequence,” Bioinformatics, 14(8):707-717 (1998). |
Altschul et al., “Basic Local Alignment Search Tool,” J. Mol. Biol., 215:403-410 (1990). |
Altschul et al., “Gapped BLAST and PSI-BLAST: a new generation of protein database search programs,” Nucleic Acids Res., 25(17):3389-3402 (1997). |
Apweiler et al., “Proteome Analysis Database: online application of InterPro and CluSTr for the functional classification of proteins in whole genomes,” Nucleic Acids Res., 29(1)44-48 (2001). |
Attwood et al., “PRINTS and PRINTS-S shed light on protein ancestry,” Nucleic Acids Res., 30(1)239-241 (2002). |
Bateman et al., “The Pfam Protein Families Database,” Nucleic Acids Res., 30(1):276-280 (2002). |
Bolten et al., “Clustering protein sequences-structure prediction by transitive homology,”Bioinformatics, 17(10):935-941 (2001). |
Böhm, “The Computer Program LUDI: A New Method for the De Novo Design of Enzyme Inhibitors,” J. Comp. Aided Mol. Des., 6:61-78 (1992). |
Carugo and Argos, “NADP-dependent Enzymes. I: Conserved Sterochemistry of Cofactor Binding,” Proteins: Struc., Funct., Genet., 28:10-28 (1997). |
Corpet et al;., “ProDom and ProDom-CG: tools for protein domain analysis and whole genom comparisons,” Nucleic Acids Res., 28(1):267-269 (2000). |
Henikoff et al., “Increased coverage of protein families with the Blocks Database servers,” Nucleic Acids Res., 28(1):228-230 (2000). |
Hofmann et al., “The PROSITE database, its status in 1999,” Nucleic Acids Res., 27(1):215-219 (1999). |
Jarvis and Partick,“Clustering Using a Similarity Measure Based on Shared Near Neighbors,” IEEE Trans. Comp., 22(11):1025-1034 (1973). |
Manley, “Multivariate Statistical Methods, a Primer,” Chapman Hall Chapter 8:100-113 (1994). |
Murzin et al., “SCOP: A Structural Classification of Proteins Database for the Investigation of Sequences and Structures,” J. Mol. Biol., 247:536-540 (1995). |
Needleman and Wunsch, “A General Method and Applicable to the Search for Similarites in the Amino Acid Sequence of Two Proteins,” J. Mol. Biol., 48:443-453 (1970). |
Nicholas et al., “Strategies for Searching Sequence Database,” BioTechniques, 28:1174-1191 (2000). |
Pearson and Lipman, “Improved Tools for Biological Sequence Comparison,” Proc. Natl. Acad. Sci. USA, 85:2444-2448 (1988). |
{haeck over (S)}ali and Blundell, “Comparative Protein Modelling by Satisfaction of Spatial Restraints,” J. Mol. Biol., 234:779-815 (1993). |
Schnur, “Design and Diveristy Analysis of Large Combinatorial Libraries Using Cell-Based Methods,” J. Chem. Inf. Comput. Sci., 39:36-45 (1999). |
Sellers, “On the Theory and Computation of Evolutionary Distances,” J. Appl. Math., 26(4):787-793 (1974). |
Sellers, “Pattern Recognition in Genetic Sequences,” Proc. Natl. Acad. Sci. USA, 76(7):3041 (1979). |
Smith and Waterman, “Identification of Common Molecular Subsequences,” J. Mol. Biol., 147:195-197 (1981). |
Tatusova and Madden, “BLAST 2 Sequences, A New Tool for Comparing Protein and Nucleotide Sequences,” FEMS Microbiol. Lett., 174:247-250 (1999). |
Waterman and Eggert, “A New Algorithm for Best Subsequence Alignments with Application to tRNA-rRNA Comparisons,” J. Mol. Biol., 197:723-728 (1987). |
Worley et al., “Beauty-X: enhanced BLAST searches for DNA queries,” Bioinformatics, 14(10):890-891 (1998). |