DNA sequence compression using adaptive particle swarm optimization-based memetic algorithm

IEEE Transactions on Evolutionary Computation

Volumn 15, Issue 5, 2011, Pages 643-658

  Zhu, Zexuan ^a   Zhou, Jiarui ^b   Ji, Zhen ^a   Shi, Yu Hui ^c  

^a SHENZHEN UNIVERSITY   (China)

^b ZHEJIANG UNIVERSITY   (China)

^c XI AN JIAOTONG LIVERPOOL UNIVERSITY   (China)

Author keywords

Approximate repeat vector; DNA sequence compression; memetic algorithm; particle swarm optimization

Indexed keywords

APPROXIMATE REPEAT VECTOR; BENCHMARK FUNCTIONS; CODEBOOKS; COMPARISON STUDY; COMPREHENSIVE LEARNING; DNA SEQUENCE COMPRESSION; DNA SEQUENCE DATA; DNA SEQUENCING; EXPLORATION AND EXPLOITATION; FITNESS VALUES; HIGH-THROUGHPUT; LOCAL REGION; LOCAL SEARCH; MEMETIC ALGORITHM; MEMETIC ALGORITHMS; MULTIPLE SEQUENCES; OPTIMAL SOLUTIONS; OPTIMIZERS; PARTICLE SWARM; RAPID DEVELOPMENT; SEQUENCE COMPRESSION; SINGLE PARTICLE;

ALGORITHMS; DNA; GENE ENCODING; PARTICLE SWARM OPTIMIZATION (PSO);

DNA SEQUENCES;

EID: 80054701916     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2011.2160399     Document Type: Article

References (75)

