Premium
Automated Biological Sequence Description by Genetic Multiobjective Generalized Clustering
Author(s) -
ZWIR I.,
ZALIZ R. ROMERO,
RUSPINI E. H.
Publication year - 2002
Publication title -
annals of the new york academy of sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.712
H-Index - 248
eISSN - 1749-6632
pISSN - 0077-8923
DOI - 10.1111/j.1749-6632.2002.tb04889.x
Subject(s) - computer science , cluster analysis , multi objective optimization , identification (biology) , object (grammar) , pareto principle , data mining , domain (mathematical analysis) , set (abstract data type) , genetic algorithm , fuzzy logic , biological data , feature (linguistics) , artificial intelligence , machine learning , mathematics , mathematical optimization , bioinformatics , mathematical analysis , linguistics , botany , philosophy , biology , programming language
A bstract : Recent advances in the accessibility of databases containing representations of complex objects—exemplified by repositories of time‐series data, information about biological macromolecules, or knowledge about metabolic pathways—have not been matched by availability of tools that facilitate the retrieval of objects of particular interest and aid understanding their structure and relations. In applications, such as the analysis of DNA sequences, on the other hand, requirements to retrieve objects on the basis of qualitative characteristics are poorly met by descriptions that emphasize precision and detail rather than structural features. This paper presents a method for identification of interesting qualitative features in biological sequences. Our approach relies on a generalized clustering methodology in which the features being sought correspond to the solutions of a multivariable, multiobjective optimization problem with features generally corresponding to fuzzy subsets of the object being represented. Foremost among the optimization objectives being considered are measures of the degree by which features resemble prototypical structures deemed to be interesting by database users. Other objectives include feature size and, in some cases, performance criteria related to domain‐specific constraints. Genetic‐algorithm methods are employed to solve the multiobjective optimization problem. These optimization algorithms discover candidate features as subsets of the object being described and that lie in the set of all Pareto‐optimal solutions—of that problem. These candidate features are then summarized, employing again evolutionary‐computation methods, and interrelated by employing domain‐specific relations of interest to the end users. We present results of the application of this two‐step method to the recognition and summarization of interesting features in DNA sequences of Tripanosoma cruzi .