RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

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


Probl. Peredachi Inf., 2017, Volume 53, Issue 1, Pages 60–78 (Mi ppi2228)  

This article is cited in 2 scientific papers (total in 2 papers)

Large Systems

Linear algorithm for minimal rearrangement of structures

K. Yu. Gorbunov, V. A. Lyubetsky

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: We propose a linear time and linear space algorithm which constructs a minimal sequence of operations rearranging one structure (directed graph of cycles and paths) into another. Structures in such a sequence may have a varying number of edges; a list of operations is fixed and includes deletion and insertion of a fragment of a structure. We give a complete proof that the algorithm is correct, i.e., finds the corresponding minimum.

Funding Agency Grant Number
Russian Science Foundation 14-50-00150
The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.


Full text: PDF file (239 kB)
First page: PDF file
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2017, 53:1, 55–72

Bibliographic databases:

Document Type: Article
UDC: 621.391 : 519.1
Received: 29.12.2014
Revised: 25.04.2016

Citation: K. Yu. Gorbunov, V. A. Lyubetsky, “Linear algorithm for minimal rearrangement of structures”, Probl. Peredachi Inf., 53:1 (2017), 60–78; Problems Inform. Transmission, 53:1 (2017), 55–72

Citation in format AMSBIB
\Bibitem{GorLyu17}
\by K.~Yu.~Gorbunov, V.~A.~Lyubetsky
\paper Linear algorithm for minimal rearrangement of structures
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 1
\pages 60--78
\mathnet{http://mi.mathnet.ru/ppi2228}
\elib{http://elibrary.ru/item.asp?id=28876248}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 1
\pages 55--72
\crossref{https://doi.org/10.1134/S0032946017010057}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000399821500005}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018193412}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2228
  • http://mi.mathnet.ru/eng/ppi/v53/i1/p60

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Lyubetsky V., Gershgorin R., Gorbunov K., “Chromosome Structures: Reduction of Certain Problems With Unequal Gene Content and Gene Paralogs to Integer Linear Programming”, BMC Bioinformatics, 18 (2017), 537  crossref  isi  scopus
    2. Gorbunov K.Yu., Lyubetsky V.A., “A Linear Algorithm For the Shortest Transformation of Graphs With Different Operation Costs”, J. Commun. Technol. Electron., 62:6 (2017), 653–662  crossref  mathscinet  isi  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:98
    References:10
    First page:8

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018