Motif search in graphs: application to metabolic networks (2006)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1109/TCBB.2006.55
- Subjects: BIOINFORMÁTICA; COMBINATÓRIA; TEORIA DOS GRAFOS
- Keywords: Reaction motif; network motif; metabolic network; combinatorics; graph algorithms; subgraph isomorphism; evolution; leucine biosynthesis
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: IEEE/ACM Transactions on Computational Biology and Bioinformatics
- ISSN: 1545-5963
- Volume/Número/Paginação/Ano: v. 3, n. 4, p. 360-368, 2006
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
LACROIX, Vincent e FERNANDES, Cristina Gomes e SAGOT, Marie-France. Motif search in graphs: application to metabolic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, v. 3, n. 4, p. 360-368, 2006Tradução . . Disponível em: https://doi.org/10.1109/TCBB.2006.55. Acesso em: 12 abr. 2026. -
APA
Lacroix, V., Fernandes, C. G., & Sagot, M. -F. (2006). Motif search in graphs: application to metabolic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3( 4), 360-368. doi:10.1109/TCBB.2006.55 -
NLM
Lacroix V, Fernandes CG, Sagot M-F. Motif search in graphs: application to metabolic networks [Internet]. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2006 ; 3( 4): 360-368.[citado 2026 abr. 12 ] Available from: https://doi.org/10.1109/TCBB.2006.55 -
Vancouver
Lacroix V, Fernandes CG, Sagot M-F. Motif search in graphs: application to metabolic networks [Internet]. IEEE/ACM Transactions on Computational Biology and Bioinformatics. 2006 ; 3( 4): 360-368.[citado 2026 abr. 12 ] Available from: https://doi.org/10.1109/TCBB.2006.55 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
- Procedia Computer Science
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3296304_-_Motif_search_in... |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
