Linear algorithm for a cyclic graph transformation
From MaRDI portal
Publication:669511
DOI10.1134/S1995080218090147zbMath1483.05188OpenAlexW2909795221MaRDI QIDQ669511
E. Lyubetskaya, Vassily Lyubetsky, Konstantin Yu. Gorbunov
Publication date: 15 March 2019
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080218090147
graphcyclecombinatorial problemlinear algorithmgraph rearrangementoperation costoptimization in graphs
Uses Software
Cites Work
- Unnamed Item
- Exemplar or matching: modeling DCJ problems with unequal content genome data
- Models and algorithms for genome evolution. Selected contributions based on the presentations at the MAGE conference, Montréal, Canada, August 23--26, 2013
- The minimum-cost transformation of graphs
- Multi-break rearrangements and chromosomal evolution
- A new linear time algorithm to compute the genomic distance via the double cut and join distance
- A linear algorithm for restructuring a graph
- Linear algorithm for minimal rearrangement of structures
- Combinatorial Pattern Matching