RT Conference Proceedings
T1 Integer Linear Programming for Sequence Problems: A general approach to reduce the problem size
A1 Zörnig, Peter
K1 Programación lineal
AB Sequence problems belong to the most challenging interdisciplinary topicsof the actuality. They are ubiquitous in science and daily life and occur, forexample, in form of DNA sequences encoding all information of anorganism, as a text (natural or formal) or in form of a computer program.Therefore, sequence problems occur in many variations in computationalbiology (drug development), coding theory, data compression, quantitativeand computational linguistics (e.g. machine translation).In recent years appeared some proposals to formulate sequenceproblems like the closest string problem (CSP) and the farthest stringproblem (FSP) as an Integer Linear Programming Problem (ILPP). In thepresent talk we present a general novel approach to reduce the size of theILPP by grouping isomorphous columns of the string matrix together. Theapproach is of practical use, since the solution of sequence problems is verytime consuming, in particular when the sequences are long.
YR 2016
FD 2016-09-21
LK http://hdl.handle.net/10630/12059
UL http://hdl.handle.net/10630/12059
LA eng
NO Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.
DS RIUMA. Repositorio Institucional de la Universidad de Málaga
RD 20 ene 2026