Carla Negri Lintzmayer
Carla Negri Lintzmayer
E-mail confirmado em ufabc.edu.br - Página inicial
Título
Citado por
Citado por
Ano
A general heuristic for genome rearrangement problems
U Dias, GR Galvão, CN Lintzmayer, Z Dias
Journal of bioinformatics and computational biology 12 (03), 1450012, 2014
152014
Sorting permutations by prefix and suffix versions of reversals and transpositions
CN Lintzmayer, Z Dias
Latin American Symposium on Theoretical Informatics, 671-682, 2014
152014
An exact algorithm for the blocks relocation problem with new lower bounds
KEY Quispe, CN Lintzmayer, EC Xavier
Computers & Operations Research 99, 206-217, 2018
132018
Register allocation with graph coloring by ant colony optimization
CN Lintzmayer, MH Mulati, AF da Silva
2011 30th International Conference of the Chilean Computer Science Society …, 2011
112011
Rt-colorant: Um algoritmo heurıstico baseado em colônia de formigas artificiais com busca local para colorir grafos
CN Lintzmayer, MH Mulati, AF da Silva
XLIII SBPO-Simpósio Brasileiro de Pesquisa Operacional 2011, 2011
102011
Approximation algorithms for sorting by length-weighted prefix and suffix operations
CN Lintzmayer, G Fertin, Z Dias
Theoretical Computer Science 593, 26-41, 2015
92015
On the diameter of rearrangement problems
CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 158-170, 2014
82014
On sorting of signed permutations by prefix and suffix reversals and transpositions
CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 146-157, 2014
82014
Toward better performance of ColorAnt ACO algorithm
CN Lintzmayer, MH Mulati, AF da Silva
2011 30th International Conference of the Chilean Computer Science Society …, 2011
82011
Sorting permutations by prefix and suffix rearrangements
CN Lintzmayer, G Fertin, Z Dias
Journal of bioinformatics and computational biology 15 (01), 1750002, 2017
72017
Algoritmo Heurstico Baseado em Colonia de Formigas Artificiais ColorAnt2 com Busca Local Aplicado ao Problema de Coloração de Grafo
CN Lintzmayer, MH Mulati, AF Da Silva
X Congresso Brasileiro de Inteligência Computacional, 2011
72011
Approximation algorithms for sorting permutations by fragmentation-weighted operations
AO Alexandrino, CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 53-64, 2018
52018
Decomposing split graphs into locally irregular graphs
CN Lintzmayer, GO Mota, M Sambinelli
Electronic Notes in Theoretical Computer Science 346, 603-612, 2019
42019
Sorting permutations by limited-size operations
GHS Miranda, CN Lintzmayer, Z Dias
International Conference on Algorithms for Computational Biology, 76-87, 2018
42018
Approximation algorithms for sorting permutations by length-weighted short rearrangements
AO Alexandrino, GHS Miranda, CN Lintzmayer, Z Dias
Electronic Notes in Theoretical Computer Science 346, 29-40, 2019
32019
Sorting -Permutations by -Operations
GHS Miranda, AO Alexandrino, CN Lintzmayer, Z Dias
Brazilian Symposium on Bioinformatics, 1-13, 2018
32018
Sorting permutations and binary strings by length-weighted rearrangements
CN Lintzmayer, G Fertin, Z Dias
Theoretical Computer Science 715, 35-59, 2018
32018
Register allocation by evolutionary algorithm
CN Lintzmayer, MH Mulati, AF da Silva
2012 31st International Conference of the Chilean Computer Science Society …, 2012
32012
Sorting permutations by fragmentation-weighted operations.
AO Alexandrino, CN Lintzmayer, Z Dias
Journal of bioinformatics and computational biology, 2050006-2050006, 2020
22020
Berge’s Conjecture and Aharoni–Hartman–Hoffman’s Conjecture for Locally In-Semicomplete Digraphs
M Sambinelli, CN Lintzmayer, CN da Silva, O Lee
Graphs and Combinatorics 35 (4), 921-931, 2019
22019
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20