Discovering frequent agreement subtrees from phylogenetic data

IEEE Transactions on Knowledge and Data Engineering

Volumn 20, Issue 1, 2008, Pages 68-82

  Zhang, Sen ^a,b   Wang, Jason T L ^a,c  

^a IEEE   (United States)

^b STATE UNIVERSITY OF NEW YORK   (United States)

^c New Jersey Institute of Technology   (United States)

Author keywords

Algorithmic design; Computational phylogenetics; Data mining; Evolutionary bioinformatics; Pattern discovery

Indexed keywords

DATA MINING; EVOLUTIONARY ALGORITHMS; PROBLEM SOLVING;

ALGORITHMIC DESIGN; COMPUTATIONAL PHYLOGENETICS; EVOLUTIONARY BIOINFORMATICS; PATTERN DISCOVERY;

TREES (MATHEMATICS);

EID: 36649030608     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2007.190676     Document Type: Article

References (36)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of the 20th International Conference on Very Large Data Bases, pages 487-499, 1994.
2. A. Amir and D. Keselman. Maximum agreement subtree in a set of evolutionary trees. SIAM Journal on Computing, 26(6):1656-1669, 1997.
3. T. Asai, K. Abe, S. Kawasoe, H. Sakamoto, H. Arimura, and S. Arikawa. Efficiently mining frequent substructures from semi-structured data. In Proc. of International Workshop on Information and Electrical Engineering, pages 59-64, Suwon, Korea, 2002.
4. T. Asai, H. Arimura, T. Uno, and S. Nakano. Discovering frequent substructures in large unordered trees. In Proc. of the 6th International Conference on Discovery Science, 2003.
5. V. Berry and F. Nicolas. Improved parameterized complexity of the maximum agreement subtree and maximum compatible tree problems. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3(3):289-302, 2006.
6. Y. Chi, S. Nijssen, R. R. Muntz, and J. N. Kok. Frequent subtree mining - an overview. Fundamenta Informaticae, Special Issue on Graph and Tree Mining, 2005.
7. Y. Chi, Y. Xia, Y. Yang, and R. R. Muntz. Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Transactions on Knowledge and Data Engineering, 17(2):190-202, 2005.
8. Y. Chi, Y. Yang, and R. R. Muntz. Canonical forms for labeled trees and their applications in frequent subtree mining. Knowledge and Information Systems, 8(2):203-234, 2005.
9. W. H. E. Day. Optimal algorithms for comparing trees with labeled leaves. Journal of Classification, 1:7-28, 1985.
10. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55(6):297-301, 1995.
11. C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
12. G. Ganeshkumar and T. Warnow. Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time. In Proc. of the 1st International Workshop on Algorithms in Bioinformatics, pages 156-163, 2001.
13. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53-87, 2004.
14. S. Holmes and R Diaconis. Random walks on trees and matchings. Electronic Journal of Probability, 7, 2002.
15. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In Proc. of the 3rd IEEE International Conference on Data Mining, pages 549-552, 2003.
16. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of the 1st IEEE International Conference on Data Mining, pages 313-320, 2001.
17. J. T. Li, A. L. Bogle, A. S. Klein, and M. J. Donoghue. Phylogeny and biogeography of Hamamelis (Hamamelidaceae). Harvard Papers in Botany, 5:171-178, 2000.
18. D. R. Maddison. The discovery and importance of multiple islands of most-parsimonious trees. System Zoology, 40:315-328, 1991.
19. P. Mardulyn, M. C. Milinkovitch, and J. M. Pasteels. Phylogenetic analyses of DNA and allozyme data suggest that Gonioctena leaf beetles (Coleoptera; Chrysomelidae) experienced convergent evolution in their history of host-plant family shifts. Systematic Biology, 46(4):722r-747, 1997.
20. B. M. E. Moret, L. Nakhleh, T. Warnow, C. R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme. Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1):13-23, 2004.
21. S. Nijssen and J. N. Kok. Efficient discovery of frequent unordered trees: Proofs. Technical Report, Leiden Institute of Advanced Computer Science, Netherlands, Jan. 2003.
22. R. D. M. Page. COMPONENT User's Manual (Release 1.5), 1989. University of Auckland, Auckland.
23. W. H. Piel, M. J. Donoghue, and M. J. Sanderson. TreeBASE: A database of phylogenetic information. In Proc. of the 2nd International Workshop of Species 2000, 2000.
24. C. Semple and M. Steel. A supertree method for rooted trees. Discrete Applied Mathematics, 105:147-158, 2000.
25. D. Shasha, J. T. L. Wang, and S. Zhang. Unordered tree mining with applications to phylogeny. In Proc. of the 20th International Conference on Data Engineering, pages 708-719, 2004.
26. C. Wang, M. Hong, J. Pei, H. Zhou, W. Wang and B. Shi. Efficient pattern-growth methods for frequent tree pattern mining. In Proc. of the 8th Pacific-Asia Conference on Knowledge. Discovery and Data Mining, Sydney, Australia, May 26-28, 2004.
27. J. T. L. Wang, H. Shan, D. Shasha, and W. H. Piel. Fast structural search in phylogenetic databases. Evolutionary Bioinformatics, 1:37-46, 2005.
28. J. T. L. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and K. M. Currey. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine. Intelligence, 20(8):889-895, 1998.
29. J. T. L. Wang, K. Zhang, G. Chang, and D. Shasha. Finding approximate patterns in undirected acyclic graphs. Pattern Recognition, 35(2):473-483, 2002.
30. T. Washio and H. Motoda. State of the art of graph-based data mining. ACM SIGKDD Explorations, 5(1), July 2003.
31. Y. Xiao, J. Yao, Z. Li, and M. Dunham. Efficient data mining for maximal frequent subtrees. In Proc. of IEEE International Conference on Data Mining, 2003.
32. X. Yan and J. Han. CloseGraph: Mining closed frequent graph patterns. In Proc. of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003.
33. L. Yang, M. L. Lee, and W. Hsu. Efficient mining of XML query patterns for caching. In Proc. of the 29th International Conference on Very Large Databases, Berlin, Germany, 2003.
34. M. J. Zaki. Efficiently mining frequent trees in a forest: Algorithms and applications. IEEE Transaction on Knowledge and Data Engineering, Special Issue on Mining Biological Data, W. Wang and J. Yang (eds.), 17(8):1021-1035, 2005.
35. S. Zhang and J. T. L. Wang. Mining frequent agreement subtrees in phylogenetic databases. In Proc. of the 6th SIAM International Conference on Data Mining, pages 222-233, 2006.
36. S. Zhang, K. G. Herbert, J. T. L. Wang, W. H. Piel, and D. R. B. Stockwell. Phylominer: A tool for evolutionary data analysis. In Proc. of the 18th International Conference on Scientific and Statistical Database Management, pages 129-132, 2006.