Name
Abstract | ||
|---|---|---|
In this paper, we introduce an agreement subtree mapping kernel counting all of the agreement subtree mappings and design the algorithm to compute it for phylogenetic trees, which are unordered leaflabeled full binary trees, in quadratic time. Then, by applying the agreement subtree mapping kernel to trimmed phylogenetic trees obtained from all the positions in nucleotide sequences for A (H1N1) influenza viruses, we classify pandemic viruses from non-pandemic viruses and viruses in one region from viruses in the other regions. On the other hand, for leaf-labeled trees, we show that the problem of counting all of the agreement subtree mappings is #P-complete. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-319-10061-6_21 | Lecture Notes in Artificial Intelligence |
Field | DocType | Volume |
Kernel (linear algebra),Combinatorics,Phylogenetic tree,Tree (data structure),Binary tree,Time complexity,Mathematics | Conference | 8417 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
11 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Issei Hamada | 1 | 1 | 1.04 |
| Takaharu Shimada | 2 | 4 | 1.87 |
| Daiki Nakata | 3 | 0 | 0.68 |
| Kouichi Hirata | 4 | 130 | 32.04 |
| Tetsuji Kuboyama | 5 | 140 | 29.36 |