Data compression: methods and theory
Data compression: methods and theory
Computational molecular biology
Computational molecular biology
Approximation algorithms for the shortest common superstring problem
Information and Computation
Linear approximation of shortest superstrings
Journal of the ACM (JACM)
A new family of multivalued networks
Neural Networks
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem
Neural Processing Letters
A Recurrent Multivalued Neural Network for the N-Queens Problem
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
The Shortest Common Superstring Problem and Viral Genome Compression
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Improving Neural Networks for Mechanism Kinematic Chain Isomorphism Identification
Neural Processing Letters
Towards a DNA sequencing theory (learning a string)
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
An N-parallel multivalued network: applications to the travelling salesman problem
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
K-pages graph drawing with multivalued neural networks
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Image compression by vector quantization with recurrent discrete networks
ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
Graph partitioning via recurrent multivalued neural networks
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
Viral gene compression: complexity and verification
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
In this paper, we investigate the use of artificial neural networks in order to solve the Shortest Common Superstring Problem. Concretely, the neural network used in this work is based on a multivalued model, MREM, very suitable for solving combinatorial optimization problems. We describe the foundations of this neural model, and how it can be implemented in the context of this problem, by taking advantage of a better representation than in other models, which, in turn, contributes to ease the computational dynamics of the model. Experimental results prove that our model outperforms other heuristic approaches known from the specialized literature.