Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Other literature type 01 Jan 2014Publisher:Springer International Publishing

Authors: Christian Blum 0001; José Antonio Lozano 0001; Pedro Pinacho Davidson;

doi: 10.1007/978-3-319-07644-7_11

Iterative Probabilistic Tree Search for the Minimum Common String Partition Problem

- Summary
- Metrics

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.

Related Organizations

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average