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

References

SHOWING 1-10 OF 23 REFERENCES
A linear algorithm for the shortest transformation of graphs with different operation costs
  • 7
  • Highly Influential
  • PDF
A Generalized Cost Model for DCJ-Indel Sorting
  • 6
DCJ-Indel sorting revisited
  • 27
  • PDF
On the family-free DCJ distance and similarity
  • 19
Algorithms for reconstruction of chromosomal structures
  • 14
DCJ-indel and DCJ-substitution distances with distinct operation costs
  • 13
  • PDF
Transforming men into mice (polynomial algorithm for genomic distance problem)
  • S. Hannenhalli, P. Pevzner
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
  • 346
  • Highly Influential
Chromosome structures: reduction of certain problems with unequal gene content and gene paralogs to integer linear programming
  • 9
...
1
2
3
...