Element Duplication Centre Problem and Railroad Tracks Recognition

In this paper we describe an approach to solve the element duplication centre problem. Our approach is based on constructing logical models for considered problem.

[1]  V. Y. Popov,et al.  Multiple genome rearrangement by swaps and by element duplications , 2007, Theor. Comput. Sci..

[2]  A. Gorbenko,et al.  Planning a Typical Working Day for Indoor Service Robots , 2011 .

[3]  Anna Gorbenko,et al.  On the Optimal Reconfiguration Planning for Modular Self-Reconfigurable DNA Nanomechanical Robots , 2012 .

[4]  Richard S. Zemel,et al.  Learning to Segment Images Using Dynamic Feature Binding , 1991, Neural Computation.

[5]  Alberto Caprara,et al.  Formulations and hardness of multiple sorting by reversals , 1999, RECOMB.

[6]  Anna Gorbenko,et al.  The problem of placement of visual landmarks , 2011 .

[7]  Andrey Sheka,et al.  Localization on Discrete Grid Graphs , 2012 .

[8]  W. Ewens,et al.  The chromosome inversion problem , 1982 .

[9]  Anna Gorbenko,et al.  Programming for Modular Reconfigurable Robots , 2011 .

[10]  Anna Gorbenko,et al.  The Problem of Sensor Placement , 2012 .

[11]  Alberto Caprara,et al.  Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..

[12]  A. J. Radcliffe,et al.  Reversals and Transpositions Over Finite Alphabets , 2005 .

[13]  Vladimir Yu. Popov,et al.  The set of parameterized k-covers problem , 2012, Theor. Comput. Sci..

[14]  Haim Kaplan,et al.  Faster and simpler algorithm for sorting signed permutations by reversals , 1997, SODA '97.

[15]  Raymond Lister,et al.  Sorting Circular Permutations by Reversal. , 2003, WADS.

[16]  Ron Shamir,et al.  The median problems for breakpoints are NP-complete , 1998, Electron. Colloquium Comput. Complex..

[17]  Robert W. Irving,et al.  Sorting Strings by Reversals and by Transpositions , 2001, SIAM J. Discret. Math..