Skip to main content
SpringerLink
Log in
SpringerLink
Log in

On the Far from Most String Problem, One of the Hardest String Selection Problems

  • Conference paper
  • First Online:
Dynamics of Information Systems

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 105))

  • 627 Accesses

Abstract

This paper describes the far from most string problem, one of the computationally hardest string selection problems that has found its way into numerous practical applications, especially in computational biology and bioinformatics, where one is interested in computing distance/proximity among biological sequences, creating diagnostic probes for bacterial infections, and/or discovering potential drug targets.With special emphasis on the optimization and operational research perspective, this paper studies the intrinsic properties of the problem and overviews the most popular solution techniques, including some recently proposed heuristic and metaheuristic approaches. Future directions are discussed in the last section.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343–373 (2002)

    Article  MATH  Google Scholar 

  2. Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50–58 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Optim. 6, 109–133 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ferone, D., Festa, P., Resende, M.G.C.: Hybrid metaheuristics for the far from most string problem. In: Proceedings of 8th International Workshop on Hybrid Metaheuristics, Lecture Notes in Computer Science, Springer, vol. 7919, pp. 174–188 (2013)

    Google Scholar 

  6. Ferone, D., Festa, P., Resende, M.G.C.: Hybrid metaheuristics for the far from most string problem. Technical Report, Department of Mathematics and Applications, University of Napoli FEDERICO II (2013)

    Google Scholar 

  7. Festa, P.: On some optimization problems in molecular biology. Math. Biosc. 207(2), 219–234 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Festa, P., Resende, M.G.C.: GRASP: an annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer Academic Publishers, Norwell (2002)

    Chapter  Google Scholar 

  9. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP: part I: algorithms. Int. Trans. Oper. Res. 16(1), 1–24 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP: part II: applications. Int. Trans. Oper. Res. 16(2), 131–172 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Festa, P., Resende, M.G.C.: Hybrid GRASP heuristics. Stud. Comput. Intell. 203, 75–100 (2009)

    Google Scholar 

  12. Festa, P., Resende, M.G.C.: GRASP: basic components and enhancements. Telecommun. Syst. 46(3), 253–271 (2011)

    Article  Google Scholar 

  13. Festa, P., Resende, M.G.C.: Hybridizations of GRASP with path-relinking. Stud. Comput. Intell. 434, 135–155 (2013)

    Article  Google Scholar 

  14. Festa, P., Pardalos, P.M., Resende, M.G.C., Ribeiro, C.C.: Randomized heuristics for the MAX-CUT problem. Optim. Meth. Software 7, 1033–1058 (2002)

    Article  MathSciNet  Google Scholar 

  15. Festa, P., Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C.: GRASP with path-relinking for the weighted MAXSAT problem. ACM J. Exp. Algorithmics 11, 1–16 (2006)

    MathSciNet  Google Scholar 

  16. Frances, M., Litman, A.: On covering problems of codes. Theor. Comput. Syst. 30(2), 113–119 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  17. Glover, F.: Tabu search and adaptive memory programing: advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic Publishers, New York (1996)

    Google Scholar 

  18. Glover, F.: Multi-start and strategic oscillation methods: principles to exploit adaptive memory. In Laguna, M., Gonzáles-Velarde, J.L. (eds.) Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pp. 1–24. Kluwer Academic Publishers, Norwell (2000)

    Chapter  Google Scholar 

  19. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  MATH  Google Scholar 

  20. Glover, F., Laguna, M., Martí, R.: Fundamentals of scatter search and path relinking. Contr. Cybern. 39, 653–684 (2000)

    Google Scholar 

  21. Hansen, P., Mladenović, N.: Developments of variable neighborhood search. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 415–439. Kluwer Academic Publishers, Norwell (2002)

    Chapter  Google Scholar 

  22. Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107–114 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  23. Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44–52 (1999)

    Article  MATH  Google Scholar 

  24. Lanctot, J., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation, Elsevier 185(1), 41–55 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  25. Lanctot, J., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41–55 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498–516 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  27. Meneses, C.N., Oliveira, C.A.S., Pardalos, P.M.: Optimization techniques for string selection and comparison problems in genomics. IEEE Eng. Med. Biol. Mag. 24(3), 81–87 (2005)

    Article  Google Scholar 

  28. Mousavi, S.R., Babaie, M., Montazerian, M.: An improved heuristic for the far from most strings problem. J. Heuristics 18, 239–262 (2012)

    Article  Google Scholar 

  29. Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) State-of-the-Art Handbook of Metaheuristics. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  30. Ribeiro, C.C., Rosseti, I., Vallejos, R.: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Global Optim. 54, 405–429 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  31. Sim, J.S., Park, K.: The consensus string problem for a metric is NP-complete. J. Discrete Algorithms. 1(1), 111–117 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Applications, University of Napoli FEDERICO II, Compl. MSA, Via Cintia, 80126, Napoli, Italy

    Daniele Ferone & Paola Festa

  2. AT&T Labs Research, Florham Park, NJ, USA

    Mauricio G. C. Resende

Authors
  1. Daniele Ferone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paola Festa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mauricio G. C. Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Paola Festa .

Editor information

Editors and Affiliations

  1. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Chrysafis Vogiatzis

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Jose L. Walteros

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ferone, D., Festa, P., Resende, M.G.C. (2014). On the Far from Most String Problem, One of the Hardest String Selection Problems. In: Vogiatzis, C., Walteros, J., Pardalos, P. (eds) Dynamics of Information Systems. Springer Proceedings in Mathematics & Statistics, vol 105. Springer, Cham. https://doi.org/10.1007/978-3-319-10046-3_7

Download citation

Publish with us

Policies and ethics

Search

Navigation