Skip to main content
Erschienen in: Soft Computing 4/2013

01.04.2013 | Original Paper

Self-configuration single particle optimizer for DNA sequence compression

verfasst von: Zhen Ji, Jiarui Zhou, Zexuan Zhu, Siping Chen

Erschienen in: Soft Computing | Ausgabe 4/2013

Einloggen

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

search-config
loading …

Abstract

This paper presents a novel self-configuration single particle optimizer (SCSPO) for DNA sequence compression. Particularly, SCSPO searches an optimal compression codebook of all unique repeat patterns and then DNA sequences are compressed by replacing the duplicate fragments with the indexes of the corresponding matched code vectors in the codebook. Featured with a crucial self-configuration process, SCSPO optimizes the codebook with no predefined parameter settings required. Experimental results on benchmark numerical functions and real-world DNA sequences demonstrate that SCSPO is capable of attaining better fitness value than many other PSO variants and the proposed DNA sequence compression algorithm based on SCSPO attains encouraging compression performance.

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

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!

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!

Literatur
Zurück zum Zitat Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2008) GenBank. Nucl Acids Res 36:D25–D30CrossRef Benson DA, Karsch-Mizrachi I, Lipman DJ, Ostell J, Rapp BA, Wheeler DL (2008) GenBank. Nucl Acids Res 36:D25–D30CrossRef
Zurück zum Zitat Chen X, Kwong S, Li M (1999) A compression algorithm for DNA sequences and its applications in genome comparison. In: Proceedings of the 10th workshop on genome informatics, pp 51–61 Chen X, Kwong S, Li M (1999) A compression algorithm for DNA sequences and its applications in genome comparison. In: Proceedings of the 10th workshop on genome informatics, pp 51–61
Zurück zum Zitat Chen X, Li M, Ma B, Tromp J (2002) DNACompress: fast and effective DNA sequence compression. Bioinformatics 18(12):1696–1698CrossRef Chen X, Li M, Ma B, Tromp J (2002) DNACompress: fast and effective DNA sequence compression. Bioinformatics 18(12):1696–1698CrossRef
Zurück zum Zitat Galperin MY, Cochrane GR (2009) Petabyte-scale innovations at the European nucleotide archive. Nucl Acids Res 37:D1–D4CrossRef Galperin MY, Cochrane GR (2009) Petabyte-scale innovations at the European nucleotide archive. Nucl Acids Res 37:D1–D4CrossRef
Zurück zum Zitat Gao Y, Xie SL (2004) Chaos particle swarm optimization algorithm. Comput Sci 31(8):13–15 Gao Y, Xie SL (2004) Chaos particle swarm optimization algorithm. Comput Sci 31(8):13–15
Zurück zum Zitat Grumbach S, Tahi F (1994) A new challenge for compression algorithms: genetic Sequences. Inf Process Manag 30(6):875–886MATHCrossRef Grumbach S, Tahi F (1994) A new challenge for compression algorithms: genetic Sequences. Inf Process Manag 30(6):875–886MATHCrossRef
Zurück zum Zitat Gupta R, Mittal A, Gupta S (2006) An efficient algorithm to detect palindromes in DNA sequences using periodicity transform. Signal Process 86(8):2067–2073MATHCrossRef Gupta R, Mittal A, Gupta S (2006) An efficient algorithm to detect palindromes in DNA sequences using periodicity transform. Signal Process 86(8):2067–2073MATHCrossRef
Zurück zum Zitat Ji Z, Zhou JR, Liao HL, Wu QH (2010) A novel intelligent single particle optimizer. Chin J Comput 33(3):556–561CrossRef Ji Z, Zhou JR, Liao HL, Wu QH (2010) A novel intelligent single particle optimizer. Chin J Comput 33(3):556–561CrossRef
Zurück zum Zitat Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948 Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
Zurück zum Zitat Korodi G, Tabus I (2007) DNA sequence compression-based on the normalized maximum likelihood model. IEEE Signal Process Mag 24(1):47–53CrossRef Korodi G, Tabus I (2007) DNA sequence compression-based on the normalized maximum likelihood model. IEEE Signal Process Mag 24(1):47–53CrossRef
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
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 Evol 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 Evol Comput 10(3):281–295CrossRef
Zurück zum Zitat Ma B, Tromp J, Li M (2002) PatternHunter—faster and more sensitive homology search. Bioinformatics 18(3):440–445CrossRef Ma B, Tromp J, Li M (2002) PatternHunter—faster and more sensitive homology search. Bioinformatics 18(3):440–445CrossRef
Zurück zum Zitat Matsumoto T, Sadakane K, Imai H (2000) Biological sequence compression algorithms. In: Proceedings of genome informatics workshop, pp 43–52 Matsumoto T, Sadakane K, Imai H (2000) Biological sequence compression algorithms. In: Proceedings of genome informatics workshop, pp 43–52
Zurück zum Zitat Salomon D, Motta G, Bryant D (2006) Data compression: the complete reference, 4th edn. Springer, America Salomon D, Motta G, Bryant D (2006) Data compression: the complete reference, 4th edn. Springer, America
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
Zurück zum Zitat Srinivasa KG, Jagadish M, Venugopal KR and Patnaik LM (2006) Efficient compression of non-repetitive DNA sequences using dynamic programming. In: Proceedings of the international conference on advanced computing and communications, pp 569–574 Srinivasa KG, Jagadish M, Venugopal KR and Patnaik LM (2006) Efficient compression of non-repetitive DNA sequences using dynamic programming. In: Proceedings of the international conference on advanced computing and communications, pp 569–574
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, 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, pp 449–452
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
Zurück zum Zitat Zhan ZH, Zhang J, Li Y, Shi YH (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847CrossRef Zhan ZH, Zhang J, Li Y, Shi YH (2011) Orthogonal learning particle swarm optimization. IEEE Trans Evol Comput 15(6):832–847CrossRef
Zurück zum Zitat Zhou JR, Ji Z, Huang WG, Tian T (2010) Face recognition using gabor wavelet and self-adaptive intelligent single particle optimizer. In: Proceedings of Chinese conference on pattern recognition, pp 1–5 Zhou JR, Ji Z, Huang WG, Tian T (2010) Face recognition using gabor wavelet and self-adaptive intelligent single particle optimizer. In: Proceedings of Chinese conference on pattern recognition, pp 1–5
Metadaten
Titel
Self-configuration single particle optimizer for DNA sequence compression
verfasst von
Zhen Ji
Jiarui Zhou
Zexuan Zhu
Siping Chen
Publikationsdatum
01.04.2013
Verlag
Springer-Verlag
Erschienen in
Soft Computing / Ausgabe 4/2013
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-012-0939-9

Weitere Artikel der Ausgabe 4/2013

Soft Computing 4/2013 Zur Ausgabe

Premium Partner