IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v30y2024i5d10.1007_s10732-024-09528-z.html
   My bibliography  Save this article

Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs

Author

Listed:
  • Gabriel Siqueira

    (Universidade Estadual de Campinas (UNICAMP))

  • Andre Rodrigues Oliveira

    (Universidade Presbiteriana Mackenzie)

  • Alexsandro Oliveira Alexandrino

    (Universidade Estadual de Campinas (UNICAMP))

  • Géraldine Jean

    (Nantes Université, École Centrale Nantes)

  • Guillaume Fertin

    (Nantes Université, École Centrale Nantes)

  • Zanoni Dias

    (Universidade Estadual de Campinas (UNICAMP))

Abstract

The adjacency graph is a structure used to model genomes in several rearrangement distance problems. In particular, most studies use properties of a maximum cycle packing of this graph to develop bounds and algorithms for rearrangement distance problems, such as the reversal distance, the reversal and transposition distance, and the double cut and join distance. When each genome has no repeated genes, there exists only one cycle packing for the graph. However, when each genome may have repeated genes, the problem of finding a maximum cycle packing for the adjacency graph (adjacency graph packing) is NP-hard. In this work, we develop a randomized greedy heuristic and a genetic algorithm heuristic for the adjacency graph packing problem for genomes with repeated genes and unequal gene content. We also propose new algorithms with simple implementation and good practical performance for reversal distance and reversal and transposition distance in genomes without repeated genes, which we combine with the heuristics to find solutions for the problems with repeated genes. We present experimental results and compare the application of these heuristics with the application of the MSOAR framework in rearrangement distance problems. Lastly, we apply our genetic algorithm heuristic to real genomic data to validate its practical use.

Suggested Citation

  • Gabriel Siqueira & Andre Rodrigues Oliveira & Alexsandro Oliveira Alexandrino & Géraldine Jean & Guillaume Fertin & Zanoni Dias, 2024. "Assignment of orthologous genes in unbalanced genomes using cycle packing of adjacency graphs," Journal of Heuristics, Springer, vol. 30(5), pages 269-289, December.
    • Handle: RePEc:spr:joheur:v:30:y:2024:i:5:d:10.1007_s10732-024-09528-z
    DOI: 10.1007/s10732-024-09528-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-024-09528-z
    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/s10732-024-09528-z?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. Shanshan Zhai & Peng Zhang & Daming Zhu & Weitian Tong & Yao Xu & Guohui Lin, 2019. "An approximation algorithm for genome sorting by reversals to recover all adjacencies," Journal of Combinatorial Optimization, Springer, vol. 37(4), pages 1170-1190, May.
    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.

      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:joheur:v:30:y:2024:i:5:d:10.1007_s10732-024-09528-z. 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.