The tree nearest on average to a given set of trees

Large Systems

DOI: 10.1134/S0032946011030069

Cite this article as:
Gorbunov, K.Y. & Lyubetsky, V.A. Probl Inf Transm (2011) 47: 274. doi:10.1134/S0032946011030069

Abstract

We formulate the problem of constructing a tree which is the nearest on average to a given set of trees. The notion of “nearest” is formulated based on a conception of events such that counting their number makes it possible to distinguish each of the given trees from the desired one. These events are called divergence, duplication, loss, and transfer; other lists of events can also be considered. We propose an algorithm that solves this problem in cubic time with respect to the input data size. We prove correctness of the algorithm and a cubic estimate for its complexity.

Copyright information

© Pleiades Publishing, Ltd. 2011

Authors and Affiliations

  1. 1.Kharkevich Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia