Multiplicatively Exact Algorithms for Transformation and Reconstruction of Directed Path-Cycle Graphs with Repeated Edges
Abstract: For any weighted directed path-cycle graphs, a and b (referred to as structures), and any equal costs of operations (intermergings and duplication), we obtain an algorithm which, by successively applying these operations to a, outputs b if the first structure contains no paralogs (i [...]
2010 ◽
Vol E93-A
(8)
◽
pp. 1497-1507
◽
Keyword(s):
2016 ◽
Vol 38
(1)
◽
pp. A614-A630
◽
2000 ◽
Vol 105
(3)
◽
pp. 659-676
◽