Skip to main content
Erschienen in: Neural Computing and Applications 6/2014

01.11.2014 | Original Article

A self-adaptive intelligent single-particle optimizer compression algorithm

verfasst von: Jie Zeng

Erschienen in: Neural Computing and Applications | Ausgabe 6/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents a self-adaptive intelligent single-particle optimizer (AdpISPO) for DNA sequence data compression codebook design. Featured with the crucial self-adaptive optimization process, AdpISPO is capable of attaining better fitness value than most existing particle swarm optimization variants with no specific parameters required. A novel DNA sequence data compression algorithm, namely BioSqueezer, is proposed in this paper. Introducing all the unique data features in constructing the compression codebook, BioSqueezer compresses DNA sequences by replacing similar fragments with the index of its corresponding code vector. For attaining higher compression ratio, the AdpISPO is employed in BioSqueezer for the codebook design. Experimental results on benchmark DNA sequences demonstrate that BioSqueezer attains better performance than other state-of-the-art DNA compression algorithms.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Cochrane G, Akhtar R, Bonfield J et al (2009) Petabyte-scale innovations at the European nucleotide archive. Nucleic Acids Res 37:D19–D25CrossRef Cochrane G, Akhtar R, Bonfield J et al (2009) Petabyte-scale innovations at the European nucleotide archive. Nucleic Acids Res 37:D19–D25CrossRef
2.
Zurück zum Zitat Rajeswari PR, Apparao A (2010) GenBit compress—algorithm for repetitive and non-repetitive DNA sequences. J Theor Appl Inf Technol 11(1):25–29 Rajeswari PR, Apparao A (2010) GenBit compress—algorithm for repetitive and non-repetitive DNA sequences. J Theor Appl Inf Technol 11(1):25–29
3.
Zurück zum Zitat Grumbach S, Tahi F (1994) A new challenge for compression algorithms: genetic sequences. Inf Process Manage 30:875–886CrossRefMATH Grumbach S, Tahi F (1994) A new challenge for compression algorithms: genetic sequences. Inf Process Manage 30:875–886CrossRefMATH
4.
Zurück zum Zitat 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–61 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–61
5.
Zurück zum Zitat Matsumoto T, Sadakane K, Imai H (2000) Biological sequence compression algorithms. Genome Inform 11:43–52 Matsumoto T, Sadakane K, Imai H (2000) Biological sequence compression algorithms. Genome Inform 11:43–52
6.
Zurück zum Zitat Korodi G, Tabus I (2007) DNA sequence compression-based on the normalized maximum likelihood model. IEEE Signal Process Mag 24:47–53CrossRef Korodi G, Tabus I (2007) DNA sequence compression-based on the normalized maximum likelihood model. IEEE Signal Process Mag 24:47–53CrossRef
7.
Zurück zum Zitat 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’an, pp 885–888 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’an, pp 885–888
8.
Zurück zum Zitat Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc. IEEE ICNN, Nov.–Dec. pp 1942–1948 Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proc. IEEE ICNN, Nov.–Dec. pp 1942–1948
9.
Zurück zum Zitat Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1(1):33–57CrossRef Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization: an overview. Swarm Intell 1(1):33–57CrossRef
10.
Zurück zum Zitat de Oca MAM, Stutzle T, Birattari M, Dorigo M (2009) Frankenstein’s PSO: a composite particle swarm optimization algorithm. IEEE Trans Evol Comput 13(5):1120–1131CrossRef de Oca MAM, Stutzle T, Birattari M, Dorigo M (2009) Frankenstein’s PSO: a composite particle swarm optimization algorithm. IEEE Trans Evol Comput 13(5):1120–1131CrossRef
11.
Zurück zum Zitat Ji Z, Zhou JR et al (2010) A novel intelligent single particle optimizer. Chin J Comput 33:556–561CrossRef Ji Z, Zhou JR et al (2010) A novel intelligent single particle optimizer. Chin J Comput 33:556–561CrossRef
12.
Zurück zum Zitat 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–1948 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–1948
13.
Zurück zum Zitat Gupta R, Mittal A et al (2006) An efficient algorithm to detect palindromes in DNA sequences using periodicity transform. Signal Process 86:2067–2073CrossRefMATH Gupta R, Mittal A et al (2006) An efficient algorithm to detect palindromes in DNA sequences using periodicity transform. Signal Process 86:2067–2073CrossRefMATH
14.
Zurück zum Zitat 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–452 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–452
15.
Zurück zum Zitat Wu S, Manber U (1992) Fast text searching: allowing errors. Commun ACM 35(10):83–91CrossRef Wu S, Manber U (1992) Fast text searching: allowing errors. Commun ACM 35(10):83–91CrossRef
16.
Zurück zum Zitat Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In: Proceedings of IEEE swarm intelligence symposium, pp 68–75 Liang JJ, Suganthan PN, Deb K (2005) Novel composition test functions for numerical global optimization. In: Proceedings of IEEE swarm intelligence symposium, pp 68–75
17.
Zurück zum Zitat Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE International Congress on Evolutionary Computation, pp 69–73 Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of IEEE International Congress on Evolutionary Computation, pp 69–73
18.
Zurück zum Zitat 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–295CrossRef 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–295CrossRef
19.
Zurück zum Zitat Zhan ZH, Zhang J, Li Y et al (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evolut Comput 15(6):832–847CrossRef Zhan ZH, Zhang J, Li Y et al (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evolut Comput 15(6):832–847CrossRef
21.
Zurück zum Zitat Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2008) GenBank. Nucleic Acids Res 36:D25–D30CrossRef Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2008) GenBank. Nucleic Acids Res 36:D25–D30CrossRef
Metadaten
Titel
A self-adaptive intelligent single-particle optimizer compression algorithm
verfasst von
Jie Zeng
Publikationsdatum
01.11.2014
Verlag
Springer London
Erschienen in
Neural Computing and Applications / Ausgabe 6/2014
Print ISSN: 0941-0643
Elektronische ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-014-1609-x

Weitere Artikel der Ausgabe 6/2014

Neural Computing and Applications 6/2014 Zur Ausgabe