Linear algorithm for a cyclic graph transformation

DOI10.1134/S1995080218090147MaRDI QIDQ669511zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

graphcyclecombinatorial problemlinear algorithmgraph rearrangementoperation costoptimization in graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A linear algorithm for restructuring a graph
• Linear algorithm for minimal rearrangement of structures
• The minimum-cost transformation of graphs
• Sorting by Cuts, Joins and Whole Chromosome Duplications
• A new linear time algorithm to compute the genomic distance via the double cut and join distance

Cites work

• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• A linear algorithm for restructuring a graph
• A new linear time algorithm to compute the genomic distance via the double cut and join distance
• Combinatorial Pattern Matching
• Exemplar or matching: modeling DCJ problems with unequal content genome data
• Linear algorithm for minimal rearrangement of structures
• Models and algorithms for genome evolution. Selected contributions based on the presentations at the MAGE conference, Montréal, Canada, August 23--26, 2013
• Multi-break rearrangements and chromosomal evolution
• The minimum-cost transformation of graphs

Cited in

(3)

• Linear algorithm for minimal rearrangement of structures
• scientific article; zbMATH DE number 6297714 (Why is no real title available?)
• The minimum-cost transformation of graphs

Describes a project that uses

Uses Software

• ChromoGGL

This page was built for publication: Linear algorithm for a cyclic graph transformation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669511)