On the computational complexity of closest genome problems.
Discret. Appl. Math., 2020
The distance and median problems in the single-cut-or-join model with single-gene duplications.
Algorithms Mol. Biol., 2020
PathOGiST: A Novel Method for Clustering Pathogen Isolates by Combining Multiple Genotyping Signals.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Algorithms for Computational Biology, 2020
The Rooted SCJ Median with Single Gene Duplications.
Proceedings of the Comparative Genomics - 16th International Conference, 2018
Approximating the DCJ distance of balanced genomes in linear time.
Algorithms Mol. Biol., 2017
The gene family-free median of three.
Algorithms Mol. Biol., 2017
A Tractable Variant of the Single Cut or Join Distance with Duplicated Genes.
Proceedings of the Comparative Genomics - 15th International Workshop, 2017
Fast ancestral gene order reconstruction of genomes with unequal gene content.
BMC Bioinform., 2016
A Linear Time Approximation Algorithm for the DCJ Distance for Genomes with Bounded Number of Duplicates.
Proceedings of the Algorithms in Bioinformatics - 16th International Workshop, 2016
On the distribution of cycles and paths in multichromosomal breakpoint graphs and the expected value of rearrangement distance.
BMC Bioinform., December, 2015
Reconstruction of ancestral gene orders using intermediate genomes.
BMC Bioinform., December, 2015
On the family-free DCJ distance and similarity.
Algorithms Mol. Biol., 2015
On the Multichromosomal Hultman Number.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2014
On the Family-Free DCJ Distance.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014
Extending the Algebraic Formalism for Genome Rearrangements to Include Linear Chromosomes.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013
Rearrangement-Based Phylogeny Using the Single-Cut-or-Join Operation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013
Sobre modelos de rearranjo de genomas.
PhD thesis, 2012
A GRASP-based Heuristic for the Project Portfolio Selection Problem.
Proceedings of the 15th IEEE International Conference on Computational Science and Engineering, 2012
SCJ: A Breakpoint-Like Distance that Simplifies Several Rearrangement Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
The SinBiota 2.0 Biodiversity Information System.
Proceedings of the IEEE 7th International Conference on E-Science, 2011
SCJ: A Variant of Breakpoint Distance for Which Sorting, Genome Median and Genome Halving Problems Are Easy.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009
AMiGA: the arthropodan mitochondrial genomes accessible database.
Bioinform., 2006