Φορτώνει......
The Approximability of Shortest Path-Based Graph Orientations of Protein–Protein Interaction Networks
The graph orientation problem calls for orienting the edges of an undirected graph so as to maximize the number of prespecified source-target vertex pairs that admit a directed path from the source to the target. Most algorithmic approaches to this problem share a common preprocessing step, in which...
Αποθηκεύτηκε σε:
| Κύριοι συγγραφείς: | , , |
|---|---|
| Μορφή: | Artigo |
| Γλώσσα: | Inglês |
| Έκδοση: |
Mary Ann Liebert, Inc.
2013
|
| Θέματα: | |
| Διαθέσιμο Online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3842894/ https://ncbi.nlm.nih.gov/pubmed/24073924 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1089/cmb.2013.0064 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|