Optimal Fungal Space Searching Algorithms

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

Medienart:

E-Artikel

Erscheinungsjahr:

2016

Erschienen:

2016

Enthalten in:

Zur Gesamtaufnahme - volume:15

Enthalten in:

IEEE transactions on nanobioscience - 15(2016), 7 vom: 17. Okt., Seite 613-618

Sprache:

Englisch

Beteiligte Personen:

Asenova, Elitsa [VerfasserIn]
Lin, Hsin-Yu [VerfasserIn]
Fu, Eileen [VerfasserIn]
Nicolau, Dan V [VerfasserIn]
Nicolau, Dan V [VerfasserIn]

Links:

Volltext

Themen:

Journal Article
Research Support, Non-U.S. Gov't
Research Support, U.S. Gov't, Non-P.H.S.

Anmerkungen:

Date Completed 05.09.2017

Date Revised 22.12.2017

published: Print-Electronic

Citation Status MEDLINE

doi:

10.1109/TNB.2016.2567098

funding:

Förderinstitution / Projekttitel:

PPN (Katalog-ID):

NLM260427373