<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">

Publication:
The parallel genetic algorithm for designing dna randomizations in a combinatorial protein experiment

Simple item page
dc.conference.dateSEP 11-14, 2005
dc.conference.locationPoznan, Poland
dc.conference.organizer6th International Conference on Parallel Processing and Applied Mathematics
dc.contributor.coauthorBlazewicz, Jacek
dc.contributor.coauthorDziurdza, Beniamin
dc.contributor.coauthorMarkiewicz, Wojciech T
dc.contributor.departmentDepartment of Industrial Engineering
dc.contributor.facultymemberYes
dc.contributor.kuauthorOğuz, Ceyda
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.date.accessioned2024-11-09T23:35:02Z
dc.date.issued2006
dc.description.abstractEvolutionary methods of protein engineering such as phage display have revolutionized drug design and the means of studying molecular binding. In order to obtain the highest experimental efficiency, the distributions of constructed combinatorial libraries should be carefully adjusted. The presented approach takes into account diversity- completeness trade-off and tries to maximize the number of new amino acid sequences generated in each cycle of the experiment. In the paper, the mathematical model is introduced and the parallel genetic algorithm for the defined optimization problem is described. Its implementation on the SunFire 6800 computer proves a high efficiency of the proposed approach.
dc.description.fulltextNo
dc.description.harvestedfromManual
dc.description.indexedbyWOS
dc.description.indexedbyScopus
dc.description.openaccessNO
dc.description.peerreviewstatusN/A
dc.description.publisherscopeInternational
dc.description.readpublishN/A
dc.description.sponsoredbyTubitakEuN/A
dc.description.sponsorshipThe research of the first three authors was partially supported by KBN grant No 3T11F00227.
dc.description.studentonlypublicationNo
dc.description.studentpublicationNo
dc.description.versionN/A
dc.identifier.WoSQuartileQ4
dc.identifier.doi10.1007/11752578_133
dc.identifier.eissn1611-3349
dc.identifier.embargoN/A
dc.identifier.endpage1105
dc.identifier.grantno3T11F00227
dc.identifier.isbn3540341412
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-33745799854
dc.identifier.startpage1097
dc.identifier.urihttps://hdl.handle.net/20.500.14288/12457
dc.identifier.urihttps://doi.org/10.1007/11752578_133
dc.identifier.volume3911
dc.identifier.wos000238107100133
dc.keywordsDiversity
dc.keywordsGenetic algorithm
dc.keywordsPhage display
dc.keywordsParallel genetic algorithm
dc.keywordsLength versus
dc.keywordsProtein library
dc.language.isoeng
dc.publisherSpringer-Verlag Berlin
dc.relation.affiliationKoç University
dc.relation.collectionKoç University Institutional Repository
dc.relation.ispartofParallel Processing and Applied Mathematics
dc.relation.ispartofseriesLecture Notes in Computer Science
dc.relation.openaccessN/A
dc.rightsN/A
dc.subjectComputer science
dc.subjectArtificial intelligence
dc.subjectComputer science
dc.subjectMathematics
dc.subjectApplied mathematics
dc.titleThe parallel genetic algorithm for designing dna randomizations in a combinatorial protein experiment
dc.typeConference Proceeding
dspace.entity.typePublication
local.contributor.kuauthorOğuz, Ceyda
relation.isOrgUnitOfPublicationd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isOrgUnitOfPublication.latestForDiscoveryd6d00f52-d22d-4653-99e7-863efcd47b4a
relation.isParentOrgUnitOfPublication8e756b23-2d4a-4ce8-b1b3-62c794a8c164
relation.isParentOrgUnitOfPublication.latestForDiscovery8e756b23-2d4a-4ce8-b1b3-62c794a8c164

Files

Collections

Publications without Fulltext