Abstracts

Cybernetiks

Search trees (so-called tries) are intended for object identification in biology, mineralogy etc. To avoid mistakes it could be useful to construct error-correcting tries at the expense of the average search time (so-called cost).
It is well-known that construction of a trie of the minimal cost is NP-complete. We consider an effective algorithm constructing a trie with a nearly minimal cost. To prove that the algorithm is good for practice we provide a computational test of its quality.

Full Text in Russian:

HTML

Note. Abstracts are published in author's edition

Comments

[Home] [Conference]

©2001, Siberian Branch of Russian Academy of Science, Novosibirsk
©2001, United Institute of Computer Science SB RAS, Novosibirsk
©2001, Institute of Computational Techologies SB RAS, Novosibirsk
©2001, A.P. Ershov Institute of Informatics Systems SB RAS, Novosibirsk
©2001, Institute of Mathematics SB RAS, Novosibirsk
©2001, Institute of Cytology and Genetics SB RAS, Novosibirsk
©2001, Institute of Computational Mathematics and Mathematical Geophysics SB RAS, Novosibirsk
©2001, Novosibirsk State University
Last modified 06-Jul-2012 (11:45:21)