{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:14:11Z","timestamp":1725538451857},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049200"},{"type":"electronic","value":"9783642049217"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04921-7_7","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T07:46:25Z","timestamp":1253605585000},"page":"62-71","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Common Superstring Problem with Discrete Neural Networks"],"prefix":"10.1007","author":[{"given":"D.","family":"L\u00f3pez-Rodr\u00edguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"M\u00e9rida-Casermeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1,2","key":"7_CR1","first-page":"153","volume":"73","author":"L. Ilie","year":"2006","unstructured":"Ilie, L., Popescu, C.: The shortest common superstring problem and viral genome compression. Fundamenta Informaticae\u00a073(1,2), 153\u2013164 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"7_CR2","volume-title":"Computational Molecular Biology, Sources and Methods for Sequence Analysis","author":"A. Lesk","year":"1988","unstructured":"Lesk, A.: Computational Molecular Biology, Sources and Methods for Sequence Analysis. Oxford University Press, Oxford (1988)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Li, M.: Towards a dna sequencing theory (learning a string). In: Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 125\u2013134 (1990)","DOI":"10.1109\/FSCS.1990.89531"},{"key":"7_CR4","unstructured":"Peltola, H., Soderlund, H., Tarhio, J., Ukkonen, E.: Algorithms for some string matching problems arising in molecular genetics. In: Proc. IFIP Congress, pp. 53\u201364 (1983)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-540-30500-2_10","volume-title":"Implementation and Application of Automata","author":"M. Daley","year":"2005","unstructured":"Daley, M., McQuillan, I.: Viral gene compression: complexity and verification. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004, vol.\u00a03317, pp. 102\u2013112. Springer, Heidelberg (2005)"},{"key":"7_CR6","volume-title":"Data Compression: Methods and Theory","author":"J. Storer","year":"1988","unstructured":"Storer, J.: Data Compression: Methods and Theory. Computer Science Press, Rockville (1988)"},{"key":"7_CR7","volume-title":"A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. In: Garey, M.R., Johnson, D.S. (eds.) A guide to the theory of NP-Completeness, W. H. Freeman and Company, New York (1979)"},{"key":"7_CR8","unstructured":"Maier, D., Storer, J.: A note on the complexity of the superstring problem. In: Proceedings of the 12th Annual Conference on Information Science and Systems, pp. 52\u201356 (1978)"},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1145\/179812.179818","volume":"41","author":"A. Blum","year":"1994","unstructured":"Blum, A., Jiang, T., Li, M., Tromp, J., Yannakakis, M.: Linear approximation of shortest superstring. Journal of the ACM\u00a041(4), 630\u2013647 (1994)","journal-title":"Journal of the ACM"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: 33rd Annual Symposium on Foundations of Computer Science, pp. 14\u201323 (1992)","DOI":"10.1109\/SFCS.1992.267823"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(89)90044-8","volume":"83","author":"J. Turner","year":"1989","unstructured":"Turner, J.: Approximation algorithms for the sortest common superstring problem. Information and Computation\u00a083(1), 1\u201320 (1989)","journal-title":"Information and Computation"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, T., Jiang, Z., Breslauer, D.: Rotation of periodic strings and short superstrings. In: Proc. 3rd South American Conference on String Processing (1996)","DOI":"10.7146\/brics.v3i21.19984"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1137\/S0097539796324661","volume":"29","author":"Z. Sweedyk","year":"1999","unstructured":"Sweedyk, Z.: A $2\\frac{1}{2}$ -approximation algorithm for shortest superstring. SIAM Journal of Computing\u00a029, 954\u2013986 (1999)","journal-title":"SIAM Journal of Computing"},{"key":"7_CR14","unstructured":"Andrejkov, G., Levick, M., Oravec, J.: Approximation of shortest common superstring using neural networks. In: Proc. of 7th International Conference on Electronic Computers and Informatics, pp. 90\u201395 (2006)"},{"key":"7_CR15","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"J. Hopfield","year":"1985","unstructured":"Hopfield, J., Tank, D.: Neural computation of decisions in optimization problems. Biological Cybernetics\u00a052, 141\u2013152 (1985)","journal-title":"Biological Cybernetics"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1012751230791","volume":"14","author":"E. M\u00e9rida-Casermeiro","year":"2001","unstructured":"M\u00e9rida-Casermeiro, E., Gal\u00e1n-Mar\u00edn, G., Mu\u00f1oz-P\u00e9rez, J.: An efficient multivalued hopfield network for the travelling salesman problem. Neural Processing Letters\u00a014, 203\u2013216 (2001)","journal-title":"Neural Processing Letters"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-44868-3_52","volume-title":"Computational Methods in Neural Modeling","author":"E. M\u00e9rida-Casermeiro","year":"2003","unstructured":"M\u00e9rida-Casermeiro, E., Mu\u00f1oz-P\u00e9rez, J., Dom\u00ednguez-Merino, E.: An n-parallel multivalued network: Applications to the travelling salesman problem. In: Mira, J., \u00c1lvarez, J.R. (eds.) IWANN 2003. LNCS, vol.\u00a02686, pp. 406\u2013413. Springer, Heidelberg (2003)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/11494669_141","volume-title":"Computational Intelligence and Bioinspired Systems","author":"E. M\u00e9rida-Casermeiro","year":"2005","unstructured":"M\u00e9rida-Casermeiro, E., L\u00f3pez-Rodr\u00edguez, D.: Graph partitioning via recurrent multivalued neural networks. In: Cabestany, J., Prieto, A.G., Sandoval, F. (eds.) IWANN 2005. LNCS, vol.\u00a03512, pp. 1149\u20131156. Springer, Heidelberg (2005)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/11840930_62","volume-title":"Artificial Neural Networks \u2013 ICANN 2006","author":"D. L\u00f3pez-Rodr\u00edguez","year":"2006","unstructured":"L\u00f3pez-Rodr\u00edguez, D., M\u00e9rida-Casermeiro, E., Ortiz-de-Lazcano-Lobato, J.M., L\u00f3pez-Rubio, E.: Image compression by vector quantization with recurrent discrete networks. In: Kollias, S.D., Stafylopatis, A., Duch, W., Oja, E. (eds.) ICANN 2006. LNCS, vol.\u00a04132, pp. 595\u2013605. Springer, Heidelberg (2006)"},{"key":"7_CR20","unstructured":"M\u00e9rida-Casermeiro, E.: Red Neuronal recurrente multivaluada para el reconocimiento de patrones y la optimizaci\u00f3n combinatoria. Ph. D thesis, Universidad de M\u00e1laga (2000)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Hopfield, J.: Neural networks and physical systems with emergent collective computational abilities, vol.\u00a079, pp. 2254\u20132558 (1982)","DOI":"10.1073\/pnas.79.8.2554"},{"key":"7_CR22","unstructured":"Ozturk, Y., Abut, H.: System of associative relationships (soar) (1997)"},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1016\/0893-6080(96)00016-0","volume":"9","author":"M.H. Erdem","year":"1996","unstructured":"Erdem, M.H., Ozturk, Y.: A new family of multivalued networks. Neural Networks\u00a09(6), 979\u2013989 (1996)","journal-title":"Neural Networks"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-45720-8_62","volume-title":"Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence","author":"E. M\u00e9rida","year":"2001","unstructured":"M\u00e9rida, E., Mu\u00f1oz, J., Ben\u00edtez, R.: A recurrent multivalued neural network for the N-queens problem. In: Mira, J., Prieto, A.G. (eds.) IWANN 2001, vol.\u00a02084, pp. 522\u2013529. Springer, Heidelberg (2001)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1007\/978-3-540-74695-9_84","volume-title":"Artificial Neural Networks \u2013 ICANN 2007","author":"D. L\u00f3pez-Rodr\u00edguez","year":"2007","unstructured":"L\u00f3pez-Rodr\u00edguez, D., M\u00e9rida-Casermeiro, E., Ortiz-de-Lazcano-Lobato, J.M., Gal\u00e1n-Mar\u00edn, G.: k-pages graph drawing with multivalued neural networks. In: de S\u00e1, J.M., Alexandre, L.A., Duch, W., Mandic, D.P. (eds.) ICANN 2007. LNCS, vol.\u00a04669, pp. 816\u2013825. Springer, Heidelberg (2007)"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s11063-007-9047-8","volume":"26","author":"G. Gal\u00e1n-Mar\u00edn","year":"2007","unstructured":"Gal\u00e1n-Mar\u00edn, G., M\u00e9rida-Casermeiro, E., L\u00f3pez-Rodr\u00edguez, D.: Improving neural networks for mechanism kinematic chain isomorphism identification. Neural Processing Letters\u00a026, 133\u2013143 (2007)","journal-title":"Neural Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04921-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T17:26:47Z","timestamp":1685122007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04921-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049200","9783642049217"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04921-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}