<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Electrical Engineering</JournalTitle>
				<Issn>2588-2910</Issn>
				<Volume>44</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>04</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Development of an Efficient Hybrid Method for Motif Discovery in DNA Sequences</ArticleTitle>
<VernacularTitle>Development of an Efficient Hybrid Method for Motif Discovery in DNA Sequences</VernacularTitle>
			<FirstPage>63</FirstPage>
			<LastPage>75</LastPage>
			<ELocationID EIdType="pii">42</ELocationID>
			
<ELocationID EIdType="doi">10.22060/eej.2012.42</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Akbari</LastName>
<Affiliation>Corresponding Author, Reza Akbari is with the Department of Computer Engineering and Information Technology, Shiraz University of
Technology, Shiraz, Iran, (email: akbari@sutech.ac.ir)</Affiliation>

</Author>
<Author>
					<FirstName>Vahid</FirstName>
					<LastName>Zeighami</LastName>
<Affiliation>Vahid Zeighami is with the Department of Mathematics and Industrial Engineering, Ecole Polytechnique, de Montreal, Montreal, Quebec, Canada,
(email: vahid.zeighami@polymtl.ca)</Affiliation>

</Author>
<Author>
					<FirstName>Koorush</FirstName>
					<LastName>Ziarati</LastName>
<Affiliation>Koorush Ziarati is with the Department of Computer Science and Engineering, Shiraz University, Shiraz, Iran, (email: ziarati@shirazu.ac.ir)</Affiliation>

</Author>
<Author>
					<FirstName>Ismail</FirstName>
					<LastName>Akbari</LastName>
<Affiliation>Ismail Akbari is a graduated student from Department of Industrial Engineering, Iran University of Science of Science and Technology, Tehran,
Iran, (email: ismail.akbari80@gmail.com)</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>03</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		    <Abstract>This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed by the basic PSO algorithm. Under this method, to balance between exploration and exploitation, at each iteration step, a local region is associated with each candidate particle, and a local exploration performed in this blob. The stochastic local search employs an intelligent repulsion/attraction mechanism to navigate a particle to explore this local region beyond that defined by the search algorithm to achieve a better solution. Over the successive iterations, the size of local region dynamically decreases. Also a non-linear dynamic inertia weight is introduced to further improve the performance of SPSO-Lk approach. The SPSO-Lk is tested on different sets of simulated and real nucleotide sequences to discover implanted DNA motifs. Experimental results show that the SPSO-Lk is effective, and provides competitive results in comparison with the performance of other algorithms investigated in this consideration. </Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Particle Swarm Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Stochastic Local Search</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Motif Discovery</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://eej.aut.ac.ir/article_42_a1d0c6e83f027327d8461063f4ac58a6.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
