Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/14734
DC FieldValue
dc.titleFinding all maximal common substructures in proteins
dc.contributor.authorYAO ZHEN
dc.date.accessioned2010-04-08T10:46:13Z
dc.date.available2010-04-08T10:46:13Z
dc.date.issued2005-08-17
dc.identifier.citationYAO ZHEN (2005-08-17). Finding all maximal common substructures in proteins. ScholarBank@NUS Repository.
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/14734
dc.description.abstractFinding the common substructures shared by two proteins is considered as one ofthe central issues in computational biology due to its usefulness in understandingstructure-function relationship and application in drug and vaccine design. Unlikethe structural alignment problem, a good solution for the common substructureidentification problem should produce results that include:1. All possible common substructures (CS),2. CSs whose elements do not follow the same backbone order,3. CSs spanning multiple polypeptide chains,4. Ranking mechanism so that potentially biologically interesting structure ison the top.We propose a novel algorithm called FAMCS (Finding All Maximal CommonSubstructures). Experiments on various proteins show that FAMCS can addressall four requirements and infer interesting biological discoveries.
dc.language.isoen
dc.subjectProtein 3D structure, common substructure, secondary structure element (SSE), non-topological, structural alignment, RMSD
dc.typeThesis
dc.contributor.departmentCOMPUTER SCIENCE
dc.contributor.supervisorTUNG KUM HOE, ANTHONY
dc.description.degreeMaster's
dc.description.degreeconferredMASTER OF SCIENCE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Master's Theses (Open)

Show simple item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
YaoZhenThesis.pdf433.72 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

196
checked on May 22, 2019

Download(s)

121
checked on May 22, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.