IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i23p4732-d1285673.html
   My bibliography  Save this article

DNA Code Design Based on the Cosets of Codes over Z 4

Author

Listed:
  • Adel N. Alahmadi

    (Research Group of Algebraic Structures and Applications, Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Fatimah Anas Melibari

    (Research Group of Algebraic Structures and Applications, Department of Mathematics, Faculty of Science, King Abdulaziz University, Jeddah 21589, Saudi Arabia)

  • Manish K. Gupta

    (Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar 382007, India)

Abstract

DNA code design is a challenging problem, and it has received great attention in the literature due to its applications in DNA data storage, DNA origami, and DNA computing. The primary focus of this paper is in constructing new DNA codes using the cosets of linear codes over the ring Z 4 . The Hamming distance constraint, GC-content constraint, and homopolymers constraint are all considered. In this study, we consider the cosets of Simplex alpha code, Kerdock code, Preparata code, and Hadamard code. New DNA codes of lengths four, eight, sixteen, and thirty-two are constructed using a combination of an algebraic coding approach and a variable neighborhood search approach. In addition, good lower bounds for DNA codes that satisfy important constraints have been successfully established using Magma software V2.24-4 and Python 3.10 programming in our comprehensive methodology.

Suggested Citation

  • Adel N. Alahmadi & Fatimah Anas Melibari & Manish K. Gupta, 2023. "DNA Code Design Based on the Cosets of Codes over Z 4," Mathematics, MDPI, vol. 11(23), pages 1-10, November.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:23:p:4732-:d:1285673
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/23/4732/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/23/4732/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    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. Cai, Yutong & Ong, Ghim Ping & Meng, Qiang, 2022. "Dynamic bicycle relocation problem with broken bicycles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    2. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    3. Liu, Ling & Martín Barragán, Belén & Prieto Fernández, Francisco Javier, 2016. "A Partial parametric path algorithm for multiclass classification," DES - Working Papers. Statistics and Econometrics. WS 22390, Universidad Carlos III de Madrid. Departamento de Estadística.
    4. Venkatesh Pandiri & Alok Singh, 2020. "Two multi-start heuristics for the k-traveling salesman problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1164-1204, December.
    5. H. Asefi & S. Lim & M. Maghrebi & S. Shahparvari, 2019. "Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management," Annals of Operations Research, Springer, vol. 273(1), pages 75-110, February.
    6. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    7. H-Y Lin & C-J Liao & C-T Tseng, 2011. "An application of variable neighbourhood search to hospital call scheduling of infant formula promotion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 949-959, June.
    8. Astorino, Annabella & Avolio, Matteo & Fuduli, Antonio, 2022. "A maximum-margin multisphere approach for binary Multiple Instance Learning," European Journal of Operational Research, Elsevier, vol. 299(2), pages 642-652.
    9. Chandra Ade Irawan & Said Salhi & Zvi Drezner, 2016. "Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems," Journal of Heuristics, Springer, vol. 22(4), pages 507-537, August.
    10. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    11. Olivera Janković & Stefan Mišković & Zorica Stanimirović & Raca Todosijević, 2017. "Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems," Annals of Operations Research, Springer, vol. 259(1), pages 191-216, December.
    12. Abdel-Rahman Hedar & Wael Deabes & Hesham H. Amin & Majid Almaraashi & Masao Fukushima, 2022. "Global sensing search for nonlinear global optimization," Journal of Global Optimization, Springer, vol. 82(4), pages 753-802, April.
    13. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    14. Ade Irawan, Chandra & Starita, Stefano & Chan, Hing Kai & Eskandarpour, Majid & Reihaneh, Mohammad, 2023. "Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat," European Journal of Operational Research, Elsevier, vol. 307(1), pages 328-350.
    15. Dolinskaya, Irina & Shi, Zhenyu (Edwin) & Smilowitz, Karen, 2018. "Adaptive orienteering problem with stochastic travel times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 1-19.
    16. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    17. Huber, Sandra & Geiger, Martin Josef, 2017. "Order matters – A Variable Neighborhood Search for the Swap-Body Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 263(2), pages 419-445.
    18. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    19. Shandong Mou, 2022. "Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores," Mathematics, MDPI, vol. 10(9), pages 1-19, April.
    20. Eng, KaiLun & Muhammed, Abdullah & Mohamed, Mohamad Afendee & Hasan, Sazlinah, 2020. "A hybrid heuristic of Variable Neighbourhood Descent and Great Deluge algorithm for efficient task scheduling in Grid computing," European Journal of Operational Research, Elsevier, vol. 284(1), pages 75-86.

    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:gam:jmathe:v:11:y:2023:i:23:p:4732-:d:1285673. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.