Linear algorithm for minimal rearrangement of structures

DOI10.1134/S0032946017010057MaRDI QIDQ1752297zbMATH OpenOpenAlexFDO

Authors Konstantin Yu. Gorbunov, Vassily Lyubetsky

Publication date 24 May 2018

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0032946017010057

zbMATH Keywords

graphrearrangementlinear algorithmgenetic structure

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Recommendations

• A linear algorithm for restructuring a graph
• Linear algorithm for a cyclic graph transformation
• Transposition rearrangement: linear algorithm for length-cost model
• Genome rearrangements: a correct algorithm for optimal capping
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement

Cites work

• scientific article; zbMATH DE number 1306890 (Why is no real title available?)
• Multi-break rearrangements and chromosomal evolution

Cited in

(4)

• Weighted Minimum-Length Rearrangement Scenarios.
• A linear algorithm for restructuring a graph
• Near-Regular Structure Discovery Using Linear Programming
• Linear algorithm for a cyclic graph transformation

Describes a project that uses

Uses Software

• ChromoGGL

This page was built for publication: Linear algorithm for minimal rearrangement of structures

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