#### Filter Results:

#### Publication Year

2008

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Raphael Machado, Celina M. H. de Figueiredo
- Discrete Applied Mathematics
- 2011

- Raphael Machado, Celina M. H. de Figueiredo, Kristina Vuskovic
- Theor. Comput. Sci.
- 2010

The class C of graphs that do not contain a cycle with a unique chord was recently studied by Trotignon and Vuškovi´c [26], who proved strong structure results for these graphs. In the present paper we investigate how these structure results can be applied to solve the edge-colouring problem in the class. We give computational complexity results for the… (More)

- Marília D. V. Braga, Raphael Machado, Leonardo C. Ribeiro, Jens Stoye
- BMC Bioinformatics
- 2011

BACKGROUND
Classical approaches to compute the genomic distance are usually limited to genomes with the same content, without duplicated markers. However, differences in the gene content are frequently observed and can reflect important evolutionary aspects. A few polynomial time algorithms that include genome rearrangements, insertions and deletions (or… (More)

- Marília D. V. Braga, Raphael Machado, Leonardo C. Ribeiro, Jens Stoye
- BMC Bioinformatics
- 2011

BACKGROUND
The distance between two genomes is often computed by comparing only the common markers between them. Some approaches are also able to deal with non-common markers, allowing the insertion or the deletion of such markers. In these models, a deletion and a subsequent insertion that occur at the same position of the genome count for two sorting… (More)

- Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
- Discrete Applied Mathematics
- 2014

A unichord in a graph is an edge that is the unique chord of a cycle. A square is an induced cycle on four vertices. A graph is unichord-free if none of its edges is a unichord. We give a slight restatement of a known structure theorem for unichord-free graphs and use it to show that, with the only exception of the complete graph K 4 , every square-free,… (More)

- 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 are subject, but allowing the existence of circular chromosomes at the intermediate steps. In the general model many circular chromosomes can coexist in some… (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 (i.e. positions and orientation of pieces of DNA, number and type of chromosomes, etc.), such as inversions, translocations, fusions and fissions. These… (More)

- Raphael Machado, Celina M. H. de Figueiredo
- J. Braz. Comp. Soc.
- 2011

- C. N. Campos, Celina M. H. de Figueiredo, Raphael Machado, Célia Picinin de Mello
- Discrete Mathematics
- 2012