Lorentz JÄNTSCHI, Sorana D. BOLBOACA and Radu E. SESTRAS (2009) Hard Problems in Gene Sequence Analysis: Classical Approaches and Suitability of Genetic Algorithms

getCITED

Home Search Add Content Reports Help

Edit Publication | Edit Contributors | Delete Publication | Edit References | Edit Citations

Add to Bookstack | Show Bookstack | Change Bookstack

Hard Problems in Gene Sequence Analysis: Classical Approaches and Suitability of Genetic Algorithms

Post a Comment

CONTRIBUTORS:

	Author:	Lorentz JÄNTSCHI (Technical University of Cluj-Napoca)
	Author:	Sorana D. BOLBOACA (Iuliu Hatieganu University of Medicine and Pharmacy Cluj-Napoca)
	Author:	Radu E. SESTRAS (University of Agricultural Sciences and Veterinary Medicine, Cluj-Napoca, Romania)

JOURNAL:

Biotechnology & Biotechnological Equipment, 23(2), 1275 - 1280.

YEAR:

2009

PUB TYPE:

Journal Article

SUBJECT(S):

engineering - agriculture; medicine - informatics; informatics - models implementation

DISCIPLINE:

Biology

HTTP:

http://www.diagnosisp.com/dp/journals/view_pdf.php?journal_id=1&archive=1&issue_id=23&article_id=765

LANGUAGE:

English

PUB ID:

103-449-094 (Last edited on 2009/05/23 11:13:19 GMT-6)

SPONSOR(S):

ABSTRACT:
Genetic algorithms are based on observations of natural phenomena as well as on the simulation of the artificial selection of organisms with multiple loci controlling a measurable trait. Genetic algorithms evolved into complex and strong informatics tools able to deal with hard problems of decision, classification, optimization, or/and simulation. We aimed to show how genetic algorithms can be used to solve hard problems on gene sequence analysis.

STATISTICS

Click on # to view
Citations		0
References		1
Comments		0
Quality		0/0.00
Interest		0/0.00
View(er)s		2/143

Quality
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Interest
	N/A
High
	7
	6
	5
	4
	3
	2
	1
Low

Prev | Next