Space Searching Algorithms Used by Fungi

Experimental studies have shown that fungi use a natural program for searching the space available in micro-confined networks, e.g., mazes. This natural program, which comprises two subroutines, i.e., collision-induced branching and directional memory, has been shown to be efficient compared with th...

Full description

Bibliographic Details
Main Authors: Elitsa Asenova, Eileen Fu, Dan Nicolau Jr, Hsin-Yu Lin, Dan Nicolau
Format: Article
Language:English
Published: European Alliance for Innovation (EAI) 2016-12-01
Series:EAI Endorsed Transactions on Collaborative Computing
Subjects:
Online Access:http://eudl.eu/doi/10.4108/eai.3-12-2015.2262591
id doaj-65a3048f686a4368b11cebea1bf8a2b3
record_format Article
spelling doaj-65a3048f686a4368b11cebea1bf8a2b32020-11-25T01:44:10ZengEuropean Alliance for Innovation (EAI)EAI Endorsed Transactions on Collaborative Computing2312-86232016-12-01291610.4108/eai.3-12-2015.2262591Space Searching Algorithms Used by FungiElitsa Asenova0Eileen Fu1Dan Nicolau Jr2Hsin-Yu Lin3Dan Nicolau4McGill University, CanadaMcGill University, CanadaQueensland University of Technology, Australia; dan.nicolau@mcgill.caMcGill University, CanadaMcGill University, CanadaExperimental studies have shown that fungi use a natural program for searching the space available in micro-confined networks, e.g., mazes. This natural program, which comprises two subroutines, i.e., collision-induced branching and directional memory, has been shown to be efficient compared with the suppressing one, or both subroutines. The present contribution compares the performance of the fungal natural program against several standard space searching algorithms. It was found that the fungal natural algorithm consistently outperforms Depth-First-Search (DFS) algorithm, and although it is inferior to informed algorithms, such as A*, this under-performance does not increase importantly with the increase of the size of the maze. These findings encourage a systematic effort to harvest the natural space searching algorithms used by microorganisms, which, if efficient, can be reverse-engineered for graph and tree search strategies.http://eudl.eu/doi/10.4108/eai.3-12-2015.2262591maze searchingnatural algorithmsbiomimeticsmicrofluidics
collection DOAJ
language English
format Article
sources DOAJ
author Elitsa Asenova
Eileen Fu
Dan Nicolau Jr
Hsin-Yu Lin
Dan Nicolau
spellingShingle Elitsa Asenova
Eileen Fu
Dan Nicolau Jr
Hsin-Yu Lin
Dan Nicolau
Space Searching Algorithms Used by Fungi
EAI Endorsed Transactions on Collaborative Computing
maze searching
natural algorithms
biomimetics
microfluidics
author_facet Elitsa Asenova
Eileen Fu
Dan Nicolau Jr
Hsin-Yu Lin
Dan Nicolau
author_sort Elitsa Asenova
title Space Searching Algorithms Used by Fungi
title_short Space Searching Algorithms Used by Fungi
title_full Space Searching Algorithms Used by Fungi
title_fullStr Space Searching Algorithms Used by Fungi
title_full_unstemmed Space Searching Algorithms Used by Fungi
title_sort space searching algorithms used by fungi
publisher European Alliance for Innovation (EAI)
series EAI Endorsed Transactions on Collaborative Computing
issn 2312-8623
publishDate 2016-12-01
description Experimental studies have shown that fungi use a natural program for searching the space available in micro-confined networks, e.g., mazes. This natural program, which comprises two subroutines, i.e., collision-induced branching and directional memory, has been shown to be efficient compared with the suppressing one, or both subroutines. The present contribution compares the performance of the fungal natural program against several standard space searching algorithms. It was found that the fungal natural algorithm consistently outperforms Depth-First-Search (DFS) algorithm, and although it is inferior to informed algorithms, such as A*, this under-performance does not increase importantly with the increase of the size of the maze. These findings encourage a systematic effort to harvest the natural space searching algorithms used by microorganisms, which, if efficient, can be reverse-engineered for graph and tree search strategies.
topic maze searching
natural algorithms
biomimetics
microfluidics
url http://eudl.eu/doi/10.4108/eai.3-12-2015.2262591
work_keys_str_mv AT elitsaasenova spacesearchingalgorithmsusedbyfungi
AT eileenfu spacesearchingalgorithmsusedbyfungi
AT dannicolaujr spacesearchingalgorithmsusedbyfungi
AT hsinyulin spacesearchingalgorithmsusedbyfungi
AT dannicolau spacesearchingalgorithmsusedbyfungi
_version_ 1725029504274923520