1. M. L. Metzker, "Sequencing technologies: The next generation," Nat. Genet., vol. 11, no. 1, pp. 31-46, 2010.
2. M. Janitz, Next-Generation Genome Sequencing: Towards Personalized Medicine. Weinheim, Germany: Wiley-VCH, 2008.
3. S. Bennett, C. Barnes, A. Cox, L. Davies, and C. Brown, "Toward the $1000 human genome," Pharmacogenomics, vol. 6, no. 4, pp. 373-382, Jun. 2005.
4. R. Giancarlo, D. Scaturro, and F. Utro, "Textual data compression in computational biology: A synopsis," Bioinformatics, vol. 25, no. 13, pp. 1575-1586, 2009.
5. J. J. Liang, P. N. Suganthan, and K. Deb, "Novel composition test functions for numerical global optimization," in Proc. IEEE SIS, Jun. 2005, pp. 68-75.
6. J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions," IEEE Trans. Evol. Comput., vol. 10, no. 3, pp. 281-295, Jun. 2006. (Pubitemid 43821759)
7. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proc. IEEE ICNN, Nov.-Dec. 1995, pp. 1942-1948.
8. Y. Shi and R. C. Eberhart, "A modified particle swarm optimizer," in Proc. IEEE Int. CEC, May 1998, pp. 69-73.
9. J. Kennedy, "Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance," in Proc. IEEE Int. CEC, vol. 3. Jul. 1999, pp. 1931-1938.
10. J. Kennedy and R. Mendes, "Population structure and particle swarm performance," in Proc. IEEE Int. CEC, May 2002, pp. 1671-1676.
11. R. Mendes, "Population topologies and their influence in particle swarm performance," Ph.D. dissertation, Departamento de Informatica, Escola de Engenharia, Universidade do Minho, Braga, Portugal, 2004.
12. A. P. Engelbrecht, Fundamentals of Computational Swarm Intelligence, 1st ed. Chichester, U.K.: Wiley, 2005.
13. M. Clerc, Particle Swarm Optimization, 1st ed. London, U.K.: Wiley-ISTE, 2006.
14. R. Poli, J. Kennedy, and T. Blackwell, "Particle swarm optimization: An overview," Swarm Intell., vol. 1, no. 1, pp. 33-57, 2007.
15. M. A. M. de Oca, T. Stutzle, M. Birattari, and M. Dorigo, "Frankenstein's PSO: A composite particle swarm optimization algorithm," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1120-1131, Oct. 2009.
16. P. Moscato, Memetic Algorithms: A Short Introduction. London, U.K.: McGraw-Hill, 1999, pp. 219-234.
17. T. Matsumoto, K. Sadakane, and H. Imai, "Biological sequence compression algorithms," in Proc. GIW, 2000, pp. 43-52.
18. S. Grumbach and F. Tahi, "Compression of DNA sequences," in Proc. DCC, 1993, pp. 340-350.
19. S. Grumbach and F. Tahi, "A new challenge for compression algorithms: Genetic sequences," Inform. Process. Manag., vol. 30, no. 6, pp. 875-886, 1994. (Pubitemid 124012808)
20. X. Chen, S. Kwong, and M. Li, "A compression algorithm for DNA sequences and its applications in genome comparison," in Proc. 4th Annu. Int. Conf. Computat. Molecular Biol. (RECOMB), 2000, pp. 107-117.
21. X. Chen, M. Li, B. Ma, and T. John, "DNACompress: Fast and effective DNA sequence compression," Bioinformatics, vol. 18, no. 2, pp. 1696-1698, 2002. (Pubitemid 36097740)
22. G. Korodi and I. Tabus, "DNA sequence compression-based on the normalized maximum likelihood model," IEEE Signal Process. Mag., vol. 24, no. 1, pp. 47-53, Jan. 2007.
23. B. Beresford-Smith, T. Conway, S. Kuruppu, and J. Zobel, "Repetitionbased compression of large DNA datasets," in Proc. 13th Annu. Int. Conf. Res. Computat. Molecular Biol. (RECOMB), 2009, poster 16.
24. D. Loewenstern and P. N. Yianilos, "Significantly lower entropy estimates for natural DNA sequences," J. Comput. Biol., vol. 6, no. 1, pp. 125-142, 1999. (Pubitemid 29166366)
25. L. Allison, T. Edgoose, and T. I. Dix, "Compression of strings with approximate repeats," in Proc. 6th Int. Conf. ISMB, 1998, pp. 8-16.
26. M. D. Cao, T. I. Dix, L. Allison, and C. Mears, "A simple statistical algorithm for biological sequence compression," in Proc. DCC, 2007, pp. 43-52. (Pubitemid 47201856)
27. S. Kuruppu, S. J. Puglisi, and J. Zobel, "Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval," in Proc. 17th Int. Symp. SPIRE, 2010, pp. 201-206.
28. M. C. Brandon, D. C. Wallace, and P. Baldi, "Data structures and compression algorithms for genomic sequence data," Bioinformatics, vol. 25, no. 14, pp. 1731-1738, 2009.
29. S. Christley, Y. Lu, C. Li, and X. Xie, "Human genomes as email attachments," Bioinformatics, vol. 25, no. 2, pp. 274-275, Jan. 2009.
30. K. Daily, P. Rigor, S. Christley, X. Xie, and P. Baldi, "Data structures and compression algorithms for high-throughput sequencing technologies," BMC Bioinform., vol. 11, no. 1, p. 514, Oct. 2010.
31. M. H.-Y. Fritz, R. Leinonen, G. Cochrane, and E. Birney, "Efficient storage of high throughput DNA sequencing data using reference-based compression," Genome Res., vol. 21, no. 5, pp. 734-740, 2011.
32. C. Wang and D. Zhang, "A novel compression tool for efficient storage of genome resequencing data," Nucleic Acids Res., vol. 39, no. 7, p. e45, 2011.
33. C. Kozanitis, C. Saunders, S. Kruglyak, V. Bafna, and G. Varghese, "Compressing genomic sequence fragments using slimgene," in Proc. 14th Annu. Int. Conf. Res. Computat. Molecular Biol. (RECOMB), 2010, pp. 310-324.
34. S. D. Kahn, "On the future of genomic data," Science, vol. 331, no. 6018, pp. 728-729, Feb. 2011.
35. Y. S. Ong, M. H. Lim, and X. S. Chen, "Research frontier: Memetic computation: Past, present and future," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-31, May 2010.
36. B. Liu, L. Wang, and Y. H. Jin, "An effective PSO-based memetic algorithm for flow shop scheduling," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 1, pp. 18-27, Feb. 2007. (Pubitemid 46358476)
37. S. Hasan, R. Sarker, D. Essam, and D. Cornforth, "Memetic algorithms for solving job-shop scheduling problems," Memetic Comput. J., vol. 1, no. 1, pp. 69-83, 2009.
38. K. Tang, Y. Mei, and X. Yao, "Memetic algorithm with extended neighborhood search for capacitated arc routing problems," IEEE Trans. Evol. Comput., vol. 13, no. 5, pp. 1151-1166, Oct. 2009.
39. M. Tang and X. Yao, "A memetic algorithm for VLSI floorplanning," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 1, pp. 62-69, Feb. 2007. (Pubitemid 46358480)
40. H. Soh, Y. S. Ong, Q. C. Nguyen, Q. H. Nguyen, M. S. Habibullah, T. Hung, and J.-L. Kuo, "Discovering unique, low-energy pure water isomer: Memetic exploration, optimization and landscape analysis," IEEE Trans. Evol. Comput., vol. 14, no. 3, pp. 419-437, Jun. 2010.
41. R. Ruiz-Torrubiano and A. Súarez, "Hybrid approaches and dimensionality reduction for portfolio selection with cardinality constraints," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 92-107, May 2010.
42. C. Aranha and H. Iba, "The memetic tree-based genetic algorithm and its application to portfolio optimization," Memetic Comput. J., vol. 1, no. 2, pp. 139-151, 2009.
43. F. Neri and E. Mininno, "Memetic compact differential evolution for cartesian robot control," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 54-65, May 2010.
44. R. J. Meuth, E. Saad, D. Wunsch, and J. Vian, "Memetic mission management," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 32-40, May 2010.
45. L. Jiao, M. Gong, S. Wang, and B. Hou, "Natural and remote sensing image segmentation using memetic computing," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 78-91, May 2010.
46. G. Acampora, M. Gaeta, and V. Loia, "Exploring e-learning knowledge through ontological memetic agents," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 66-77, May 2010.
47. Z. Zhu, Y. S. Ong, and M. Dash, "Wrapper-filter feature selection algorithm using a memetic framework," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 1, pp. 70-76, Feb. 2007. (Pubitemid 46358481)
48. Z. Zhu, Y. S. Ong, and M. Dash, "Markov blanket embedded genetic algorithm for gene selection," Patt. Recog., vol. 40, no. 11, pp. 3236-3248, 2007. (Pubitemid 46990428)
49. Z. Zhu, S. Jia, and Z. Ji, "Towards a memetic feature selection paradigm," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 41-53, May 2010.
50. Z. Zhu, Y. S. Ong, and M. Zurada, "Simultaneous identification of full class relevant and partial class relevant genes," IEEE/ACM Trans. Comput. Biol. Bioinform., vol. 7, no. 2, pp. 263-277, Apr.-Jun. 2010.
51. S. D. Handoko, C. K. Kwoh, and Y. S. Ong, "Feasibility structure modeling: An effective chaperon for constrained memetic algorithms," IEEE Trans. Evol. Comput., vol. 14, no. 5, pp. 740-758, Oct. 2010.
52. M. N. Le, Y. S. Ong, Y. Jin, and B. Sendhoff, "Lamarckian memetic algorithms: Local optimum and connectivity structure analysis," Memetic Comput. J., vol. 1, no. 3, pp. 175-190, 2009.
53. Q. C. Nguyen, Y. S. Ong, and M. H. Lim, "A probabilistic memetic framework," IEEE Trans. Evol. Comput., vol. 13, no. 3, pp. 604-623, Jun. 2009.
54. R. Meuth, M. H. Lim, Y. S. Ong, and D. C. Wunsch, II, "A proposition on memes and meta-memes in computing for higher-order learning," Memetic Comput. J., vol. 1, no. 2, pp. 85-100, 2009.
55. Y. S. Ong, M. H. Lim, N. Zhu, and K. W. Wong, "Classification of adaptive memetic algorithms: A comparative study," IEEE Trans. Syst., Man, Cybern. B, vol. 36, no. 1, pp. 141-152, Feb. 2006. (Pubitemid 43174148)
56. T. Yoshida, H. Ishibuchi, and T. Murata, "Balance between genetic search and local search in memetic algorithm for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 204-223, Apr. 2003.
57. P. Merz, "On the performance of memetic algorithms in combinatorial optimization," in Proc. GECCO Workshop, 2001, pp. 168-173.
58. N. Krasnogor, "Studies on the theory and design space of memetic algorithms," Ph.D. dissertation, Faculty Comput., Math., Eng., Univ. West England, Bristol, U.K., 2002.
59. W. T. Koo, C. K. Goh, and K. C. Tan, "A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment," Memetic Comput. J., vol. 2, no. 2, pp. 87-110, 2010.
60. W. Jakob, "A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment," Memetic Comput. J., vol. 2, no. 3, pp. 201-218, 2010.
61. N. Krasnogor, "Memetic algorithms," in Handbook of Natural Computation (Series in Natural Computing). Berlin/Heidelberg, Germany: Springer, 2011.
62. J. S. Vesterstroøm, J. Riget, and T. Krink, "Division of labor in particle swarm optimization," in Proc. IEEE CEC, May 2002, pp. 1570-1575.
63. R. Poli and C. R. Stephens, "Constrained molecular dynamics as a search and optimization tool," in Proc. 7th Eur. Conf. Genet. Program. (EuroGP), 2004, pp. 150-161.
64. Y. Petalas, K. Parsopoulos, and M. Vrahatis, "Memetic particle swarm optimization," Ann. Oper. Res., vol. 156, no. 1, pp. 99-127, 2007.
65. D. Liu, K. C. Tan, C. K. Goh, and W. K. Ho, "A multiobjective memetic algorithm based on particle swarm optimization," IEEE Trans. Syst., Man, Cybern. B, vol. 37, no. 1, pp. 42-50, Feb. 2007. (Pubitemid 46358478)
66. S. Ono and S. Nakayama, "Multi-objective particle swarm optimization for robust optimization and its hybridization with gradient search," in Proc. IEEE CEC, May 2009, pp. 1629-1636.
67. R. Gupta, A. Mittal, and S. Gupta, "An efficient algorithm to detect palindromes in DNA sequences using periodicity transform," Signal Process., vol. 86, no. 8, pp. 2067-2073, 2006. (Pubitemid 43795458)
68. C. Bi, J. S. Leeder, and C. A. Vyhlidal, "A comparative study on computational two-block motif detection: Algorithms and applications," Mol. Pharmaceut., vol. 5, no. 1, pp. 3-16, 2008. (Pubitemid 351300030)
69. S. Wu and U. Manber, "Fast text searching: Allowing errors," Commun. ACM, vol. 35, no. 10, pp. 83-91, 1992.
70. Z. Ji, H. Liao, Y. Wang, and Q. H. Wu, "A novel intelligent particle optimizer for global optimization of multimodal functions," in Proc. IEEE CEC, Sep. 2007, pp. 3272-3275. (Pubitemid 351371819)
71. X. Yao, Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evol. Comput., vol. 3, no. 2, pp. 82-102, Jul. 1999.
72. M. Osborne. (2003). Predicting DNA Sequences Using a Backoff Language Model [Online]. Available: http://homepages.inf.ed.ac.uk/miles/dna-backoff.ps.gz
73. H. P. Schwefel, Evolution and Optimum Seeking. New York: Wiley, 1995.
74. M. J. D. Powell, "An efficient method for finding the minimum of a function of several variables without calculating derivatives," Comput. J., vol. 7, no. 4, pp. 303-307, 1964.
75. Y. S. Ong and A. Keane, "Meta-Lamarckian learning in memetic algorithm," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.