IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v151y2018icp147-155.html
   My bibliography  Save this article

Molecular beacon computing model for maximum weight clique problem

Author

Listed:
  • Yin, Zhixiang
  • Cui, Jianzhong
  • Zhen, Chen

Abstract

Given an undirected graph with weights on the vertices, the maximum weight clique problem requires finding the clique of the graph which has the maximum weight. The problem is a general form of the maximum clique problem. In this paper, we encode weight of vertex into a unique fixed length oligonucleotide segment and employ sticker model to solve the problem. The proposed method has two distinct characteristics. On one hand, we skip generating initial data pool that contains every possible solution to the problem of interest, the key point of which is constructing the solution instead of searching solution in the vast initial data pool according to logic constraints. On the other hand, oligonucleotide segments are treated like variables which store weights on vertices, no matter what kind of number the weights are, integer or real. Therefore, the proposed method can solve the problem with arbitrary weight values and be applied to solve the other weight-related problem. In addition, molecular beacon is also employed in order to overcome shortcomings of sticker model. Besides, we have analyzed the proposed algorithm’s feasibility.

Suggested Citation

  • Yin, Zhixiang & Cui, Jianzhong & Zhen, Chen, 2018. "Molecular beacon computing model for maximum weight clique problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 151(C), pages 147-155.
    • Handle: RePEc:eee:matcom:v:151:y:2018:i:c:p:147-155
    DOI: 10.1016/j.matcom.2017.02.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475417300575
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2017.02.003?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:151:y:2018:i:c:p:147-155. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.