You are currently offline. Some features of the site may not work correctly.

Corpus ID: 216641766

An Almost Exact Linear Complexity Algorithm of the Shortest Transformation of Chain-Cycle Graphs

@article{Gorbunov2020AnAE,
title={An Almost Exact Linear Complexity Algorithm of the Shortest Transformation of Chain-Cycle Graphs},
author={K. Gorbunov and V. Lyubetsky},
journal={ArXiv},
year={2020},
volume={abs/2004.14351}
}

A "genome structure" is a labeled directed graph with vertices of degree 1 or 2. A set of operations over such graphs is fixed, and each of the operations has a certain cost, a strictly positive number. The transformation problem consists in the following: for given structures a and b and given costs, find a minimum total cost sequence of operations transforming a into b ("the shortest transformation of a into b"). Each operation corresponds to an "event", the latter being a change in the graph… Expand