메뉴 건너뛰기




Volumn 9, Issue , 2008, Pages

Detection of the dominant direction of information flow and feedback links in densely interconnected regulatory networks

Author keywords

[No Author keywords available]

Indexed keywords

ANNEALING ALGORITHM; COMPUTATIONAL BIOLOGY; HIERARCHICAL LEVEL; MATHEMATICAL LANGUAGES; MEMORY REQUIREMENTS; NUMERICAL ALGORITHMS; REGULATORY NETWORK; SIGNALING NETWORKS;

EID: 56349085107     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-9-424     Document Type: Article
Times cited : (23)

References (10)
  • 1
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • New York: Plenum MR E, TJ W
    • Karp RM Reducibility among combinatorial problems Complexity of Computer Computations New York: Plenum MR E, TJ W 1972:84-103.
    • (1972) Complexity of Computer Computations , pp. 84-103
    • Karp, R.M.1
  • 2
    • 0000255727 scopus 로고    scopus 로고
    • Approximating Minimum Feedback Sets and Multicuts in Directed Graphs
    • 10.1007/PL00009191
    • Even G Naor J Schieber B Sudan M Approximating Minimum Feedback Sets and Multicuts in Directed Graphs Algorithmica 1998, 20:151-174. 10.1007/ PL00009191
    • (1998) Algorithmica , vol.20 , pp. 151-174
    • Even, G.1    Naor, J.2    Schieber, B.3    Sudan, M.4
  • 3
    • 0036110133 scopus 로고    scopus 로고
    • Testing Properties of Directed Graphs: Acyclicity and Connectivity
    • 10.1002/rsa.10023
    • Bender MA Ron D Testing Properties of Directed Graphs: Acyclicity and Connectivity Random Structures and Algorithms 2002, 20:184-205. 10.1002/ rsa.10023
    • (2002) Random Structures and Algorithms , vol.20 , pp. 184-205
    • Bender, M.A.1    Ron, D.2
  • 5
    • 0024135198 scopus 로고    scopus 로고
    • An approximate max-flow min-cut theorem for uniform multicommodityflow problems with applications to approximation algorithms
    • Leighton T Rao S An approximate max-flow min-cut theorem for uniform multicommodityflow problems with applications to approximation algorithms Foundations of Computer Science, New York: 29th Annual Symposium on 1988:422-431.
    • Foundations of Computer Science, New York: 29th Annual Symposium on 1988 , pp. 422-431
    • Leighton, T.1    Rao, S.2
  • 6
    • 0027681887 scopus 로고
    • A Fast and Effective Heuristic for the Feedback Arc Set Problem
    • 10.1016/0020-0190(93)90079-O
    • Eades P Lin X Smyth WF A Fast and Effective Heuristic for the Feedback Arc Set Problem Information Processing Letters 1993, 47(6):319-323. 10.1016/0020-0190(93)90079-O
    • (1993) Information Processing Letters , vol.47 , Issue.6 , pp. 319-323
    • Eades, P.1    Lin, X.2    Smyth, W.F.3
  • 7
    • 84886764817 scopus 로고    scopus 로고
    • NetPath, 2007 http://www.netpath.org/
    • (2007) NetPath
  • 9
    • 0242559054 scopus 로고    scopus 로고
    • Pathway studio - The analysis and navigation of molecular networks
    • 10.1093/bioinformatics/btg290
    • Nikitin A Egorov S Daraselia N Mazo I Pathway studio - the analysis and navigation of molecular networks Bioinformatics 2003, 19:1-3. 10.1093/ bioinformatics/btg290
    • (2003) Bioinformatics , vol.19 , pp. 1-3
    • Nikitin, A.1    Egorov, S.2    Daraselia, N.3    Mazo, I.4
  • 10
    • 10744224197 scopus 로고    scopus 로고
    • Development of human protein reference database as an initial platform for approaching systems biology in humans
    • 403728 14525934 10.1101/gr.1680803
    • Peri S et al. Development of human protein reference database as an initial platform for approaching systems biology in humans Genome Research 2003, 13:2363-2371. 403728 14525934 10.1101/gr.1680803
    • (2003) Genome Research , vol.13 , pp. 2363-2371
    • Peri, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.