Mathematical programming strategies for solving the minimum common string partition problem

European Journal of Operational Research

Volumn 242, Issue 3, 2015, Pages 769-777

  Blum, Christian ^a,b   Lozano, José A ^a   Davidson, Pinacho ^a,c  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b BASQUE FOUNDATION FOR SCIENCE   (Spain)

^c UNIVERSIDAD SANTO TOMÁS   (Chile)

Author keywords

Heuristic; Integer linear programming; Minimum common string partition

Indexed keywords

COMBINATORIAL OPTIMIZATION; HEURISTIC PROGRAMMING;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL BIOLOGY; HEURISTIC; INTEGER LINEAR PROGRAMMING; INTEGER LINEAR PROGRAMMING MODELS; MINIMUM COMMON STRING PARTITION; OPTIMAL SOLUTIONS; PROBLEM INSTANCES;

INTEGER PROGRAMMING;

EID: 84920528755     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.10.049     Document Type: Article

References (26)

1. Blum, C., Lozano, J. A., & Pinacho Davidson, P. (2014). Iterative probabilistic tree search for the minimum common string partition problem. In M. J. Blesa, C. Blum, S. Voss (Eds.), Proceedings of HM20104- 9th international workshop on hybrid metaheuristics, Vol. 8457 of Lecture notes in computer science (p. 154). Verlag, Berlin, Germany: Springer.
2. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., et al. (2005). Computing the assignment of orthologous genes via genome rearrangement. In Proceedings of the Asia Pacific bioinformatics conference 2005 (pp. 363-378).
3. Chrobak, M., Kolman, P., & Sgall, J. (2004). The greedy algorithm for the minimum common string partition problem. In K. Jansen, S. Khanna, J. D. P. Rolim, & D. Ron (Eds.), Proceedings of APPROX 2004 - 7th international workshop on approximation algorithms for combinatorial optimization problems, Vol. 3122 of Lecture notes in computer science (pp. 84-95). Berlin Heidelberg: Springer.
4. Cormode, G., & Muthukrishnan, S. (2007). The string edit distance matching problem with moves. ACM Transactions on Algorithms, 3(2), 1-19.
5. Damaschke, P. (2008). Minimum common string partition parameterized. In K. A. Crandall, & J. Lagergren (Eds.) Proceedings of WABI 2008 - 8th international workshop on algorithms in bioinformatics, Vol. 5251 of Lecture notes in computer science (pp. 87-98). Berlin Heidelberg: Springer.
6. Ding, L., & Fu, B. (2013). Algebrization and randomization methods. In P. M. Pardalos, D.-Z. Du, & R. L. Graham (Eds.), Handbook of combinatorial optimization (pp. 171-220). New York: Springer.
7. Ferdous, S. M., & Sohel Rahman, M. (2014). A MAX-MIN ant colony system for minimum common string partition problem, CoRR abs/1401.4539, http://arxiv.org/abs/1401.4539.
8. Ferdous, S.M., Sohel Rahman, M. (2013). Solving the minimum common string partition problem with the help of ants. In Y. Tan, Y. Shi, & H. Mo (Eds.), Proceedings of ICSI 2013 - 4th international conference on advances in swarm intelligence, Vol. 7928 of Lecture notes in computer science (pp. 306-313). Berlin Heidelberg: Springer Berlin Heidelberg.
9. Fu, B., Jiang, H., Yang, B., & Zhu, B. (2011). Exponential and polynomial time algorithms for the minimum common string partition problem. In W. Wang, X. Zhu, & D.-Z. Du (Eds.), Proceedings of COCOA 2011 - 5th international conference on combinatorial optimization and applications, Vol. 6831 of Lecture notes in computer science (pp. 299-310). Berlin Heidelberg: Springer.
10. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman.
11. Goldstein, A., Kolman, P., Zheng, J. (2005). Minimum common string partition problem: Hardness and approximations. In R. Fleischer, & G. Trippen (Eds.), Proceedings of ISAAC 2004 - 15th international symposium on algorithms and computation, Vol. 3341 of lecture notes in computer science (pp. 484-495). Berlin Heidelberg: Springer.
12. Goldstein, I., Lewenstein, M. (2011). Quick greedy computation forminimum common string partitions. In R. Giancarlo, G. Manzini (Eds.), Proceedings of CPM 2011 - 22nd annual symposium on combinatorial pattern matching, Vol. 6661 of Lecture notes in computer science (pp. 273-284). Berlin Heidelberg: Springer.
13. Gusfield, D. (1997). Algorithms on strings, trees, and sequences, computer science and computational biology. Cambridge: Cambridge University Press.
14. He, D. (2007). A novel greedy algorithm for the minimum common string partition problem. In I. Mandoiu, & A. Zelikovsky (Eds.), Proceedings of ISBRA 2007 - Third international symposium on bioinformatics research and applications, Vol. 4463 of Lecture notes in computer science (pp. 441-452). Berlin Heidelberg: Springer.
15. Hsu, W. J., & Du, M. W. (1984). Computing a longest common subsequence for a set of strings. BIT Numerical Mathematics, 24(1), 45-59. doi:10.1007/BF01934514.
16. Jiang, H., Zhu, B., Zhu, D., & Zhu, H. (2012). Minimum common string partition revisited. Journal of Combinatorial Optimization, 23(4), 519-527.
17. Kaplan, H., & Shafrir, N. (2006). The greedy algorithm for edit distance with moves. Information Processing Letters, 97(1), 23-27.
18. Kolman, P. (2005). Approximating reversal distance for strings with bounded number of duplicates. In J. Jedrzejowicz, & A. Szepietowski (Eds.), Proceedings of MFCS 2005 - 30th international symposium on mathematical foundations of computer science, Vol. 3618 of Lecture notes in computer science (pp. 580-590). Berlin Heidelberg: Springer.
19. Kolman, P., & Waleń, T. (2007). Reversal distance for strings with duplicates: Linear time approximation using hitting set. In T. Erlebach, & C. Kaklamanis (Eds.), Proceedings of WAOA 2007 - 4th international workshop on approximation and online algorithms, Vol. 4368 of Lecture notes in computer science (pp. 279-289). Berlin Heidelberg: Springer.
20. Meneses, C., Oliveira, C., & Pardalos, P. (2005). Optimization techniques for string selection and comparison problems in genomics. IEEE Engineering in Medicine and Biology Magazine, 24(3), 81-87.
21. Mousavi, S., Babaie, M., & Montazerian, M. (2012). An improved heuristic for the far from most strings problem. Journal of Heuristics, 18, 239-262.
22. Pappalardo, E., Pardalos, P. M., & Stracquadanio, G. (2013). Optimization approaches for solving string selection problems. New York: Springer.
23. Rajasekaran, S., Hu, Y., Luo, J., Nick, H., Pardalos, P.M., Sahni, S., Shaw, G. (2001). Efficient algorithms for similarity search. Journal of Combinatorial Optimization, 5(1), 125-132.
24. Rajasekaran, S., Nick, H., Pardalos, P. M., Sahni, S., & Shaw, G. (2001). Efficient algorithms for local alignment search. Journal of Combinatorial Optimization, 5(1), 117-124.
25. Shapira, D., & Storer, J. A. (2002). Edit distance with move operations. In A. Apostolico, & M. Takeda (Eds.), Proceedings of CPM 2002 - 13th annual symposium on combinatorial pattern matching, Vol. 2373 of Lecture notes in computer science (pp. 85-98). Berlin Heidelberg: Springer.
26. Smith, T., & Waterman, M. (1981). Identification of common molecular subsequences. Journal of Molecular Biology, 147(1), 195-197.