Skip to main content
SpringerLink
Log in
Book cover

Handbook of Heuristics pp 1221–1240Cite as

Selected String Problems

  • Reference work entry
  • First Online:

  • 4137 Accesses

Abstract

This chapter overviews some string selection and comparison problems, with special emphasis on the optimization and operational research perspective. It also proposes a simple and efficient ILP-based heuristic that can be used for any of the considered problems.

This is a preview of subscription content, 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   999.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,199.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

Learn about institutional subscriptions

References

  1. Blum C, Festa P (2014) A hybrid ant colony optimization algorithm for the far from most string problem. In: Proceedings of the 14th European conference on evolutionary computation in combinatorial optimisation (EvoCOP2014). Lecture notes in computer science, vol 8600. Springer, Berlin, pp 1–12

    Google Scholar 

  2. Boucher C, Landau G, Levy A, Pritchard D, Weimann O (2013) On approximating string selection problems with outliers. Theor Comput Sci 498:107–114

    Google Scholar 

  3. Croce FD, Garraffa M (2014) The selective fixing algorithm for the closest string problem. Comput Oper Res 41:24–30

    Google Scholar 

  4. Croce FD, Salassa F (2012) Improved lp-based algorithms for the closest string problem. Comput Oper Res 39:746–749

    Google Scholar 

  5. Ferone D, Festa P, Resende M (2013) Hybrid metaheuristics for the far from most string problem. In: Proceedings of 8th international workshop on hybrid metaheuristics. Lecture notes in computer science, vol 7919. Springer, Berlin, pp 174–188

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  8. Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Reading, Massachusetts, Addison-Wesley

    Google Scholar 

  9. Gramm J (2003) Fixed-parameter algorithms for the consensus analysis of genomic data. Eberhard Karls University of Tübingen, PhD thesis

    Google Scholar 

  10. Gramm J, Hüffner F, Niedermeier R (2002) Closest strings, primer design, and motif search. In: Sixth annual international conference on computational molecular biology, Washington, DC, pp 74–75

    Google Scholar 

  11. Gramm J, Niedermeier R, Rossmanith P (2003) Fixed-parameter algorithms for closest string and related problems. Algorithmica 37:25–42

    Article  MathSciNet  Google Scholar 

  12. Holland JH (1975) Adaptation in natural and artificial systems. Cambridge, Massachusetts, MIT Press

    Google Scholar 

  13. Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Stat Phys 34(5–6):975–986

    Article  MathSciNet  Google Scholar 

  14. Lanctot J (2004) Some string problems in computational biology. University of Waterloo, PhD thesis

    Google Scholar 

  15. Lanctot J, Li M, Ma B, Wang S, Zhang L (1999) Distinguishing string selection problems. In: Proceedings of the annual ACM-SIAM symposium on discrete aLgorithms (SODA), Baltimore, pp 633–642

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  17. Li M, Ma B, Wang L (1999) Finding similar regions in many strings. In: ACM symposium on theory of computing (STOC’99), New York, pp 473–482

    Google Scholar 

  18. Liu X, He H, Sýkora O (2005) Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In: Proceedings of ADMA 2005. Lecture notes in artificial intelligence, vol 3584. Springer, Berlin Heidelberg New York, pp 591–597

    Google Scholar 

  19. Liu X, Liu S, Hao Z, Mauch H (2011) Exact algorithm and heuristic for the closest string problem. Comput Oper Res 38(11):1513–1520

    Article  MathSciNet  Google Scholar 

  20. Ma B, Sun X (2008) More efficient algorithms for closest string and substring problems. Lecture notes in computer science, vol 4955. Springer, Berlin, pp 396–409

    Google Scholar 

  21. Macario A, de Macario EC (eds) (1990) Gene probes for bacteria. Academic Press, San Diego

    Google Scholar 

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

    Article  Google Scholar 

  23. Meneses C, Pardalos P, Resende M, Vazacopoulos A (2005) Modeling and solving string selection problems. In: Proceedings of the 2005 international symposium on mathematical and computational biology (BIOMAT 2005), pp 55–65

    Google Scholar 

  24. Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller E (1953) Equation of state calculations by fast computing machines. J Chem Phys 21(6):1087–1092

    Article  Google Scholar 

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

    Article  Google Scholar 

  26. Pardalos P, Oliveira C, Lu Z, Meneses C (2004) Optimal solutions for the closest string problem via integer programming. INFORMS J Comput 16:419–429

    Article  MathSciNet  Google Scholar 

  27. Roman S (1992) Coding and information theory. Graduate texts in mathematics, vol 134. Springer, New York

    Google Scholar 

  28. Sim J, Park K (1999) The consensus string problem for a metric is NP-complete. In: Proceedings of the annual Australasian workshop on combinatorial algorithms (AWOCA), pp 107–113

    Google Scholar 

  29. Tanaka S (2012) A heuristic algorithm based on Lagrangian relaxation for the closest string problem. Comput Oper Res 39:709–717

    Article  MathSciNet  Google Scholar 

  30. Wang L, Zhu B (2009) Efficient algorithms for the closest string and distinguishing string selection problems. Lecture notes in computer science, vol 5598. Springer, Berlin, pp 261–270

    Google Scholar 

  31. Zörnig P (2011) Improved optimization modelling for the closest string and related problems. Appl Math Modell 35(12):5609–5617

    Article  MathSciNet  Google Scholar 

  32. Zörnig P (2015) Reduced-size integer linear programming models for string selection problems: application to the farthest string problem. J Comput Biol 22(8):729–742

    Article  Google Scholar 

Download references

Acknowledgements

C. Blum was supported by project TIN2012-37930 of the Spanish Government. In addition, support is acknowledged from IKERBASQUE (Basque Foundation for Science).

Author information

Authors and Affiliations

  1. Artificial Intelligence Research Institute (IIIA), Spanish National Research Council (CSIC), Bellaterra, Spain

    Christian Blum

  2. Department of Mathematics and Applications “R. Caccioppoli”, University of Napoli FEDERICO II, Napoli, Italy

    Paola Festa

Authors
  1. Christian Blum
    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

Corresponding author

Correspondence to Christian Blum .

Editor information

Editors and Affiliations

  1. Statistics and Operations Research Department, University of Valencia, Valencia, Spain

    Rafael Martí

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

    Panos M. Pardalos

  3. Amazon.com, Inc. and University of Washington, Seattle, Washington, USA

    Mauricio G. C. Resende

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Blum, C., Festa, P. (2018). Selected String Problems. In: Martí, R., Pardalos, P., Resende, M. (eds) Handbook of Heuristics. Springer, Cham. https://doi.org/10.1007/978-3-319-07124-4_58

Download citation

Publish with us

Policies and ethics

Search

Navigation