• myGriffith
    • Staff portal
    • Contact Us⌄
      • Future student enquiries 1800 677 728
      • Current student enquiries 1800 154 055
      • International enquiries +61 7 3735 6425
      • General enquiries 07 3735 7111
      • Online enquiries
      • Staff phonebook
    View Item 
    •   Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    • Home
    • Griffith Research Online
    • Conference outputs
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

  • All of Griffith Research Online
    • Communities & Collections
    • Authors
    • By Issue Date
    • Titles
  • This Collection
    • Authors
    • By Issue Date
    • Titles
  • Statistics

  • Most Popular Items
  • Statistics by Country
  • Most Popular Authors
  • Support

  • Contact us
  • FAQs
  • Admin login

  • Login
  • An Efficient Algorithm for Computing the Fitness Function of a Hydrophobic-Hydrophilic Model

    Author
    Tamjidul Hoque, Md.
    Chetty, Madhu
    Dooley, Laurence
    Year published
    2004
    Metadata
    Show full item record
    Abstract
    The protein folding problem is a minimization problem in which the energy function is often regarded as the fitness function. There are several models for protein folding prediction including the hydrophobic-hydrophilic (HP) model. Though this model is an elementary one, it is widely used as a test-bed for faster execution of new algorithms. Fitness computation is one of the major computational parts of the HP model. This paper proposes an efficient search (ES) approach for computing the fitness value requiring only O(n) complexity in contrast to the full search (FS) approach that requires O(n2) complexity. The efficiency ...
    View more >
    The protein folding problem is a minimization problem in which the energy function is often regarded as the fitness function. There are several models for protein folding prediction including the hydrophobic-hydrophilic (HP) model. Though this model is an elementary one, it is widely used as a test-bed for faster execution of new algorithms. Fitness computation is one of the major computational parts of the HP model. This paper proposes an efficient search (ES) approach for computing the fitness value requiring only O(n) complexity in contrast to the full search (FS) approach that requires O(n2) complexity. The efficiency of the proposed ES approach results due to its utilization of some inherent properties of the HP model. The ES approach represents residues in a Cartesian coordinate framework and then uses relative distance and coordinate polarity to reduce complexity.
    View less >
    Conference Title
    Proceedings. Fourth International Conference on Hybrid Intelligent Systems
    DOI
    https://doi.org/10.1109/ICHIS.2004.19
    Publication URI
    http://hdl.handle.net/10072/32951
    Collection
    • Conference outputs

    Footer

    Social media

    • Facebook
    • Twitter
    • YouTube
    • Instagram
    • Linkedin
    First peoples of Australia
    • Aboriginal
    • Torres Strait Islander

    Disclaimer

    • Privacy policy
    • Copyright matters
    • CRICOS Provider - 00233E

    Tagline

    • Gold Coast
    • Logan
    • Brisbane
    • Australia