Biology CS5238 Combinatorial methods in bioinformatics 2004/2005 Semester 1 Lecture 8: Finding structural similarities among proteins (II) Lecturer: Prof Jean-Claude Latombe Scribe: Cheng ki Kan, Lee Pern Chern and Moritz Buck 1 Voting scheme with cut table Many-to-many comparisons are evaluated when we align protein structures. In order to banish repetition, a better organization of computation is necessary. This could be achieved by pre-computing the indexes of proteins and arranging them in a hashish table. Then, queries are evaluated make on a voting scheme using the hash table. This voting scheme replaces the seed generation process.
In this lecture, we go out into the voting scheme used in 3dSEARCH [2]. The algorithm is pitch on the concept of geometric hashing [1] developed in the past period of computer vision. The basic idea is to represent alone lowly structure elements (SSEs) from all tar puff proteins with a large, exceedingly unnecessary hash (or index) table. Once the table ...If you want to get a full essay, order it on our website:
OrderCustomPaper.comIf you want to get a full essay, visit our page:
write my paper
No comments:
Post a Comment