-
1
-
-
4544334171
-
-
T. Asai, K. Abe, S. Kawazoe, H. Arimura, H. Sakamoto, and S. Arikawa: Efficient substructure, discovery from, large, semi-structured data, Proc. SDM'02, 2002.
-
(2002)
Efficient substructure, discovery from, large, semi-structured data, Proc. SDM'02
-
-
Asai, T.1
Abe, K.2
Kawazoe, S.3
Arimura, H.4
Sakamoto, H.5
Arikawa, S.6
-
4
-
-
4444231365
-
A survey of kernels for structured data
-
T. Gärtner: A survey of kernels for structured data, STGKDD Explorations 5, 49-58, 2003.
-
(2003)
STGKDD Explorations
, vol.5
, pp. 49-58
-
-
Gärtner, T.1
-
5
-
-
34247496118
-
GLYCAN: The database of carbohydrate structures
-
K. Hashimoto, M. Hamajima, S. Goto, S. Masumoto, M. Kawashima, and M. Kanehisa: GLYCAN: The database of carbohydrate structures, Genome Informatics 14, 649 650, 2003.
-
(2003)
Genome Informatics
, vol.14
, pp. 649-650
-
-
Hashimoto, K.1
Hamajima, M.2
Goto, S.3
Masumoto, S.4
Kawashima, M.5
Kanehisa, M.6
-
8
-
-
24644454168
-
Extinction of leukemia specefic glycan motifs in humans by computational glycomics
-
Y. Hizukuri, Y. Yamanishi, O. Nakamura, F. Yagi, S. Goto, and M. Kanehisa: Extinction of leukemia specefic glycan motifs in humans by computational glycomics, Carbohydrate Research 340, 2270-2278, 2005.
-
(2005)
Carbohydrate Research
, vol.340
, pp. 2270-2278
-
-
Hizukuri, Y.1
Yamanishi, Y.2
Nakamura, O.3
Yagi, F.4
Goto, S.5
Kanehisa, M.6
-
9
-
-
84988278426
-
Two algorithms for approximate string matching in static ltexts
-
Proc. MFCS'91
-
P. Jokinen, and E. Ukkonen: Two algorithms for approximate string matching in static ltexts, Proc. MFCS'91, LNCS 520, 240-248, 1991.
-
(1991)
LNCS
, vol.520
, pp. 240-248
-
-
Jokinen, P.1
Ukkonen, E.2
-
10
-
-
34247528351
-
-
II. Kashima, and T. Koyanagi: Kernels for semi-structured data. ICML 02, 291-298, 2002.
-
II. Kashima, and T. Koyanagi: Kernels for semi-structured data. ICML 02, 291-298, 2002.
-
-
-
-
11
-
-
34247468680
-
A q-gram based distance measure for ordered labeled trees
-
T. Kuboyama, K. Hirata., N. Ohkura, and M. Harao: A q-gram based distance measure for ordered labeled trees, Proc. LLLL'06, 77-83, 2006.
-
(2006)
Proc. LLLL'06
, pp. 77-83
-
-
Kuboyama, T.1
Hirata, K.2
Ohkura, N.3
Harao, M.4
-
12
-
-
0036358995
-
The spectrum kernel: A siring kernel for SVM protein classification
-
C. S. Leslie, E. Eskin, and W. S. Noble: The spectrum kernel: A siring kernel for SVM protein classification, Proc. PSB'02, 566 575, 2002.
-
(2002)
Proc. PSB'02
, pp. 566-575
-
-
Leslie, C.S.1
Eskin, E.2
Noble, W.S.3
-
13
-
-
33745315005
-
The q-gram distance for ordered, unlabeled trees
-
Proc. DS'00
-
N. Ohkura, K. Hirata, T. Kuboyama, and M. Harao: The q-gram distance for ordered, unlabeled trees, Proc. DS'00, LNAI 3735, 189-202, 2005.
-
(2005)
LNAI
, vol.3735
, pp. 189-202
-
-
Ohkura, N.1
Hirata, K.2
Kuboyama, T.3
Harao, M.4
-
14
-
-
34247486341
-
The gram distribution for rooted ordered trees
-
N. Ohkura, K. Hirata, T. Kuboyama, S. Nakano, and M. Harao: The gram distribution for rooted ordered trees, Proc. LLLLL'06, 69-76, 2006.
-
(2006)
Proc. LLLLL'06
, pp. 69-76
-
-
Ohkura, N.1
Hirata, K.2
Kuboyama, T.3
Nakano, S.4
Harao, M.5
-
16
-
-
0027113212
-
Approximate string-matching with q-grams and maximal matches
-
E. Ukkonen: Approximate string-matching with q-grams and maximal matches, Theoret. Comput. Sci. 92, 191-211, 1993.
-
(1993)
Theoret. Comput. Sci
, vol.92
, pp. 191-211
-
-
Ukkonen, E.1
-
17
-
-
84898962121
-
Fast kernels for string and tree matching
-
S. V. N. Vishwanathan, and A. J. Smoka: Fast kernels for string and tree matching, Proc. NIPS 2002, 569-576, 2002.
-
(2002)
Proc. NIPS 2002
, pp. 569-576
-
-
Vishwanathan, S.V.N.1
Smoka, A.J.2
|