Skip to main content
SpringerLink
Log in

Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem

  • Conference paper
Hybrid Metaheuristics (HM 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8457))

Included in the following conference series:

Abstract

The minimum common string partition problem is an NP-hard combinatorial optimization problem with applications in computational biology. In this work we propose an iterative probabilistic tree search algorithm for tackling this problem. By means of an extensive experimental evaluation we show the superiority of our approach in comparison to a standard greedy algorithm and a metaheuristic based on ant colony optimization from the related literature.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Blum, C., Puchinger, J., Raidl, G., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing 11(6), 4135–4151 (2011)

    Article  Google Scholar 

  2. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., Jiang, T.: Computing the assignment of orthologous genes via genome rearrangement. In: Proceedings of the Asia Pacific Bioinformatics Conference 2005, pp. 363–378 (2005)

    Google Scholar 

  3. 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.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 84–95. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Cormode, G., Muthukrishnan, S.: The string edit distance matching problem with moves. ACM Transactions on Algorithms 3(2), 1–19 (2007)

    Article  MathSciNet  Google Scholar 

  5. 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)

    Chapter  Google Scholar 

  6. Ferdous, S.M., Rahman, M.S.: Solving the minimum common string partition problem with the help of ants. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part I. LNCS, vol. 7928, pp. 306–313. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

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

    Google Scholar 

  8. Fu, B., Jiang, H., Yang, B., Zhu, B.: Exponential and polynomial time algorithms for the minimum common string partition problem. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 299–310. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. 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)

    Chapter  Google Scholar 

  10. Goldstein, I., Lewenstein, M.: Quick greedy computation for minimum common string partitions. In: Giancarlo, R., Manzini, G. (eds.) CPM 2011. LNCS, vol. 6661, pp. 273–284. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  11. Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)

    Book  MATH  Google Scholar 

  12. He, D.: A novel greedy algorithm for the minimum common string partition problem. In: Măndoiu, I.I., Zelikovsky, A. (eds.) ISBRA 2007. LNCS (LNBI), vol. 4463, pp. 441–452. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  13. Hsu, W.J., Du, M.W.: Computing a longest common subsequence for a set of strings. BIT Numerical Mathematics 24(1), 45–59 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jiang, H., Zhu, B., Zhu, D., Zhu, H.: Minimum common string partition revisited. Journal of Combinatorial Optimization 23(4), 519–527 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. Kaplan, H., Shafrir, N.: The greedy algorithm for edit distance with moves. Information Processing Letters 97(1), 23–27 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  16. Kolman, P.: Approximating reversal distance for strings with bounded number of duplicates. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 580–590. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Kolman, P., Waleń, T.: Reversal distance for strings with duplicates: Linear time approximation using hitting set. In: Erlebach, T., Kaklamanis, C. (eds.) WAOA 2006. LNCS, vol. 4368, pp. 279–289. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. Meneses, C., Oliveira, C., Pardalos, P.: Optimization techniques for string selection and comparison problems in genomics. IEEE Engineering in Medicine and Biology Magazine 24(3), 81–87 (2005)

    Article  Google Scholar 

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

    Article  Google Scholar 

  20. Shapira, D., Storer, J.A.: Edit distance with move operations. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol. 2373, pp. 85–98. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Smith, T., Waterman, M.: Identification of common molecular subsequences. Journal of Molecular Biology 147(1), 195–197 (1981)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Artifical Intelligence, University of the Basque Country UPV/EHU, San Sebastian, Spain

    Christian Blum, José A. Lozano & Pedro Pinacho Davidson

  2. IKERBASQUE, Basque Foundation for Science, Bilbao, Spain

    Christian Blum

  3. Escuela de Informática, Universidad Santo Tomás, Concepción, Chile

    Pedro Pinacho Davidson

Authors
  1. Christian Blum
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José A. Lozano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pedro Pinacho Davidson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Jordi Girona 1-3, edif. Omega, 08034, Barcelona, Spain

    Maria J. Blesa

  2. Dept. of Computer Science, IKERBASQUE and University of the Basque Country, Paseo Manuel Lardizabal 1, 20018, Donostia, Spain

    Christian Blum

  3. Dept. of Business and Informatics, University of Hamburg, Institute of Information Systems, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Blum, C., Lozano, J.A., Pinacho Davidson, P. (2014). Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem. In: Blesa, M.J., Blum, C., Voß, S. (eds) Hybrid Metaheuristics. HM 2014. Lecture Notes in Computer Science, vol 8457. Springer, Cham. https://doi.org/10.1007/978-3-319-07644-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07644-7_11

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07643-0

  • Online ISBN: 978-3-319-07644-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation