Lorentz JÄNTSCHI (lori) works ?id=168
- [id] => 168
- [recorddate] => 2008:10:09:17:05:44
- [lastupdate] => 2008:10:09:17:05:44
- [type] => article
- [place] => Cluj-Napoca, Romania
- [subject] => engineering - agriculture; informatics - applied; informatics - fundamentals; informatics - models implementation; informatics - simulation; mathematics - modeling; research - evaluation; research - policy
- [relatedworks] => N/A
- [file] => ?f=168
- [mime] => application/pdf
- [size] => 80934
- [pubname] => BUASVMCN. Horticulture
- [pubinfo] => AcademicPres
- [pubkey] => p-ISSN 1843-5254, e-ISSN 1843-5394
- [workinfo] => 65(1): 63-70
- [year] => 2008
- [title] => On about what can be done and what cannot be done with genetic algorithms in phylogenetic tree and gene sequence analyses
- [authors] => Lorentz JÄNTSCHI, Sorana D. BOLBOACĂ, Radu E. SESTRAŞ
- [abstract] =>
Genetic algorithms, a sort of algorithms belonging to a more general category, so called meta-heuristics, know today a great expansion in terms of target applications, including biology, chemistry and medicine. They are inspired from primary observations in nature (Lamarck, 1809; Darwin, 1859; Mendel, 1865; Fisher, 1918), and started with simulation of artificial selection of organisms with multiple loci that controls a measurable trait (Fraser, 1957).
Genetic algorithms evolved into complex and strong informatics tools capable to deal with hard problems of decision, classification, optimization, and simulation in fields as biology, chemistry and medicine.
The aim of the present article was to introduce genetic algorithms and to present their suitability for biological hard problems.
Some important results reported in the literature about the use of genetic algorithms for phylogenetic and gene sequence analysis are discussed.
- [keywords] => genetic algorithms; hard problems; evolution; phylogenetic trees; gene sequences
- [acknowledgment] => Authors acknowledge that the research was conducted being supported in part by national research grants (LJ: ID1051/UEFISCSU, SDB: ID0458/UEFISCSU, RES: PCCP1177/CNMP).