Discovering Frequent Agreement Subtrees From Phylogenetic Data

IEEE Transactions on Knowledge and Data Engineering - United States
doi 10.1109/tkde.2007.190676
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Discovering Frequent Substructures From Hierarchical Semi-Structured Data

2002English

A Scalable Method for Identifying Frequent Subtrees in Sets of Large Phylogenetic Trees

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2012English

Discovering Exclusive Patterns in Frequent Sequences

International Journal of Data Mining, Modelling and Management
ModelingSimulationComputer Science ApplicationsManagement Information Systems
2010English

An Efficient Algorithm for Discovering Frequent Subgraphs

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
2004English

Discovering Frequent Embedded Subtree Patterns From Large Databases of Unordered Labeled Trees

International Journal of Data Warehousing and Mining
HardwareArchitectureSoftware
2005English

EvoMiner: Frequent Subtree Mining in Phylogenetic Databases

Knowledge and Information Systems
Information SystemsHuman-Computer InteractionHardwareArchitectureArtificial IntelligenceSoftware
2013English

Algorithms for Discovering Bucket Orders From Data

2006English

An Algorithm for Discovering Lagrangians Automatically From Data

PeerJ Computer Science
Computer Science
2015English

DASMiner: Discovering and Integrating Data From DAS Sources

BMC Systems Biology
Molecular BiologyApplied MathematicsStructural BiologySimulationComputer Science ApplicationsModeling
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy