메뉴 건너뛰기




Volumn 5360 LNAI, Issue , 2008, Pages 236-246

Kernels based on distributions of agreement subtrees

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; IMAGE SEGMENTATION; MARKUP LANGUAGES; SYSTEMS ENGINEERING;

EID: 58349111995     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89378-3_23     Document Type: Conference Paper
Times cited : (5)

References (12)
  • 3
    • 35048864350 scopus 로고    scopus 로고
    • Berry, V., Nicolas, F.: Maximum Agreement and Compatible Supertrees (Extended Abstract). In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, 3109, pp. 205-219. Springer, Heidelberg (2004)
    • Berry, V., Nicolas, F.: Maximum Agreement and Compatible Supertrees (Extended Abstract). In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 205-219. Springer, Heidelberg (2004)
  • 5
    • 0006683426 scopus 로고    scopus 로고
    • Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithm
    • Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithm. SIAM J. Computing 26(6), 1656-1669 (1997)
    • (1997) SIAM J. Computing , vol.26 , Issue.6 , pp. 1656-1669
    • Amir, A.1    Keselman, D.2
  • 6
    • 0347752674 scopus 로고    scopus 로고
    • An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matching
    • Kao, M.Y., Lam, T.W., Sung, W.-K., Ting, H.F.: An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matching. J. Algorithms 40(2), 212-233 (2001)
    • (2001) J. Algorithms , vol.40 , Issue.2 , pp. 212-233
    • Kao, M.Y.1    Lam, T.W.2    Sung, W.-K.3    Ting, H.F.4
  • 7
    • 0036215968 scopus 로고    scopus 로고
    • A decomposition theorem for maximum weight bipartite matching with applications to evolutionary trees
    • Kao, M.Y., Lam, T.W., Sung, W.-K., Ting, H.F.: A decomposition theorem for maximum weight bipartite matching with applications to evolutionary trees. SIAM J. Computing 31(1), 18-26 (2001)
    • (2001) SIAM J. Computing , vol.31 , Issue.1 , pp. 18-26
    • Kao, M.Y.1    Lam, T.W.2    Sung, W.-K.3    Ting, H.F.4
  • 12
    • 34447328438 scopus 로고    scopus 로고
    • Glycan classification with tree kernels
    • Yamanishi, Y., Bach, F., Vert, J.-P.: Glycan classification with tree kernels. Bioinformatics 23(10), 1211-1216 (2007)
    • (2007) Bioinformatics , vol.23 , Issue.10 , pp. 1211-1216
    • Yamanishi, Y.1    Bach, F.2    Vert, J.-P.3


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