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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
