Folgen
Klairton L. Brito
Klairton L. Brito
Institute of Computing, University of Campinas
Bestätigte E-Mail-Adresse bei ic.unicamp.br - Startseite
Titel
Zitiert von
Zitiert von
Jahr
On the complexity of sorting by reversals and transpositions problems
AR Oliveira, KL Brito, U Dias, Z Dias
Journal of Computational Biology 26 (11), 1223-1229, 2019
292019
Sorting by genome rearrangements on both gene order and intergenic sizes
KL Brito, G Jean, G Fertin, AR Oliveira, U Dias, Z Dias
Journal of Computational Biology 27 (2), 156-174, 2020
182020
Sorting signed permutations by intergenic reversals
AR Oliveira, G Jean, G Fertin, KL Brito, L Bulteau, U Dias, Z Dias
IEEE/ACM transactions on computational biology and bioinformatics 18 (6 …, 2020
172020
Sorting by weighted reversals and transpositions
AR Oliveira, KL Brito, Z Dias, U Dias
Brazilian Symposium on Bioinformatics, 38-49, 2018
152018
Sorting permutations by intergenic operations
AR Oliveira, G Jean, G Fertin, KL Brito, U Dias, Z Dias
IEEE/ACM Transactions on Computational Biology and Bioinformatics 18 (6 …, 2021
112021
A 3.5-approximation algorithm for sorting by intergenic transpositions
AR Oliveira, G Jean, G Fertin, KL Brito, U Dias, Z Dias
International Conference on Algorithms for Computational Biology, 16-28, 2020
92020
Reversal distance on genomes with different gene content and intergenic regions information
AO Alexandrino, KL Brito, AR Oliveira, U Dias, Z Dias
International Conference on Algorithms for Computational Biology, 121-133, 2021
82021
An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes
KL Brito, AR Oliveira, AO Alexandrino, U Dias, Z Dias
Algorithms for Molecular Biology 16, 1-21, 2021
62021
Heuristics for the reversal and transposition distance problem
KL Brito, AR Oliveira, U Dias, Z Dias
IEEE/ACM transactions on computational biology and bioinformatics 17 (1), 2-13, 2019
52019
A 1.375-approximation algorithm for sorting by transpositions with faster running time
AO Alexandrino, KL Brito, AR Oliveira, U Dias, Z Dias
Brazilian Symposium on Bioinformatics, 147-157, 2022
42022
Heuristics for genome rearrangement distance with replicated genes
G Siqueira, KL Brito, U Dias, Z Dias
IEEE/ACM transactions on computational biology and bioinformatics 18 (6 …, 2021
32021
Reversal and transposition distance of genomes considering flexible intergenic regions
KL Brito, AR Oliveira, AO Alexandrino, U Dias, Z Dias
Procedia Computer Science 195, 21-29, 2021
32021
Heuristics for reversal distance between genomes with duplicated genes
G Siqueira, KL Brito, U Dias, Z Dias
Algorithms for Computational Biology: 7th International Conference, AlCoB …, 2020
32020
Heuristics for the Sorting Signed Permutations by Reversals and Transpositions Problem
KL Brito, AR Oliveira, U Dias, Z Dias
International Conference on Algorithms for Computational Biology, 65-75, 2018
32018
Reversal and indel distance with intergenic region information
AO Alexandrino, KL Brito, AR Oliveira, U Dias, Z Dias
IEEE/ACM transactions on computational biology and bioinformatics, 2022
22022
Genome rearrangement distance with a flexible intergenic regions aspect
KL Brito, AO Alexandrino, AR Oliveira, U Dias, Z Dias
IEEE/ACM transactions on computational biology and bioinformatics, 2022
22022
Block-interchange distance considering intergenic regions
U Dias, AR Oliveira, KL Brito, Z Dias
Brazilian Symposium on Bioinformatics, 58-69, 2019
22019
Sorting by reversals, transpositions, and indels on both gene order and intergenic sizes
KL Brito, G Jean, G Fertin, AR Oliveira, U Dias, Z Dias
International Symposium on Bioinformatics Research and Applications, 28-39, 2019
22019
Sorting by reversals and transpositions with proportion restriction
KL Brito, AO Alexandrino, AR Oliveira, U Dias, Z Dias
Brazilian Symposium on Bioinformatics, 117-128, 2020
12020
Rearrangement Distance Problems: An updated survey
AR Oliveira, KL Brito, AO Alexandrino, G Siqueira, U Dias, Z Dias
ACM Computing Surveys, 2024
2024
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20