Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Alexsandro Oliveira Alexandrino"'
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-23 (2021)
Abstract The rearrangement distance is a method to compare genomes of different species. Such distance is the number of rearrangement events necessary to transform one genome into another. Two commonly studied events are the transposition, which exch
Externí odkaz:
https://doaj.org/article/16d33df80d2b4bb590d4661c343bcd69
Autor:
Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino, Carla Negri Lintzmayer, Zanoni Dias
Publikováno v:
Algorithms, Vol 14, Iss 6, p 175 (2021)
Understanding how different two organisms are is one question addressed by the comparative genomics field. A well-accepted way to estimate the evolutionary distance between genomes of two organisms is finding the rearrangement distance, which is the
Externí odkaz:
https://doaj.org/article/9208aeb2357148d5ae2f62898239ba9e
Autor:
Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
Publikováno v:
Journal of Computational Biology.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3c7a408d8689b70833fb583ba75c85f
https://doi.org/10.1089/cmb.2023.0087
https://doi.org/10.1089/cmb.2023.0087
Autor:
Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias
Publikováno v:
Journal of Bioinformatics and Computational Biology. 21
Genome rearrangement events are widely used to estimate a minimum-size sequence of mutations capable of transforming a genome into another. The length of this sequence is called distance, and determining it is the main goal in genome rearrangement di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b91e3360fa52fc3ac257086322316c41
https://doi.org/10.1142/s0219720023500099
https://doi.org/10.1142/s0219720023500099
Autor:
Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Géraldine Jean, Guillaume Fertin, Ulisses Dias, Zanoni Dias
Publikováno v:
Journal of Combinatorial Optimization. 45
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e088bab38387b1423be5b6b091c6ce33
https://doi.org/10.1007/s10878-022-00937-z
https://doi.org/10.1007/s10878-022-00937-z
Autor:
Alexsandro Oliveira Alexandrino, Klairton Lima Brito, Andre Rodrigues Oliveira, Ulisses Dias, Zanoni Dias
Publikováno v:
IEEE/ACM transactions on computational biology and bioinformatics.
Recent works on genome rearrangements have shown that incorporating intergenic region information along with gene order in models provides better estimations for the rearrangement distance than using gene order alone. The reversal distance is one of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4f70a0fbfe26cc561281803729d6e41
https://pubmed.ncbi.nlm.nih.gov/36260590
https://pubmed.ncbi.nlm.nih.gov/36260590
Publikováno v:
Journal of Computational Biology. 28:235-247
The rearrangement distance is a well-known problem in the field of comparative genomics. Given two genomes, the rearrangement distance is the minimum number of rearrangements in a set of allowed rearrangements (rearrangement model), which transforms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfcc8ab96dce3fa57549e21f32c4abbc
https://doi.org/10.1089/cmb.2020.0121
https://doi.org/10.1089/cmb.2020.0121
Autor:
Klairton Lima Brito, Andre Rodrigues Oliveira, Alexsandro Oliveira Alexandrino, Ulisses Dias, Zanoni Dias
Publikováno v:
Procedia Computer Science. 195:21-29
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1377eecbd8d78499d80150a0af6068b3
https://doi.org/10.1016/j.procs.2021.11.007
https://doi.org/10.1016/j.procs.2021.11.007
Autor:
Zanoni Dias, Carla Negri Lintzmayer, Guilherme Henrique Santos Miranda, Alexsandro Oliveira Alexandrino
Publikováno v:
Journal of Combinatorial Optimization. 41:579-602
Comparative genomics is a field of biology that aims at comparing genomes of different species. One major question of this field is to find the evolutionary distance between two given genomes. One way to estimate such distance is to use the rearrange
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ca00464cb15042f615f0b405a6cde15a
https://doi.org/10.1007/s10878-020-00673-2
https://doi.org/10.1007/s10878-020-00673-2
Publikováno v:
Journal of Universal Computer Science, Vol 26, Iss 9, Pp 1076-1094 (2020)
JUCS-Journal of Universal Computer Science 26(9): 1076-1094
JUCS-Journal of Universal Computer Science 26(9): 1076-1094
One of the main challenges in Computational Biology is to find the evolutionary distance between two organisms. In the field of comparative genomics, one way to estimate such distance is to find a minimum cost sequence of rearrangements (large scale
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6846746403547897b6ba93cb868f5fc9
https://lib.jucs.org/article/24107/download/xml/
https://lib.jucs.org/article/24107/download/xml/