#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2005

2018

- This year (1)
- Last 5 years (8)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Said Sadique Adi, Marília D. V. Braga, +6 authors Yoshiko Wakabayashi
- Electronic Notes in Discrete Mathematics
- 2008

We study the problem of, given two sequences x and y over a finite alphabet, finding a repetitionfree longest common subsequence of x and y. We show several algorithmic results, a complexity result,… (More)

- Ludovic Cottret, Paulo Vieira Milreu, +4 authors Leen Stougie
- WABI
- 2008

We present the first exact method based on the topology of a metabolic network to find minimal sets of metabolites (called precursors) sufficient to produce a set of target metabolites. In contrast… (More)

- Fábio Viduani Martinez, Pedro Feijão, Marília D. V. Braga, Jens Stoye
- Algorithms for Molecular Biology
- 2015

Structural variation in genomes can be revealed by many (dis)similarity measures. Rearrangement operations, such as the so called double-cut-and-join (DCJ), are large-scale mutations that can create… (More)

- Diego P. Rubert, Edna Ayako Hoshino, Marília D. V. Braga, Jens Stoye, Fábio Viduani Martinez
- BMC Bioinformatics
- 2018

The genomic similarity is a large-scale measure for comparing two given genomes. In this work we study the (NP-hard) problem of computing the genomic similarity under the DCJ model in a setting that… (More)

Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the… (More)

- Pedro Feijão, Fábio Viduani Martinez, Annelyse Thévenin
- BMC Bioinformatics
- 2015

Finding the smallest sequence of operations to transform one genome into another is an important problem in comparative genomics. The breakpoint graph is a discrete structure that has proven to be… (More)

- Fábio Viduani Martinez, José Coelho de Pina, José Soares
- COCOON
- 2005

The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2 ρ−ρ/(3ρ−2) approximation algorithm for the TST, whereρ is… (More)

- Diego P. Rubert, Pedro Feijão, Marília Dias Vieira Braga, Jens Stoye, Fábio Viduani Martinez
- Algorithms for Molecular Biology
- 2017

Rearrangements are large-scale mutations in genomes, responsible for complex changes and structural variations. Most rearrangements that modify the organization of a genome can be represented by the… (More)