Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)
Article . 2006 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2006
Data sources: DBLP
versions View all 2 versions
addClaim

Bioinformatics with soft computing

Authors: Sushmita Mitra; Yoichi Hayashi;

Bioinformatics with soft computing

Abstract

Soft computing is gradually opening up several possibilities in bioinformatics, especially by generating low-cost, low-precision (approximate), good solutions. In this paper, we survey the role of different soft computing paradigms, like fuzzy sets (FSs), artificial neural networks (ANNs), evolutionary computation, rough sets (RSes), and support vector machines (SVMs), in this direction. The major pattern-recognition and data-mining tasks considered here are clustering, classification, feature selection, and rule generation. Genomic sequence, protein structure, gene expression microarrays, and gene regulatory networks are some of the application areas described. Since the work entails processing huge amounts of incomplete or ambiguous biological data, we can utilize the learning ability of neural networks for adapting, uncertainty handling capacity of FSs and RSes for modeling ambiguity, searching potential of genetic algorithms for efficiently traversing large search spaces, and the generalization capability of SVMs for minimizing errors

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    79
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
79
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!