Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Fábio Viduani Martinez"'
The analysis of biological networks allows the understanding of many biological processes, including the structure, function, interaction and evolutionary relationships of their components. One of the most important concepts in biological network ana
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::672ecbb4ffb58cee4c4c45e0d54737e8
https://pub.uni-bielefeld.de/record/2942995
https://pub.uni-bielefeld.de/record/2942995
Autor:
Carlos Eduardo Ferreira, Marco A. Stefanes, Marília D. V. Braga, Cristina G. Fernandes, Said Sadique Adi, Christian Tjandraatmadja, Fábio Viduani Martinez, Marie-France Sagot, Yoshiko Wakabayashi
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2010, 158 (12), pp.1315-1324. ⟨10.1016/j.dam.2009.04.023⟩
Discrete Applied Mathematics, Elsevier, 2010, 158(12), pp.1315-1324
Electronic Notes in Discrete Mathematics
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Nov 2007, Puerto Varas, Chile. pp.243-248, ⟨10.1016/j.endm.2008.01.042⟩
Discrete Applied Mathematics, 2010, 158 (12), pp.1315-1324. ⟨10.1016/j.dam.2009.04.023⟩
Discrete Applied Mathematics, Elsevier, 2010, 158(12), pp.1315-1324
Electronic Notes in Discrete Mathematics
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)
IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Nov 2007, Puerto Varas, Chile. pp.243-248, ⟨10.1016/j.endm.2008.01.042⟩
We study the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. We show several algorithmic results, a computational complexity result, and we describe a preliminary ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3006a612503938efdbb5f50d1370f9e
https://doi.org/10.1016/j.dam.2009.04.023
https://doi.org/10.1016/j.dam.2009.04.023
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
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 the approximation factor of a given algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bbef56cc20fe1836e5e5f947433e2f7
https://doi.org/10.1016/j.tcs.2007.08.001
https://doi.org/10.1016/j.tcs.2007.08.001
Publikováno v:
Advances in Bioinformatics and Computational Biology ISBN: 9783319124179
BSB
BSB
The number of cycles of a breakpoint graph is one of the notable parameters to solve distance problems in comparative genomics. For a fixed c, the number of linear unichromosomal genomes with n genes such that the breakpoint graph has c disjoint cycl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::343e2c145edf532b8e0ba07873473bed
https://doi.org/10.1007/978-3-319-12418-6_2
https://doi.org/10.1007/978-3-319-12418-6_2
Autor:
Fábio Viduani Martinez, José Soares
Publikováno v:
2006 15th International Conference on Computing.
The Steiner tree problem with a terminal order (STO) consists of finding a minimum cost Steiner tree where terminals must respect a permutation. This permutation of terminal vertices gives their ranking on a real line and the minimum cost Steiner tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37bb98d2449c1087289c208cbe6f362f
https://doi.org/10.1109/cic.2006.69
https://doi.org/10.1109/cic.2006.69
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540280613
COCOON
COCOON
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 the approximation factor of a given algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d40dd1e652ba1c685bcb714bf8313040
https://doi.org/10.1007/11533719_38
https://doi.org/10.1007/11533719_38