IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v183y2011i1p75-9410.1007-s10479-010-0682-5.html
   My bibliography  Save this article

Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction

Author

Listed:
  • Jacek Blazewicz
  • Piotr Formanowicz
  • Pawel Kedziora
  • Pawel Marciniak
  • Przemyslaw Taront

Abstract

One of the most important aspect of molecular and computational biology is the reconstruction of evolutionary relationships. The area is well explored after decades of intensive research. Despite this fact there remains a need for good and efficient algorithms that are capable of reconstructing the evolutionary relationship in reasonable time. Since the problem is computationally intractable, exact algorithms are used only for small groups of species. In the Maximum Parsimony approach the time of computation grows so fast when number of sequences increases, that in practice it is possible to find the optimal solution for instances containing about 20 sequences only. It is this reason that in practical applications, heuristic methods are used. In this paper, parallel adaptive memory programming algorithms based on Maximum Parsimony and some known neighborhood search methods for phylogenetic tree construction are proposed, and the results of computational experiments are presented. The proposed algorithms achieve a superlinear speedup and find solutions of good quality. Copyright The Author(s) 2011

Suggested Citation

  • Jacek Blazewicz & Piotr Formanowicz & Pawel Kedziora & Pawel Marciniak & Przemyslaw Taront, 2011. "Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction," Annals of Operations Research, Springer, vol. 183(1), pages 75-94, March.
    • Handle: RePEc:spr:annopr:v:183:y:2011:i:1:p:75-94:10.1007/s10479-010-0682-5
    DOI: 10.1007/s10479-010-0682-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0682-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0682-5?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. Lin, Yu-Min & Fang, Shu-Cherng & Thorne, Jeffrey L., 2007. "A tabu search algorithm for maximum parsimony phylogeny inference," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1908-1917, February.
    2. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    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. Gianfranco Chicco & Andrea Mazza, 2020. "Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the ‘Rush to Heuristics’," Energies, MDPI, vol. 13(19), pages 1-38, September.
    2. Martí, Rafael & Resende, Mauricio G.C. & Ribeiro, Celso C., 2013. "Multi-start methods for combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 226(1), pages 1-8.
    3. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    4. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    5. Thibaud Deguilhem & Juliette Schlegel & Jean-Philippe Berrou & Ousmane Djibo & Alain Piveteau, 2024. "Too many options: How to identify coalitions in a policy network?," Post-Print hal-04689665, HAL.
    6. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    8. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    9. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    10. Rego, Cesar & Roucairol, Catherine, 1995. "Using Tabu search for solving a dynamic multi-terminal truck dispatching problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 411-429, June.
    11. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    12. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    13. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    14. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    15. Dusan Ku & Tiru S. Arthanari, 2016. "On double cycling for container port productivity improvement," Annals of Operations Research, Springer, vol. 243(1), pages 55-70, August.
    16. Ghosh, Diptesh, 2016. "Exploring Lin Kernighan neighborhoods for the indexing problem," IIMA Working Papers WP2016-02-13, Indian Institute of Management Ahmedabad, Research and Publication Department.
    17. Yazdani Sabouni, M.T. & Logendran, Rasaratnam, 2013. "Carryover sequence-dependent group scheduling with the integration of internal and external setup times," European Journal of Operational Research, Elsevier, vol. 224(1), pages 8-22.
    18. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
    19. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    20. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.

    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:annopr:v:183:y:2011:i:1:p:75-94:10.1007/s10479-010-0682-5. 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.