Ant colonial-based approach for the minimal full trie problem
by Meng Zhang; Yi Zhang
International Journal of Bio-Inspired Computation (IJBIC), Vol. 9, No. 4, 2017

Abstract: A trie of a set of strings P is a digital search tree in which each leaf corresponds to a string in P. Reducing the storage requirement of tries is one of the major problems of trie. One method for reducing the space required is to change the order of symbol testing. Unfortunately, the problem of finding an ordering which guarantees a minimum-size trie is NP-complete. We present a trie minimisation algorithm using ant colony optimisation (ACO). We introduce the dynamic graph and the ant teams to ACO that works out the solution by a group of cooperating ants. Experiments show that our approach generates tries that are smaller than that generated by the greedy method.

Online publication date: Mon, 05-Jun-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com