메뉴 건너뛰기
ISCIT 2010 - 2010 10th International Symposium on Communications and Information Technologies
Volumn , Issue , 2010, Pages 844-849
A directed path-decomposition approach to exactly identifying attractors of boolean networks
Author keywords

[No Author keywords available]
Indexed keywords

BOOLEAN NETWORKS; PATH DECOMPOSITION;
EID: 78651235176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCIT.2010.5665106     Document Type: Conference Paper
Times cited : (11)
References (12)
  • 1
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of Scaling in Random Networks
    • A.L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science 286, 509-512, 1999.
    • (1999) Science , vol.286 , pp. 509-512
    • Barabási, A.L.1    Albert, R.2
  • 2
    • 33745629046 scopus 로고    scopus 로고
    • Directed Path-width and Monotonicity in Digraph Searching
    • J. Barát. Directed Path-width and Monotonicity in Digraph Searching. Graphs and Combinatorics 22, 161-172, 2006.
    • (2006) Graphs and Combinatorics , vol.22 , pp. 161-172
    • Barát, J.1
  • 3
    • 0001294529 scopus 로고    scopus 로고
    • A Linear-time Algorithm for Finding Tree-decompositions of Small Treewidth
    • H.L. Bodlaender. A Linear-time Algorithm for Finding Tree-decompositions of Small Treewidth. SIAM Journal on Computing 25(6), 1305-1317, 1996.
    • (1996) SIAM Journal on Computing , vol.25 , Issue.6 , pp. 1305-1317
    • Bodlaender, H.L.1
  • 4
    • 0030356420 scopus 로고    scopus 로고
    • Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
    • H.L. Bodlaender and T. Kloks Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. Journal of Algorithms 21(2), 358-402, 1996.
    • (1996) Journal of Algorithms , vol.21 , Issue.2 , pp. 358-402
    • Bodlaender, H.L.1    Kloks, T.2
  • 5
    • 18144407620 scopus 로고    scopus 로고
    • Number and Length of Attractors in a Critical Kauffman Model with Connectivity One
    • B. Drossel, T. Mihaljev, and F. Greil. Number and Length of Attractors in a Critical Kauffman Model with Connectivity One. Physical Review Letters, 94(8), 088701, 2005.
    • (2005) Physical Review Letters , vol.94 , Issue.8 , pp. 088701
    • Drossel, B.1    Mihaljev, T.2    Greil, F.3
  • 7
  • 8
    • 0014489272 scopus 로고
    • Metabolic Stability and Epigenesis in Randomly Constructed Genetic Nets
    • S.A. Kauffman. Metabolic Stability and Epigenesis in Randomly Constructed Genetic Nets. Journal of Theoretical Biology, 22, 437-467, 1969.
    • (1969) Journal of Theoretical Biology , vol.22 , pp. 437-467
    • Kauffman, S.A.1
  • 9
  • 10
    • 41349121540 scopus 로고    scopus 로고
    • Stability of the Kauffman Model
    • S. Bilke and F. Sjunnesson. Stability of the Kauffman Model. Physical Review E, 65(1),'016129, 2001.
    • (2001) Physical Review E , vol.65 , Issue.1 , pp. 016129
    • Bilke, S.1    Sjunnesson, F.2
  • 11
    • 0001790593 scopus 로고
    • Depth-first Search and Linear Graph Algorithms
    • R. Tarjan. Depth-first Search and Linear Graph Algorithms. SIAM Journal on Computing 1(2), 146-160, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 12
    • 45849146209 scopus 로고    scopus 로고
    • Digraph Searching, Directed Vertex Separation and Directed Pathwidth
    • B. Yang and Y. Cao. Digraph Searching, Directed Vertex Separation and Directed Pathwidth. Discrete Applied Mathematics 156(20), 1822-1837, 2006.
    • (2006) Discrete Applied Mathematics , vol.156 , Issue.20 , pp. 1822-1837
    • Yang, B.1    Cao, Y.2

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