title: Rapid protein fragment search using hash functions based on the Fourier transform.
abstract: BACKGROUND
  Since the protein structure database has been growing very rapidly in recent years, the development of efficient methods for searching for similar structures is very important.
  
  
  RESULTS
  This paper presents a novel method for searching for similar fragments of proteins. In this method, a hash vector (a vector of real numbers) is associated with each fixed-length fragment of three-dimensional protein structure. Each vector consists of low-frequency components of the Fourier-like spectrum for the distances between C alpha atoms and the centroid. Then, we can analyze the similarity between fragments by evaluating the difference between hash vectors. The novel aspect of the method is that the following property is proved theoretically: if the root mean square distance between two fragments is small, then the distance between the hash vectors is small. Several variants of this method were compared with a naive method and a previous method using PDB data. The results show that the fastest one among the variants is 18-80 times faster than the naive method, and 3-10 times faster than the previous method.
authors.affiliation: Human Genome Center, University of Tokyo, Japan. takutsu@ims.u-tokyo.ac.jp
authors.forename: T
authors.initials: T
authors.lastname: Akutsu
authors.forename: K
authors.initials: K
authors.lastname: Onizuka
authors.forename: M
authors.initials: M
authors.lastname: Ishikawa
mesh_terms: D000465:Algorithms; D003201:Computers; D016208:Databases, Factual; D005069:Evaluation Studies as Topic; D005583:Fourier Analysis; D010446:Peptide Fragments / Q000737:chemistry / Q000235:genetics; D011506:Proteins / Q000737:chemistry* / Q000235:genetics; D016415:Sequence Alignment / Q000379:methods* / Q000706:statistics & numerical data
chemical_list: D010446:Peptide Fragments; D011506:Proteins