FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2085449715> ?p ?o ?g. }

• W2085449715 abstract "Interaction graphs (signed directed graphs) provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops) and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments.We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible) this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops.The calculation of shortest positive/negative paths and cycles in interaction graphs is an important method for network analysis in Systems Biology. This contribution draws the attention of the community to this important computational problem and provides a number of new algorithms, partially specifically tailored for biological interaction graphs. All algorithms have been implemented in the CellNetAnalyzer framework which can be downloaded for academic use at http://www.mpi-magdeburg.mpg.de/projects/cna/cna.html." @default.
• W2085449715 created "2016-06-24" @default.
• W2085449715 creator A5062268813 @default.
• W2085449715 creator A5080707502 @default.
• W2085449715 date "2009-06-15" @default.
• W2085449715 modified "2023-10-15" @default.
• W2085449715 title "Computing paths and cycles in biological interaction graphs" @default.
• W2085449715 cites W1599207601 @default.
• W2085449715 cites W1807981783 @default.
• W2085449715 cites W1970321745 @default.
• W2085449715 cites W2007804392 @default.
• W2085449715 cites W2015341785 @default.
• W2085449715 cites W2053145248 @default.
• W2085449715 cites W2065432632 @default.
• W2085449715 cites W2078678611 @default.
• W2085449715 cites W2082001376 @default.
• W2085449715 cites W2083342911 @default.
• W2085449715 cites W2092755129 @default.
• W2085449715 cites W2105841205 @default.
• W2085449715 cites W2110355460 @default.
• W2085449715 cites W2116298046 @default.
• W2085449715 cites W2116324021 @default.
• W2085449715 cites W2118382442 @default.
• W2085449715 cites W2127020923 @default.
• W2085449715 cites W2139884531 @default.
• W2085449715 cites W2145899141 @default.
• W2085449715 cites W2147638953 @default.
• W2085449715 cites W2163480486 @default.
• W2085449715 cites W2168364602 @default.
• W2085449715 cites W2169528473 @default.
• W2085449715 cites W2281218127 @default.
• W2085449715 cites W2592767170 @default.
• W2085449715 doi "https://doi.org/10.1186/1471-2105-10-181" @default.
• W2085449715 hasPubMedCentralId "https://www.ncbi.nlm.nih.gov/pmc/articles/2708159" @default.
• W2085449715 hasPubMedId "https://pubmed.ncbi.nlm.nih.gov/19527491" @default.
• W2085449715 hasPublicationYear "2009" @default.
• W2085449715 type Work @default.
• W2085449715 sameAs 2085449715 @default.
• W2085449715 citedByCount "35" @default.
• W2085449715 countsByYear W20854497152012 @default.
• W2085449715 countsByYear W20854497152013 @default.
• W2085449715 countsByYear W20854497152014 @default.
• W2085449715 countsByYear W20854497152015 @default.
• W2085449715 countsByYear W20854497152016 @default.
• W2085449715 countsByYear W20854497152017 @default.
• W2085449715 countsByYear W20854497152018 @default.
• W2085449715 countsByYear W20854497152019 @default.
• W2085449715 countsByYear W20854497152020 @default.
• W2085449715 countsByYear W20854497152021 @default.
• W2085449715 countsByYear W20854497152022 @default.
• W2085449715 countsByYear W20854497152023 @default.
• W2085449715 crossrefType "journal-article" @default.
• W2085449715 hasAuthorship W2085449715A5062268813 @default.
• W2085449715 hasAuthorship W2085449715A5080707502 @default.
• W2085449715 hasBestOaLocation W20854497151 @default.
• W2085449715 hasConcept C111472728 @default.
• W2085449715 hasConcept C11413529 @default.
• W2085449715 hasConcept C114614502 @default.
• W2085449715 hasConcept C118615104 @default.
• W2085449715 hasConcept C132525143 @default.
• W2085449715 hasConcept C138885662 @default.
• W2085449715 hasConcept C151730666 @default.
• W2085449715 hasConcept C154945302 @default.
• W2085449715 hasConcept C156340839 @default.
• W2085449715 hasConcept C22590252 @default.
• W2085449715 hasConcept C2777212361 @default.
• W2085449715 hasConcept C2779343474 @default.
• W2085449715 hasConcept C2780586882 @default.
• W2085449715 hasConcept C28225019 @default.
• W2085449715 hasConcept C33923547 @default.
• W2085449715 hasConcept C41008148 @default.
• W2085449715 hasConcept C45374587 @default.
• W2085449715 hasConcept C80444323 @default.
• W2085449715 hasConcept C86803240 @default.
• W2085449715 hasConceptScore W2085449715C111472728 @default.
• W2085449715 hasConceptScore W2085449715C11413529 @default.
• W2085449715 hasConceptScore W2085449715C114614502 @default.
• W2085449715 hasConceptScore W2085449715C118615104 @default.
• W2085449715 hasConceptScore W2085449715C132525143 @default.
• W2085449715 hasConceptScore W2085449715C138885662 @default.
• W2085449715 hasConceptScore W2085449715C151730666 @default.
• W2085449715 hasConceptScore W2085449715C154945302 @default.
• W2085449715 hasConceptScore W2085449715C156340839 @default.
• W2085449715 hasConceptScore W2085449715C22590252 @default.
• W2085449715 hasConceptScore W2085449715C2777212361 @default.
• W2085449715 hasConceptScore W2085449715C2779343474 @default.
• W2085449715 hasConceptScore W2085449715C2780586882 @default.
• W2085449715 hasConceptScore W2085449715C28225019 @default.
• W2085449715 hasConceptScore W2085449715C33923547 @default.
• W2085449715 hasConceptScore W2085449715C41008148 @default.
• W2085449715 hasConceptScore W2085449715C45374587 @default.
• W2085449715 hasConceptScore W2085449715C80444323 @default.
• W2085449715 hasConceptScore W2085449715C86803240 @default.
• W2085449715 hasIssue "1" @default.
• W2085449715 hasLocation W20854497151 @default.
• W2085449715 hasLocation W20854497152 @default.
• W2085449715 hasLocation W20854497153 @default.
• W2085449715 hasLocation W20854497154 @default.
• W2085449715 hasLocation W20854497155 @default.
• W2085449715 hasOpenAccess W2085449715 @default.

• next