{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:20:49Z","timestamp":1758266449846},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T00:00:00Z","timestamp":1400284800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T00:00:00Z","timestamp":1400284800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00521-014-1609-x","type":"journal-article","created":{"date-parts":[[2014,5,16]],"date-time":"2014-05-16T06:58:03Z","timestamp":1400223483000},"page":"1285-1292","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A self-adaptive intelligent single-particle optimizer compression algorithm"],"prefix":"10.1007","volume":"25","author":[{"given":"Jie","family":"Zeng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,17]]},"reference":[{"key":"1609_CR1","doi-asserted-by":"publisher","first-page":"D19","DOI":"10.1093\/nar\/gkn765","volume":"37","author":"G Cochrane","year":"2009","unstructured":"Cochrane G, Akhtar R, Bonfield J et al (2009) Petabyte-scale innovations at the European nucleotide archive. Nucleic Acids Res 37:D19\u2013D25","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"1609_CR2","first-page":"25","volume":"11","author":"PR Rajeswari","year":"2010","unstructured":"Rajeswari PR, Apparao A (2010) GenBit compress\u2014algorithm for repetitive and non-repetitive DNA sequences. J Theor Appl Inf Technol 11(1):25\u201329","journal-title":"J Theor Appl Inf Technol"},{"key":"1609_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/0306-4573(94)90014-0","volume":"30","author":"S Grumbach","year":"1994","unstructured":"Grumbach S, Tahi F (1994) A new challenge for compression algorithms: genetic sequences. Inf Process Manage 30:875\u2013886","journal-title":"Inf Process Manage"},{"key":"1609_CR4","doi-asserted-by":"crossref","unstructured":"Chen X, Kwong S, Li M (2000) A compression algorithm for DNA sequences and its applications in genome comparison. In: Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, ACM Press, Tokyo, pp 51\u201361","DOI":"10.1145\/332306.332352"},{"key":"1609_CR5","first-page":"43","volume":"11","author":"T Matsumoto","year":"2000","unstructured":"Matsumoto T, Sadakane K, Imai H (2000) Biological sequence compression algorithms. Genome Inform 11:43\u201352","journal-title":"Genome Inform"},{"key":"1609_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/MSP.2007.273055","volume":"24","author":"G Korodi","year":"2007","unstructured":"Korodi G, Tabus I (2007) DNA sequence compression-based on the normalized maximum likelihood model. IEEE Signal Process Mag 24:47\u201353","journal-title":"IEEE Signal Process Mag"},{"key":"1609_CR7","doi-asserted-by":"crossref","unstructured":"Ouyang J, Feng P, Kang J (2012) Fast compression of huge DNA sequence data. In: Proceedings of 5th International Conference on Biomedical Engineering and Informatics, IEEE Computer Society, Xi\u2019an, pp 885\u2013888","DOI":"10.1109\/BMEI.2012.6512909"},{"key":"1609_CR8","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc. IEEE ICNN, Nov.\u2013Dec. pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"1609_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1(1):33\u201357","journal-title":"Swarm Intell"},{"issue":"5","key":"1609_CR10","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/TEVC.2009.2021465","volume":"13","author":"MAM de Oca","year":"2009","unstructured":"de Oca MAM, Stutzle T, Birattari M, Dorigo M (2009) Frankenstein\u2019s PSO: a composite particle swarm optimization algorithm. IEEE Trans Evol Comput 13(5):1120\u20131131","journal-title":"IEEE Trans Evol Comput"},{"key":"1609_CR11","doi-asserted-by":"publisher","first-page":"556","DOI":"10.3724\/SP.J.1016.2010.00556","volume":"33","author":"Z Ji","year":"2010","unstructured":"Ji Z, Zhou JR et al (2010) A novel intelligent single particle optimizer. Chin J Comput 33:556\u2013561","journal-title":"Chin J Comput"},{"key":"1609_CR12","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Part 1 (of 6), IEEE Press, Perth, pp 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"1609_CR13","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1016\/j.sigpro.2005.10.008","volume":"86","author":"R Gupta","year":"2006","unstructured":"Gupta R, Mittal A et al (2006) An efficient algorithm to detect palindromes in DNA sequences using periodicity transform. Signal Process 86:2067\u20132073","journal-title":"Signal Process"},{"key":"1609_CR14","doi-asserted-by":"crossref","unstructured":"Tran TT, Emanuele VA, Zhou GT (2004) Techniques for detecting approximate tandem repeats in DNA. In: Proceedings of international conference on acoustics, speech and signal processing, IEEE Press, Montreal, pp 449\u2013452","DOI":"10.1109\/ICASSP.2004.1327144"},{"issue":"10","key":"1609_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S Wu","year":"1992","unstructured":"Wu S, Manber U (1992) Fast text searching: allowing errors. Commun ACM 35(10):83\u201391","journal-title":"Commun ACM"},{"key":"1609_CR16","doi-asserted-by":"crossref","unstructured":"Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In: Proceedings of IEEE swarm intelligence symposium, pp 68\u201375","DOI":"10.1109\/SIS.2005.1501604"},{"key":"1609_CR17","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE International Congress on Evolutionary Computation, pp 69\u201373","DOI":"10.1109\/ICEC.1998.699146"},{"issue":"3","key":"1609_CR18","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang JJ, Qin AK, Suganthan PN, Baskar S (2006) Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans Evolut Comput 10(3):281\u2013295","journal-title":"IEEE Trans Evolut Comput"},{"issue":"6","key":"1609_CR19","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/TEVC.2010.2052054","volume":"15","author":"ZH Zhan","year":"2011","unstructured":"Zhan ZH, Zhang J, Li Y et al (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evolut Comput 15(6):832\u2013847","journal-title":"IEEE Trans Evolut Comput"},{"key":"1609_CR20","unstructured":"Osborne M (2000) Predicting DNA sequences using a backoff language model. http:\/\/www.cogsci.ed.ac.uk\/osborne\/dna-backoff.ps.gz"},{"key":"1609_CR21","doi-asserted-by":"publisher","first-page":"D25","DOI":"10.1093\/nar\/gkm929","volume":"36","author":"DA Benson","year":"2008","unstructured":"Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2008) GenBank. Nucleic Acids Res 36:D25\u2013D30","journal-title":"Nucleic Acids Res"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1609-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-014-1609-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1609-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-014-1609-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T18:43:45Z","timestamp":1684867425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-014-1609-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,17]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1609"],"URL":"https:\/\/doi.org\/10.1007\/s00521-014-1609-x","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,17]]},"assertion":[{"value":"31 October 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2014","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2014","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}