메뉴 건너뛰기




Volumn 77, Issue 1, 2011, Pages 122-128

Heuristic algorithms in computational molecular biology

Author keywords

Heuristic algorithm; Implicit hitting set; Multi genome alignment; Protein interaction

Indexed keywords

MOLECULAR BIOLOGY; NP-HARD; PROTEINS;

EID: 78349308733     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2010.06.009     Document Type: Article
Times cited : (16)

References (22)
  • 4
    • 0346452791 scopus 로고    scopus 로고
    • Fast heuristics for the maximum feasible subsystem problem
    • J.W. Chinneck Fast heuristics for the maximum feasible subsystem problem INFORMS J. Comput. 13 3 2001 210 223
    • (2001) INFORMS J. Comput. , vol.13 , Issue.3 , pp. 210-223
    • Chinneck, J.W.1
  • 5
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of lnn for approximating set cover
    • U. Feige A threshold of ln n for approximating set cover JACM 45 4 1998 643 652
    • (1998) JACM , vol.45 , Issue.4 , pp. 643-652
    • Feige, U.1
  • 6
    • 33748257786 scopus 로고    scopus 로고
    • Graemlin: General and robust alignment of multiple large interaction networks
    • J. Flannick, A. Novak, B.S. Srinivasan, H.H. McAdams, and S. Batzoglou Graemlin: General and robust alignment of multiple large interaction networks Genome Res. 16 2006 1169 1181
    • (2006) Genome Res. , vol.16 , pp. 1169-1181
    • Flannick, J.1    Novak, A.2    Srinivasan, B.S.3    McAdams, H.H.4    Batzoglou, S.5
  • 12
    • 0028514351 scopus 로고
    • On the hardness of approximating minimization problems
    • C. Lund, and M. Yannakakis On the hardness of approximating minimization problems JACM 41 5 1994 960 981
    • (1994) JACM , vol.41 , Issue.5 , pp. 960-981
    • Lund, C.1    Yannakakis, M.2
  • 15
    • 34548755675 scopus 로고    scopus 로고
    • Comparing protein interaction networks via a graph match-and-split algorithm
    • M. Narayanan, and R.M. Karp Comparing protein interaction networks via a graph match-and-split algorithm J. Comput. Biol. 14 7 2007 892 907
    • (2007) J. Comput. Biol. , vol.14 , Issue.7 , pp. 892-907
    • Narayanan, M.1    Karp, R.M.2
  • 16
    • 0026407442 scopus 로고
    • Fast approximation algorithms for fractional packing and covering problems
    • S. Plotkin, D.B. Shmoys, and E. Tardos Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 20 1995 495 504
    • (1995) Math. Oper. Res. , vol.20 , pp. 495-504
    • Plotkin, S.1    Shmoys, D.B.2    Tardos, E.3
  • 17
    • 33645983211 scopus 로고    scopus 로고
    • Efficient algorithms for detecting signaling pathways in protein interaction networks
    • J. Scott, T. Ideker, R.M. Karp, and R. Sharan Efficient algorithms for detecting signaling pathways in protein interaction networks J. Comput. Biol. 13 2 2006 133 144
    • (2006) J. Comput. Biol. , vol.13 , Issue.2 , pp. 133-144
    • Scott, J.1    Ideker, T.2    Karp, R.M.3    Sharan, R.4
  • 18
    • 33645732240 scopus 로고    scopus 로고
    • Modeling cellular machinery through biological network comparison
    • R. Sharan, and T. Ideker Modeling cellular machinery through biological network comparison Nature Biotechnol. 24 4 2006 427 433
    • (2006) Nature Biotechnol. , vol.24 , Issue.4 , pp. 427-433
    • Sharan, R.1    Ideker, T.2
  • 20
    • 34547416529 scopus 로고    scopus 로고
    • Pairwise global alignment of protein interaction networks by matching neighborhood topology
    • Springer Heidelberg
    • R. Singh, J. Xu, and B. Berger Pairwise global alignment of protein interaction networks by matching neighborhood topology LNBI vol. 4453 2007 Springer Heidelberg 16 31
    • (2007) LNBI , vol.4453 , pp. 16-31
    • Singh, R.1    Xu, J.2    Berger, B.3


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