Article
Licensed
Unlicensed
Requires Authentication
An estimate of mean efficiency of search trees for arbitrary sets of binary words
-
B.Ya. Ryabko
Published/Copyright:
February 2, 2016
Abstract
We consider the problem on constructing a binary search tree for an arbitrary set of binary words, which has found a wide use in informatics, biology, mineralogy, and other fields. It is known that the problem on constructing the tree of minimal cost is NP-complete; hence the problem arises to find simple algorithms which allow us to construct trees close to the optimal ones. In this paper we demonstrate that even simplest algorithm yields search trees which are close to the optimal ones in average, and prove that the mean number of nodes checked in the optimal tree differs from the natural lower bound, the binary logarithm of the number of words, by no more than 1.04.
Published Online: 2016-2-2
Published in Print: 2002-4-1
© 2016 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Editorial
- Clones determined by alternating monoids
- Bent functions from a finite abelian group into a finite abelian group
- Transitive polynomial transformations of residue class rings
- On conditions of efficiency of a solution of a multicriteria discrete problem
- An estimate of mean efficiency of search trees for arbitrary sets of binary words
- Limit distributions of the number of collections of H -equivalent segments in the triangular array scheme of equiprobable polynomial trials
- The loops of order six
- Forthcoming Papers
- Forthcoming Papers
Articles in the same Issue
- Editorial
- Clones determined by alternating monoids
- Bent functions from a finite abelian group into a finite abelian group
- Transitive polynomial transformations of residue class rings
- On conditions of efficiency of a solution of a multicriteria discrete problem
- An estimate of mean efficiency of search trees for arbitrary sets of binary words
- Limit distributions of the number of collections of H -equivalent segments in the triangular array scheme of equiprobable polynomial trials
- The loops of order six
- Forthcoming Papers
- Forthcoming Papers
