Reaction motifs in metabolic networks (2005)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/11557067_15
- Assunto: BIOINFORMÁTICA
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Workshop on Algorithms in Bioinformatics - WABI
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
- Licença: other-oa
-
ABNT
LACROIX, Vincent e FERNANDES, Cristina Gomes e SAGOT, Marie-France. Reaction motifs in metabolic networks. 2005, Anais.. Berlin: Springer, 2005. Disponível em: https://doi.org/10.1007/11557067_15. Acesso em: 27 abr. 2024. -
APA
Lacroix, V., Fernandes, C. G., & Sagot, M. -F. (2005). Reaction motifs in metabolic networks. In Proceedings. Berlin: Springer. doi:10.1007/11557067_15 -
NLM
Lacroix V, Fernandes CG, Sagot M-F. Reaction motifs in metabolic networks [Internet]. Proceedings. 2005 ;[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/11557067_15 -
Vancouver
Lacroix V, Fernandes CG, Sagot M-F. Reaction motifs in metabolic networks [Internet]. Proceedings. 2005 ;[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/11557067_15 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Independent dominating sets in planar triangulations
- On edge-magic labelings of forests
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
Informações sobre o DOI: 10.1007/11557067_15 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas