Scholarly Research Excellence

Digital Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29140


Select areas to restrict search in scientific publication database:
11991
A Hybridization of Constructive Beam Search with Local Search for Far From Most Strings Problem
Abstract:
The Far From Most Strings Problem (FFMSP) is to obtain a string which is far from as many as possible of a given set of strings. All the input and the output strings are of the same length, and two strings are said to be far if their hamming distance is greater than or equal to a given positive integer. FFMSP belongs to the class of sequences consensus problems which have applications in molecular biology. The problem is NP-hard; it does not admit a constant-ratio approximation either, unless P = NP. Therefore, in addition to exact and approximate algorithms, (meta)heuristic algorithms have been proposed for the problem in recent years. On the other hand, in the recent years, hybrid algorithms have been proposed and successfully used for many hard problems in a variety of domains. In this paper, a new metaheuristic algorithm, called Constructive Beam and Local Search (CBLS), is investigated for the problem, which is a hybridization of constructive beam search and local search algorithms. More specifically, the proposed algorithm consists of two phases, the first phase is to obtain several candidate solutions via the constructive beam search and the second phase is to apply local search to the candidate solutions obtained by the first phase. The best solution found is returned as the final solution to the problem. The proposed algorithm is also similar to memetic algorithms in the sense that both use local search to further improve individual solutions. The CBLS algorithm is compared with the most recent published algorithm for the problem, GRASP, with significantly positive results; the improvement is by order of magnitudes in most cases.
Digital Object Identifier (DOI):

References:

[1] J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, "Distinguishing string selection problems," in SODA -99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1999, pp. 633-642.
[2] J. K. Lanctot, "Some string problems in computational biology," Ph.D. dissertation, Univesity of Waterloo, 2000.
[3] J. K. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang, "Distinguishing string selection problems," Inf. Comput., vol. 185, no. 1, pp. 41-55, 2003.
[4] C. N. Meneses, C. A. S. Oliveira, and P. M. Pardalos, "Optimization techniques for string selection and comparison problems in genomics," Engineering in Medicine and Biology Magazine, IEEE, vol. 24, no. 3, pp. 81-87, May-June 2005.
[5] P. Festa, "On some optimization problems in molecular biology," Mathematical Biosciences, vol. 207, no. 2, pp. 219 - 234, 2007, bIOCOMP2005 Special Issue. (Online). Available: http://www.sciencedirect.com/science/article/B6VHX-4N0X60P- 2/2/3a9aa7c9fde1693bef0402f190eb1a36
[6] G. D. Cohen, M. G. Karpovsky, H. F. M. Jr., and J. R. Schatz, "Covering radius - survey and recent results," IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 328-343, 1985.
[7] A. J. L. Macario and E. C. de Macario, Gene probes for bacteria. Academic Press, 1990.
[8] M. Li, B. Ma, and L. Wang, "Finding similar regions in many strings," in STOC -99: Proceedings of the thirty-first annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1999, pp. 473-482.
[9] J. Gramm, F. Hffner, and R. Niedermeier, "Closest strings, primer design, and motif search," in Sixth Annual International Conference on Computational Molecular Biology, April 2002, pp. 74-75.
[10] S. T. Crooke and B. Lebleu, Antisense Research and Applications. CRC Press, 1993.
[11] M. Li, B. Ma, and L. Wang, "On the closest string and substring problem," Journal of the ACM, vol. 49, no. 2, pp. 157-171, March 2002.
[12] C. N. de Meneses, Z. Lu, C. A. S. Oliveira, and P. M. Pardalos, "Optimal solutions for the closest-string problem via integer programming," INFORMS Journal on Computing, vol. 16, no. 4, pp. 419-429, 2004.
[13] J.-C. Chen, "Iterative rounding for the closest string problem," CoRR, vol. abs/0705.0561, 2007.
[14] S. C. Sahinalp, S. Muthukrishnan, and U. Dogrus¨oz, Eds., Combinatorial Pattern Matching, 15th Annual Symposium, CPM 2004, Istanbul,Turkey, July 5-7, 2004, Proceedings, ser. Lecture Notes in Computer Science, vol. 3109. Springer, 2004.
[15] B. Ma and X. Sun, "More efficient algorithms for closest string and substring problems," in Research in Computational Molecular Biology: 12th Annual International Conference RECOMB 2008, April 2008, pp. 396-409.
[16] J. Wang, J. Chen, and J. M. Huang, "An improved lower bound on approximation algorithms for the closest substring problem," Information Processing Letters, vol. 107, no. 1, pp. 24-28, June 2008.
[17] J. Gramm, "Closest substring," in Encyclopedia of Algorithms, 2008.
[18] F. C. Gomes, C. N. de Meneses, P. M. Pardalos, and G. V. R. Viana, "A parallel multistart algorithm for the closest string problem," Computers & OR, vol. 35, no. 11, pp. 3636-3643, 2008.
[19] C. H. Cheng, C. C. Huang, S. Y. Hu, and K. Chao, "Efficient algorithms for some variants of the farthest string problem," in 21st Workshop on Combinatorial Mathematics and Computation Theory, may 2004, pp. 266-273.
[20] C. N. Meneses, P. M. Pardalos, M. G. C. Resende, and A. Vazacopoulos, "Modeling and solving string selection problems," in Second International Symposium on Mathematical and Computational Biology, December 2005, pp. 54-64.
[21] J. Gramm, J. Guo, and R. Niedermeier, "On exact and approximation algorithms for distinguishing substring selection," in FCT, 2003, pp. 195-209.
[22] J. Gramm, R. Niedermeier, and P. Rossmanith, "Fixed-parameter algorithms for closest string and related problems," Algorithmica, vol. 37, no. 1, pp. 25-42, 2003.
[23] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
[24] T. Feo and M. Resende, "A probabilistic heuristic for a computationally difficult set covering problem," Operations Research Letters, vol. 8, pp. 67-71, 1989.
[25] T. A. Feo and M. G. C. Resende, "Greedy randomized adaptive search procedures," Journal of Global Optimization, vol. 6, no. 2, pp. 109-133, 1995.
[26] P. Festa and M. Resende, "Grasp: An annotated bibliography," in Essays and Surveys on Metaheuristics. Kluwer Academic Publishers, 2002, pp. 325-367.
[27] P. Festa and M. G. C. Resende, "An annotated bibliography of GRASP; part I: Algorithms," International Transactions in Operational Research, vol. 16, no. 1, pp. 1-24, 2009.
[28] M. Babaei and S. R. Mousavi, "A memetic algorithm for closest string problem and farthest string problem," in ICEE -10: Proceedings of the 18th Iranian Conference on Electrical and Electronics Engineering, to appear. IEEE, 2010.
[29] S. R. Mousavi, M. Babaei, and M. Montazerian, "An improved heuristic for the far from most strings problem," submitted for publication.
[30] H. A. Peelle, "Euclid, fibonacci, and pascal recursed," International Journal of Mathematical Education in Science and Technology, vol. 6, no. 4, pp. 395-405, November 1975.
[31] A. W. F. Edwards, Pascal-s Arithmetical Triangle: The Story of a Mathematical Idea. Johns Hopkins University Press, 2002.

Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007