Cargando…
An Integer Programming Formulation of the Minimum Common String Partition Problem
We consider the problem of finding a minimum common string partition (MCSP) of two strings, which is an NP-hard problem. The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology. In this paper, we map the MCSP problem into a graph applyi...
Autores principales: | Ferdous, S. M., Rahman, M. Sohel |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4489654/ https://www.ncbi.nlm.nih.gov/pubmed/26134848 http://dx.doi.org/10.1371/journal.pone.0130266 |
Ejemplares similares
-
Efficient partition of integer optimization problems with one-hot encoding
por: Okada, Shuntaro, et al.
Publicado: (2019) -
Large deviations for integer partitions
por: Dembo, A, et al.
Publicado: (1998) -
Efficient Minimum Flow Decomposition via Integer Linear Programming
por: Dias, Fernando H.C., et al.
Publicado: (2022) -
Combinatorics and Statistical Mechanics of Integer Partitions
por: Matsoukas, Themis
Publicado: (2023) -
On Approximability of Minimum Bisection and Related Partition Problems
por: Karpinski, M
Publicado: (2003)