Sciweavers

2834 search results - page 36 / 567
» Representing Trees with Constraints
Sort
View
ECAI
2000
Springer
14 years 1 months ago
Extensions of Constraint Solving for Proof Planning
The integration of constraint solvers into proof planning has pushed the problem solving horizon. Proof planning benefits from the general functionalities of a constraint solver s...
Erica Melis, Jürgen Zimmer, Tobias Mülle...
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
14 years 3 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
José L. Balcázar, Albert Bifet, Anto...
AUIC
2006
IEEE
14 years 2 months ago
Visualising phylogenetic trees
• This paper describes techniques for visualising pairs of similar trees. Our aim is to develop ways of presenting the information so as to highlight both the common structure of...
Wan Nazmee Wan Zainon, Paul R. Calder
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
14 years 1 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
IANDC
2011
148views more  IANDC 2011»
13 years 3 months ago
Building species trees from larger parts of phylogenomic databases
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
Celine Scornavacca, Vincent Berry, Vincent Ranwez