#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2000

2018

- This year (2)
- Last 5 years (36)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- VÃtor Santos Costa, Simone Dantas, David Sankoff, Ximing Xu
- Journal of the Brazilian Computer Society
- 2012

There are various definitions of a gene cluster determined by two genomes and methods for finding these clusters. However, there is little work on characterizing configurations of genes that areâ€¦ (More)

- Poly H. da Silva, Raphael Machado, Simone Dantas, MarÃlia D. V. Braga
- Algorithms for Molecular Biology
- 2012

Classical approaches to compute the genomic distance are usually limited to genomes with the same content and take into consideration only rearrangements that change the organization of the genomeâ€¦ (More)

- Simone Dantas, FrÃ©dÃ©ric Maffray, Ana Silva
- Discrete Applied Mathematics
- 2012

We consider the problem of partitioning the vertex-set of a graph into four non-empty sets A, B, C,D such that every vertex of A is adjacent to every vertex of B and every vertex of C is adjacent toâ€¦ (More)

- JosÃ© D. Alvarado, Simone Dantas, Dieter Rautenbach
- Discrete Applied Mathematics
- 2015

- Poly H. da Silva, Raphael Machado, Simone Dantas, MarÃlia D. V. Braga
- BMC Bioinformatics
- 2012

The double-cut-and-join (DCJ) is a model that is able to efficiently sort a genome into another, generalizing the typical mutations (inversions, fusions, fissions, translocations) to which genomesâ€¦ (More)

- Danilo Artigas, Simone Dantas, Mitre Costa Dourado, Jayme Luiz Szwarcfiter
- Discrete Mathematics
- 2011

Let G be a finite simple graph. Let S âŠ† V (G), its closed interval I[S] is the set of all vertices lying on a shortest path between any pair of vertices of S. The set S is convex if I[S] = S. In thisâ€¦ (More)

- Simone Dantas, Sylvain Gravier, FrÃ©dÃ©ric Maffray, Bojan Mohar
- Electronic Notes in Discrete Mathematics
- 2001

A k-total-coloring of G is an assignment of k colors to the edges and vertices of G, so that adjacent and incident elements have different colors. The total chromatic number of G, denoted by Ï‡T (G),â€¦ (More)

We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraintsâ€¦ (More)

- Simone Dantas, Sulamita Klein, CÃ©lia Picinin de Mello, Aurora Morgana
- Discrete Mathematics
- 2009

The P4-sparse Graph Sandwich Problem asks, given two graphs G 1 = (V, E1) and G2 = (V, E2), whether there exists a graph G = (V, E) such that E1 âŠ† E âŠ† E2 and G is P4-sparse. In this paper we presentâ€¦ (More)