메뉴 건너뛰기




Volumn 4075 LNBI, Issue , 2006, Pages 35-49

Link discovery in graphs derived from biological databases

Author keywords

[No Author keywords available]

Indexed keywords

DATA REDUCTION; FEATURE EXTRACTION; GRAPH THEORY; INFORMATION RETRIEVAL; PROTEINS;

EID: 33746760086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799511_5     Document Type: Conference Paper
Times cited : (69)

References (16)
  • 1
    • 1542787787 scopus 로고    scopus 로고
    • POCUS: Mining genomic: sequence annotation to predict disease genes
    • Turner, F.S., Clutterbuck, D.R., Semple, C.A.M.: POCUS: Mining genomic: sequence annotation to predict disease genes. Genuine Biology 4 (2003) R75
    • (2003) Genuine Biology , vol.4
    • Turner, F.S.1    Clutterbuck, D.R.2    Semple, C.A.M.3
  • 5
    • 0022786956 scopus 로고
    • Fish oil, Raynaud's syndrome and undiscovered public knowledge
    • Swanson, D.R.: Fish oil, Raynaud's syndrome and undiscovered public knowledge. Perspectives in Biology and Medicine 30 (1986) 7-18
    • (1986) Perspectives in Biology and Medicine , vol.30 , pp. 7-18
    • Swanson, D.R.1
  • 6
    • 0031125707 scopus 로고    scopus 로고
    • An interactive system for finding complementary literatures: A stimulus to scientific discovery
    • Swanson, D.R., Smalheiser, N.R.: An interactive system for finding complementary literatures: A stimulus to scientific discovery. Artificial Intelligence 91 (1997) 183-203
    • (1997) Artificial Intelligence , vol.91 , pp. 183-203
    • Swanson, D.R.1    Smalheiser, N.R.2
  • 10
    • 3042523388 scopus 로고    scopus 로고
    • Predicting protein complex memebership using probabilistic network reliability
    • Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex memebership using probabilistic network reliability, Genome Research 14 (2004) 1170-1175
    • (2004) Genome Research , vol.14 , pp. 1170-1175
    • Asthana, S.1    King, O.D.2    Gibbons, F.D.3    Roth, F.P.4
  • 11
    • 33746715414 scopus 로고    scopus 로고
    • Discovering informative connection subgraphs in multi-relational graphs
    • Ramakrishnan, C., Milnor, W.H., Perry, M., Sheth, A.P.: Discovering informative connection subgraphs in multi-relational graphs. SIGKDD Explorations 7 (2005) 56-63
    • (2005) SIGKDD Explorations , vol.7 , pp. 56-63
    • Ramakrishnan, C.1    Milnor, W.H.2    Perry, M.3    Sheth, A.P.4
  • 13
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • Eppstein, D.: Finding the k shortest paths. SIAM Journal on Computing 28 (1998) 652-673
    • (1998) SIAM Journal on Computing , vol.28 , pp. 652-673
    • Eppstein, D.1
  • 14
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing 8 (1979) 410-421
    • (1979) SIAM Journal on Computing , vol.8 , pp. 410-421
    • Valiant, L.G.1


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