IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v28y2020i1d10.1007_s10100-018-0579-y.html
   My bibliography  Save this article

Parametric analysis on cut-trees and its application on a protein clustering problem

Author

Listed:
  • João Paulo Freitas Araujo

    (PUC-Rio)

  • Madiagne Diallo

    (PUC-Rio)

  • Fernanda Maria Pereira Raupp

    (Laboratório Nacional de Computação Científica)

  • Pascal Berthomé

    (INSA Centre Val de Loire)

  • José Eugenio Leal

    (PUC-Rio)

Abstract

Computing the maximum flow value between a pair of nodes in a given network is a classic problem in the context of network flows. Its extension, namely, the multi-terminal maximum flow problem, comprises finding the maximum flow values between all pairs of nodes in a given undirected network. In this work, we provide an overview of the recent theory of sensitivity analysis, which examines the influence of a single edge capacity variation on the multi-terminal maximum flows, and we make remarks about extending some theoretical results to the case where more than one edge has their capacities changed. Based on these extensions, we present algorithms to construct the Gomory and Hu cut-trees dynamically, considering capacity variations in more than one edge in the network. Finally, the presented theory is applied on a clustering problem, in the field of biology, in order to improve an existing algorithm that identifies protein complexes in protein–protein interaction networks. In this application, a new result in the sensitivity analysis theory is introduced.

Suggested Citation

  • João Paulo Freitas Araujo & Madiagne Diallo & Fernanda Maria Pereira Raupp & Pascal Berthomé & José Eugenio Leal, 2020. "Parametric analysis on cut-trees and its application on a protein clustering problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 229-249, March.
    • Handle: RePEc:spr:cejnor:v:28:y:2020:i:1:d:10.1007_s10100-018-0579-y
    DOI: 10.1007/s10100-018-0579-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10100-018-0579-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10100-018-0579-y?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Salah E. Elmaghraby, 1964. "Sensitivity Analysis of Multiterminal Flow Networks," Operations Research, INFORMS, vol. 12(5), pages 680-688, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ahmad Hosseini & Bita Kabir Baiki, 2017. "An Addendum on Postoptimality of Maximally Reliable Path," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 9(3), pages 23-29, June.

    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:spr:cejnor:v:28:y:2020:i:1:d:10.1007_s10100-018-0579-y. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.