2007 10th International Conference on Computer and Information Technology 2007
DOI: 10.1109/iccitechn.2007.4579353
|View full text |Cite
|
Sign up to set email alerts
|

A novel approach of finding planted motif in biological sequences

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…The second group contains all methods that find an approximate solution. The methods in this group are based on different strategies such as probabilistic, greedy, and soft computing such as genetic, ant colony and swarm (Nazmul et al, 2007;Chengwei and Jianhua, 2009;Li and Wang, 2010;Li and Wang, 2009;Chan et al, 2008;Clerc and Kennedy, 2002;Li and Tompa, 2006;Sze and Zhao, 2006). All these techniques depend on finding local optimal solution.…”
Section: Introductionmentioning
confidence: 99%
“…The second group contains all methods that find an approximate solution. The methods in this group are based on different strategies such as probabilistic, greedy, and soft computing such as genetic, ant colony and swarm (Nazmul et al, 2007;Chengwei and Jianhua, 2009;Li and Wang, 2010;Li and Wang, 2009;Chan et al, 2008;Clerc and Kennedy, 2002;Li and Tompa, 2006;Sze and Zhao, 2006). All these techniques depend on finding local optimal solution.…”
Section: Introductionmentioning
confidence: 99%