Rearranjo de genomas : algoritmos e complexidade

This thesis discusses events of genome rearrangements problems: transposition, breakpoint, block interchange, short block move, and the restricted multi break. We consider problems of sorting, closest permutation, and the diameter. We develop approximation algorithms, NP-completeness and properties...

Full description

Saved in:
Bibliographic Details
Main Author: Cunha, Luís Felipe Ignácio
Format: Tese
Language:Português
Published: Universidade Federal do Rio de Janeiro 2017-03
Subjects:
Engenharia de Sistemas e Computação
Rearranjo de genomas
Algoritmos aproximativos
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
Online Access:http://hdl.handle.net/11422/8705
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items