Solving the minimum common string partition problem with the help of ants

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7928 LNCS, Issue PART 1, 2013, Pages 306-313

  Ferdous, S M ^a   Rahman, M Sohel ^a  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

Author keywords

Ant Colony Optimization; Combinatorial Optimization; Genome sequencing; String partition; Stringology; Swarm Intelligence

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; GENOME COMPARISON; GENOME SEQUENCING; MAX-MIN ANT SYSTEM; META-HEURISTIC TECHNIQUES; MINIMUM COMMON STRING PARTITION; STRINGOLOGY; SWARM INTELLIGENCE;

ANT COLONY OPTIMIZATION; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION;

ARTIFICIAL INTELLIGENCE;

EID: 84884887745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38703-6_36     Document Type: Conference Paper

References (11)

1. Dorigo, M., Di Caro, G., Gambardella, M.L.: Ant algorithms for discrete optimization. J. of Artificial Life 5(2), 137-172 (1999)
2. Dorigo, M., Gambardella, M.L.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. J. of IEEE Transactions on Evolutionary Computation 1 (1996)
3. Stuetzle, T., Hoos, H.H.: MAX-MIN Ant System. J. of Future Gener. Comput. System 16(9), 889-914 (2000)
4. Watterson, G.A., Ewens, W.J., Hall, T.E., Morgan, A.: The chromosome inversion problem. Journal of Theoretical Biology 99, 7 (1982)
5. Goldstein, A., Kolman, P., Zheng, J.: Minimum common string partition problem: Hardness and approximations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 484-495. Springer, Heidelberg (2004)
6. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Assignment of orthologous genes via genome rearrangement (2004) (submitted)
7. Damaschke, P.: Minimum Common String Partition Parameterized. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 87-98. Springer, Heidelberg (2008)
8. Chrobak, M., Kolman, P., Sgall, J.: The greedy algorithm for the minimum common string partition problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX and RANDOM 2004. LNCS, vol. 3122, pp. 84-95. Springer, Heidelberg (2004)
9. Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 45-52. Springer, Heidelberg (2010)
10. Stothard, P.: The Sequence Manipulation Suite: JavaScript programs for analyzing and formatting protein and DNA sequences. Biotechniques 28, 1102-1104 (2000)
11. Villesen, P.: FaBox: an online fasta sequence toolbox (2007), http://www.birc.au.dk/software/fabox