Name
Abstract | ||
|---|---|---|
In this article we present a novel method for measuring protein similarity based on their tertiary structure. Our new method deals with suffix trees and classical information retrieval tasks, such as the vector space model, using tf-idf term weighing schema or using various types of similarity measures. Our goal to use the whole PDB database of known proteins, not just some kinds of selections, which have been studied in other works. For verification of our algorithm we are using comparisons with the SCOP database which is maintained primarily by humans. The next goal is to be able to categorize proteins not included in the latest version of the SCOP database with nearly 100% accuracy. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/SoCPaR.2009.101 | SoCPaR |
Keywords | Field | DocType |
new method deal,novel method,scop database,whole pdb database,latest version,next goal,known protein,protein similarity,similarity measure,classical information retrieval task,proteins,amino acids,pediatrics,indexing,clustering algorithms,tree data structures,information retrieval,similarity,vector space model,tertiary structure | Protein tertiary structure,Information retrieval,Suffix,Computer science,Tree (data structure),Search engine indexing,Artificial intelligence,Vector space model,Cluster analysis,Schema (psychology),Structural Classification of Proteins database,Machine learning | Conference |
Citations | PageRank | References |
0 | 0.34 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tomá Novosád | 1 | 0 | 0.34 |
| Václav Snáel | 2 | 37 | 10.63 |
| Ajith Abraham | 3 | 8954 | 729.23 |
| Jack Y. Yang | 4 | 902 | 175.51 |