Show simple item record

dc.contributor.authorHiggs, Trenten_US
dc.contributor.authorStantic, Belaen_US
dc.contributor.authorHoque, Mden_US
dc.contributor.editorS. Sahnien_US
dc.date.accessioned2017-04-24T08:20:00Z
dc.date.available2017-04-24T08:20:00Z
dc.date.issued2008en_US
dc.date.modified2011-10-18T07:24:01Z
dc.identifier.doihttp://www.actapress.com/Abstract.aspx?paperId=33004en_AU
dc.identifier.urihttp://hdl.handle.net/10072/22593
dc.description.abstractProteins are three-dimensional structures that carry out many of the vital biological functions in organisms. Because structure, not amino acid sequence order, carry out certain functions, it is important to understand how proteins fold. Computational methods for protein structure prediction mentioned in the literature are computationally demanding. To reduce computational demand fragment libraries were introduced. Fragment libraries work by taking short segments of the polypeptide chain and limiting the amount of conformations that will be considered for a particular segment. In this paper an extensive analysis towards finding the optimal length of fragments contained within fragment libraries was conducted. An extensive analysis was done on protein structures stored in a ORDBMS to exploit its power. Experiments focused on the structural similarity between fragments of identical primary protein sub-sequence within different proteins, and amount of occurrences of similar or closely similar fragments within different proteins. Experimental results indicate that short to medium sized fragments have stronger structural correlations with matching fragments within different proteins.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.format.extent284807 bytes
dc.format.mimetypeapplication/pdf
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherACTA Pressen_US
dc.publisher.placeSwitzerlanden_US
dc.publisher.urihttp://iasted.org/conferences/pastinfo-605.htmlen_AU
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofconferencenameThe Fourth IASTED International Conference on Advances in Computer Science and Technology,en_US
dc.relation.ispartofconferencetitleProceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technologyen_US
dc.relation.ispartofdatefrom2008-04-02en_US
dc.relation.ispartofdateto2008-04-04en_US
dc.relation.ispartoflocationLangkawi, Malaysiaen_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchHISTORY AND ARCHAEOLOGYen_US
dc.subject.fieldofresearchcode210000en_US
dc.titleOptimal Length of Fragments for use in Protein Structure Predictionen_US
dc.typeConference outputen_US
dc.type.descriptionE1 - Conference Publications (HERDC)en_US
dc.type.codeE - Conference Publicationsen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.rights.copyrightCopyright 2008 IASTED and ACTA Press. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.en_AU
gro.date.issued2008
gro.hasfulltextFull Text


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record