Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Fábio V. Martinez"'
Publikováno v:
Algorithms for Molecular Biology, Vol 16, Iss 1, Pp 1-16 (2021)
Abstract Background A classical problem in comparative genomics is to compute the rearrangement distance, that is the minimum number of large-scale rearrangements required to transform a given genome into another given genome. The traditional approac
Externí odkaz:
https://doaj.org/article/d286cf411eee4526b09bcaca19587e86
Publikováno v:
BMC Genomics, Vol 21, Iss S2, Pp 1-11 (2020)
Abstract Background Computationally inferred ancestral genomes play an important role in many areas of genome research. We present an improved workflow for the reconstruction from highly diverged genomes such as those of plants. Results Our work reli
Externí odkaz:
https://doaj.org/article/dd5ae9b9c0b3433ba95766c24c1d6aa6
Publikováno v:
BMC Bioinformatics, Vol 19, Iss S6, Pp 31-42 (2018)
Abstract Background The genomic similarity is a large-scale measure for comparing two given genomes. In this work we study the (NP-hard) problem of computing the genomic similarity under the DCJ model in a setting that does not assume that the genes
Externí odkaz:
https://doaj.org/article/a77b39417949404393504d35df9e3ccf
Publikováno v:
Discrete Applied Mathematics. 332:135-154
Sequence comparison is a basic task to capture similarities and differences between two or more sequences of symbols, with countless applications such as in computational biology. An alignment is a way to compare sequences, where a giving scoring fun
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5efd77732d85922eb9c8c091b5e3ecfb
https://doi.org/10.1016/j.dam.2023.02.011
https://doi.org/10.1016/j.dam.2023.02.011
Autor:
Helmuth O.M. Silva, Diego P. Rubert, Eloi Araujo, Eckhard Steffen, Daniel Doerr, Fábio V. Martinez
Publikováno v:
RAIRO - Operations Research. 57:1045-1058
Ancestral reconstruction is a classic task in comparative genomics. Here, we study the genome median problem, a related computational problem which, given a set of three or more genomes, asks to find a new genome that minimizes the sum of pairwise di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::987abfef651b0a561fd2057b99482cc5
https://doi.org/10.1051/ro/2023052
https://doi.org/10.1051/ro/2023052
Additional file 1. Supplementary material on the model and on the experiments, including supplementary figures and tables.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b03b36b309eae1a9d4d0f55a4636f4a
Additional file 1 This PDF document describes the datasets used in the main text, where to obtain these datasets, how they were prepared to be used in the workflow, and the parameters for the integrated tools used in the research.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33a1e5bcb952dbee9283962060d0857c