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] |
---|
Links: |
---|
Themen: |
Journal Article |
---|
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 |
---|
LEADER | 01000naa a22002652 4500 | ||
---|---|---|---|
001 | NLM260427373 | ||
003 | DE-627 | ||
005 | 20231224193400.0 | ||
007 | cr uuu---uuuuu | ||
008 | 231224s2016 xx |||||o 00| ||eng c | ||
024 | 7 | |a 10.1109/TNB.2016.2567098 |2 doi | |
028 | 5 | 2 | |a pubmed24n0868.xml |
035 | |a (DE-627)NLM260427373 | ||
035 | |a (NLM)27187968 | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
100 | 1 | |a Asenova, Elitsa |e verfasserin |4 aut | |
245 | 1 | 0 | |a Optimal Fungal Space Searching Algorithms |
264 | 1 | |c 2016 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ƒaComputermedien |b c |2 rdamedia | ||
338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
500 | |a Date Completed 05.09.2017 | ||
500 | |a Date Revised 22.12.2017 | ||
500 | |a published: Print-Electronic | ||
500 | |a Citation Status MEDLINE | ||
520 | |a 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 | ||
650 | 4 | |a Journal Article | |
650 | 4 | |a Research Support, Non-U.S. Gov't | |
650 | 4 | |a Research Support, U.S. Gov't, Non-P.H.S. | |
700 | 1 | |a Lin, Hsin-Yu |e verfasserin |4 aut | |
700 | 1 | |a Fu, Eileen |e verfasserin |4 aut | |
700 | 1 | |a Nicolau, Dan V |e verfasserin |4 aut | |
700 | 1 | |a Nicolau, Dan V |e verfasserin |4 aut | |
773 | 0 | 8 | |i Enthalten in |t IEEE transactions on nanobioscience |d 2002 |g 15(2016), 7 vom: 17. Okt., Seite 613-618 |w (DE-627)NLM150513186 |x 1558-2639 |7 nnns |
773 | 1 | 8 | |g volume:15 |g year:2016 |g number:7 |g day:17 |g month:10 |g pages:613-618 |
856 | 4 | 0 | |u http://dx.doi.org/10.1109/TNB.2016.2567098 |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a GBV_NLM | ||
951 | |a AR | ||
952 | |d 15 |j 2016 |e 7 |b 17 |c 10 |h 613-618 |