Top-down motif discovery in biological sequence datasets by genetic algorithm

dc.contributor.authorBaloglu, Ulas Baran
dc.contributor.authorKaya, Mehmet
dc.date.accessioned2026-08-12T16:34:53Z
dc.date.issued2006
dc.departmentFırat Üniversitesi
dc.description1st International Conference on Hybrid Information Technology -- NOV 09-11, 2006 -- Cheju Isl, SOUTH KOREA
dc.description.abstractThis paper presents a novel approach for motif discovery. Finding motif in biosequences is the most important primitive operation in computational biology. There are many computational requirements for a motif discovery algorithm such as computer memory space requirement and computational complexity. To overcome the complexity of motif discovery, we propose an alternative solution integrating genetic algorithm and top-down data mining, approaches for eliminating multiple sequence alignment process. The experimental results. demonstrate that the proposed method outperforms two well-known motif discovery algorithms, called MEME and Gibbs Sampler.
dc.description.sponsorshipSERC,SERSC
dc.identifier.endpage+
dc.identifier.isbn978-0-7695-2674-4
dc.identifier.orcid0000-0002-2045-9922
dc.identifier.orcid0000-0003-2995-8282
dc.identifier.scopus2-s2.0-34247191985
dc.identifier.scopusqualityN/A
dc.identifier.startpage103
dc.identifier.urihttps://hdl.handle.net/11508/44652
dc.identifier.wosWOS:000244028600018
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherIeee Computer Soc
dc.relation.ispartof2006 International Conference on Hybrid Information Technology, Vol 2, Proceedings
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260511
dc.subjectAlignment
dc.subjectDna
dc.titleTop-down motif discovery in biological sequence datasets by genetic algorithm
dc.typeConference Object

Dosyalar