๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A scalable method for identifying frequent subtrees in sets of large phylogenetic trees

โœ Scribed by Avinash Ramu, Tamer Kahveci, J Gordon Burleigh

Book ID
119894244
Publisher
BioMed Central
Year
2012
Tongue
English
Weight
303 KB
Volume
13
Category
Article
ISSN
1471-2105

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

[Lecture Notes in Computer Science] Flex
[Lecture Notes in Computer Science] Flexible and Efficient Information Handling Volume 4042 || A FP-Tree-Based Method for Inverse Frequent Set Mining
โœ Bell, David A.; Hong, Jun ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 388 KB

This book constitutes the refereed proceedings of the 23rd British National Conference on Databases, BNCOD 23, held in Belfast, Northern Ireland, July 2006. The volume presents 12 revised full papers and 6 revised short papers, together with 2 invited lectures and 13 poster papers. Topical sections