 | 2011 |
| 11 |  | Marcelo P. Lopes,
Marília D. V. Braga,
Celina M. Herrera de Figueiredo,
Rodrigo de A. Hausen,
Luis Antonio Brasil Kowada:
Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.
BSB 2011: 42-49 |
| 2010 |
| 10 |  | Jakub Kovác,
Marília D. V. Braga,
Jens Stoye:
The Problem of Chromosome Reincorporation in DCJ Sorting and Halving.
RECOMB-CG 2010: 13-24 |
| 9 |  | Marília D. V. Braga:
On Sorting Genomes with DCJ and Indels.
RECOMB-CG 2010: 62-73 |
| 8 |  | Marília D. V. Braga,
Eyla Willing,
Jens Stoye:
Genomic Distance with DCJ and Indels.
WABI 2010: 90-101 |
| 7 |  | Said Sadique Adi,
Marília D. V. Braga,
Cristina G. Fernandes,
Carlos Eduardo Ferreira,
Fábio Viduani Martinez,
Marie-France Sagot,
Marco A. Stefanes,
Christian Tjandraatmadja,
Yoshiko Wakabayashi:
Repetition-free longest common subsequence.
Discrete Applied Mathematics 158(12): 1315-1324 (2010) |
| 2009 |
| 6 |  | Marília D. V. Braga,
Jens Stoye:
Counting All DCJ Sorting Scenarios.
RECOMB-CG 2009: 36-47 |
| 5 |  | Marília D. V. Braga:
baobabLUNA: the solution space of sorting by reversals.
Bioinformatics 25(14): 1833-1835 (2009) |
| 2008 |
| 4 |  | Said Sadique Adi,
Marília D. V. Braga,
Cristina G. Fernandes,
Carlos Eduardo Ferreira,
Fábio Viduani Martinez,
Marie-France Sagot,
Marco A. Stefanes,
Christian Tjandraatmadja,
Yoshiko Wakabayashi:
Repetition-free longest common subsequence.
Electronic Notes in Discrete Mathematics 30: 243-248 (2008) |
| 3 |  | Marília D. V. Braga,
Marie-France Sagot,
Celine Scornavacca,
Eric Tannier:
Exploring the Solution Space of Sorting by Reversals, with Experiments and an Application to Evolution.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 348-356 (2008) |
| 2007 |
| 2 |  | Marília D. V. Braga,
Marie-France Sagot,
Celine Scornavacca,
Eric Tannier:
The Solution Space of Sorting by Reversals.
ISBRA 2007: 293-304 |
| 2002 |
| 1 |  | Marília D. V. Braga,
Joao Meidanis:
An Algorithm That Builds a Set of Strings Given Its Overlap Graph.
LATIN 2002: 52-63 |