Use este identificador para citar ou linkar para este item: https://rd.uffs.edu.br/handle/prefix/9403
Registro completo de metadados
Campo DCValorIdioma
dc.contributor.advisor1Braga, Andrei de Almeida Sampaio-
dc.creatorBruel, Laura Mesquita-
dc.date2026-06-25-
dc.date.accessioned2026-07-21T17:14:11Z-
dc.date.available2026-
dc.date.available2026-07-21T17:14:11Z-
dc.date.issued2026-
dc.identifier.urihttps://rd.uffs.edu.br/handle/prefix/9403-
dc.description.resumoThe MinimumCommon StringPartition Problem(MCSP)consistsoffindingaminimum common partition between two related strings. This problem has applications in Computational Biology, wherein a string can represent a genome. The MCSP and its variants, which consider relevant information from genomes, are NP-hard and have already been addressed using heuristics and integer linear programming (ILP). There are ILP models that have been successfully applied to the MCSP and adaptations of these models to solve its variants have shown great results. Motivated by these results, in this paper, a Graph-Based ILP model to the MCSP was adapted to solve the Unbalanced Minimum Common String Partition Problem (UMCSP).Theexperimental results show that the adapted model can be similar or outperform existing ILP models to the UMCSP.pt_BR
dc.description.provenanceSubmitted by Biblioteca Chapeco (biblio.ch@uffs.edu.br) on 2026-07-21T15:53:02Z No. of bitstreams: 1 BRUEL.pdf: 646824 bytes, checksum: 57fccf5c85cb8820a3de0f21ba6de094 (MD5)en
dc.description.provenanceApproved for entry into archive by DIONE ROSSI FARIAS (dione@uffs.edu.br) on 2026-07-21T17:14:11Z (GMT) No. of bitstreams: 1 BRUEL.pdf: 646824 bytes, checksum: 57fccf5c85cb8820a3de0f21ba6de094 (MD5)en
dc.description.provenanceMade available in DSpace on 2026-07-21T17:14:11Z (GMT). No. of bitstreams: 1 BRUEL.pdf: 646824 bytes, checksum: 57fccf5c85cb8820a3de0f21ba6de094 (MD5) Previous issue date: 2026en
dc.languageporpt_BR
dc.publisherUniversidade Federal da Fronteira Sulpt_BR
dc.publisher.countryBrasilpt_BR
dc.publisher.departmentCampus Chapecópt_BR
dc.publisher.initialsUFFSpt_BR
dc.rightsAcesso Abertopt_BR
dc.subjectProgramação linearpt_BR
dc.subjectSolução de problemaspt_BR
dc.titleA graph-based integer linear programming model for the unbalanced minimum common string partition problempt_BR
dc.typeMonografiapt_BR
Aparece nas coleções:Ciência da Computação

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
BRUEL.pdf631,66 kBAdobe PDFVisualizar/Abrir
Mostrar registro simples do item Recomendar este item Visualizar estatísticas


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.