Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2011, Volume 47, Issue 3, Pages 64–79 (Mi ppi2055)  
This article is cited in 13 scientific papers (total in 13 papers)

Large Systems

The tree nearest on average to a given set of trees

K. Yu. Gorbunov, V. A. Lyubetsky

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Full-text PDF (256 kB) Citations (13)
References:
PDF
HTML
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.
Received: 13.10.2010
Revised: 26.05.2011
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 3, Pages 274–288
DOI: https://doi.org/10.1134/S0032946011030069
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+514
Language: Russian
Citation: K. Yu. Gorbunov, V. A. Lyubetsky, “The tree nearest on average to a given set of trees”, Probl. Peredachi Inf., 47:3 (2011), 64–79; Problems Inform. Transmission, 47:3 (2011), 274–288
Citation in format AMSBIB
\Bibitem{GorLyu11}
\by K.~Yu.~Gorbunov, V.~A.~Lyubetsky
\paper The tree nearest on average to a~given set of trees
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 3
\pages 64--79
\mathnet{http://mi.mathnet.ru/ppi2055}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2896177}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 3
\pages 274--288
\crossref{https://doi.org/10.1134/S0032946011030069}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299374700006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84855917719}
Linking options:
  • https://www.mathnet.ru/eng/ppi2055
  • https://www.mathnet.ru/eng/ppi/v47/i3/p64
    • This publication is cited in the following 13 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:339
    Full-text PDF :75
    References:60
    First page:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024