Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Gustavo Rodrigues Galvão"'
Publikováno v:
IEEE/ACM Transactions on Computational Biology and Bioinformatics
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2017, 14 (3), pp.620-633. ⟨10.1109/TCBB.2016.2515594⟩
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017, 14 (3), pp.620-633. ⟨10.1109/TCBB.2016.2515594⟩
IEEE/ACM Transactions on Computational Biology and Bioinformatics, Institute of Electrical and Electronics Engineers, 2017, 14 (3), pp.620-633. ⟨10.1109/TCBB.2016.2515594⟩
IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2017, 14 (3), pp.620-633. ⟨10.1109/TCBB.2016.2515594⟩
International audience; We consider the problem of sorting a circular permutation by super short reversals (i.e., reversals of length at most 2), aproblem that finds application in comparative genomics. Polynomial-time solutions to the unsigned versi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3aa7af368d4856ef0a07e57fa9445abb
https://doi.org/10.1109/tcbb.2016.2515594
https://doi.org/10.1109/tcbb.2016.2515594
Autor:
Zanoni Dias, Gustavo Rodrigues Galvão
Publikováno v:
Anais do XXIX Concurso de Teses e Dissertações (CTD 2016).
The problem of finding the minimum sequence of rearrangements that transforms one genome into another is a well-studied problem that finds application in comparative genomics. Representing genomes as permutations, in which genes appear as elements, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40d79da38fb9384a2c42f11129f486fb
https://doi.org/10.5753/ctd.2016.9145
https://doi.org/10.5753/ctd.2016.9145
Publikováno v:
Proceedings of the 11th International Symposium on Bioinformatics Research and Applications (ISBRA 2015)
11th International Symposium on Bioinformatics Research and Applications
11th International Symposium on Bioinformatics Research and Applications, Jun 2015, Norfolk, Virginia, United States. pp.272-283, ⟨10.1007/978-3-319-19048-8_23⟩
Bioinformatics Research and Applications ISBN: 9783319190471
ISBRA
11th International Symposium on Bioinformatics Research and Applications
11th International Symposium on Bioinformatics Research and Applications, Jun 2015, Norfolk, Virginia, United States. pp.272-283, ⟨10.1007/978-3-319-19048-8_23⟩
Bioinformatics Research and Applications ISBN: 9783319190471
ISBRA
International audience; We consider the problem of sorting a circular permutation by reversals of length at most 2, a problem that finds application in comparative genomics. Polynomial-time solutions for the unsigned version of this problem are known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee1aac7fed0ae8c3b6e93c358ed0cae6
https://inria.hal.science/hal-01316993/file/SortingSignedCircularPermutationsBySuperShortReversals_author_version.pdf
https://inria.hal.science/hal-01316993/file/SortingSignedCircularPermutationsBySuperShortReversals_author_version.pdf
Publikováno v:
Algorithms for Molecular Biology : AMB
Background During evolution, global mutations may alter the order and the orientation of the genes in a genome. Such mutations are referred to as rearrangement events, or simply operations. In unichromosomal genomes, the most common operations are re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e43f0b59d33ddcab33b65e36eac3539
http://europepmc.org/articles/PMC4383228
http://europepmc.org/articles/PMC4383228
Autor:
Zanoni Dias, Gustavo Rodrigues Galvão
Publikováno v:
ACM Journal of Experimental Algorithmics. 19
We consider the combinatorial problem of sorting a permutation using a minimum number of rearrangement events, which finds application in the estimation of evolutionary distance between species. Many variants of this problem, which we generically ref
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be94d17b4d549277258c539b75712683
https://doi.org/10.1145/2661633
https://doi.org/10.1145/2661633
Autor:
Zanoni Dias, Gustavo Rodrigues Galvão
Publikováno v:
Repositório Institucional da Unicamp
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
BCB
Repositório da Produção Científica e Intelectual da Unicamp
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
BCB
Repositório da Produção Científica e Intelectual da Unicamp
Agradecimentos: This work was made possible by a PhD Fellowship from CNPq to GRG (number 142260/2014-2) and by project fundings from CNPq to ZD (numbers 306730/2012-0, 477692/201 2-5, and 483370/2013-4). The authors also thank the Center for Computat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::63e352c5756ed12015414e537e8d39e5
Autor:
Gustavo Rodrigues Galvão
Publikováno v:
Biblioteca Digital de Teses e Dissertações da Universidade Estadual de Campinas (UNICAMP)
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Universidade Estadual de Campinas (UNICAMP)
instacron:UNICAMP
Orientador: Zanoni Dias Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação Resumo: Ao longo da evolução, mutações globais podem alterar a ordem dos genes de um genoma. Tais mutações são chamadas de eventos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::471cf194a2be303538cc92bc560088b9
Autor:
Zanoni Dias, Gustavo Rodrigues Galvão
Publikováno v:
Advances in Bioinformatics and Computational Biology ISBN: 9783642319266
BSB
BSB
We study the problem of sorting by transpositions, which is related to comparative genomics. Our goal is to determine how good approximation algorithms which do not rely on the cycle graph are when it comes to approximation ratios by implementing thr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bf1b12a14546e68f9865357c149ba19
https://doi.org/10.1007/978-3-642-31927-3_3
https://doi.org/10.1007/978-3-642-31927-3_3
Autor:
Gustavo Rodrigues Galvão, Zanoni Dias
Publikováno v:
SAC
We consider the problem of computing rearrangement distance of every permutation in the symmetric group Sn and present a simple algorithm for doing it. By analysing the rearrangement distance distribution computed for different scenarios, we were abl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d25af143f7921b9a1d7c1a00b1245017
https://doi.org/10.1145/1982185.1982212
https://doi.org/10.1145/1982185.1982212
Publikováno v:
Journal of Bioinformatics and Computational Biology. 12:1450012
In this paper, we present a general heuristic for several problems in the genome rearrangement field. Our heuristic does not solve any problem directly, it is rather used to improve the solutions provided by any non-optimal algorithm that solve them.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::214f48afa5a6a2e2374f40cfb38dd392
https://doi.org/10.1142/s0219720014500127
https://doi.org/10.1142/s0219720014500127