Sciweavers

2492 search results - page 75 / 499
» On the General Signature Trees
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 7 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
FOCM
2006
76views more  FOCM 2006»
13 years 7 months ago
The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series
We present an approach that allows performing computations related to the Baker-Campbell-Haussdorff (BCH) formula and its generalizations in an arbitrary Hall basis, using labeled...
A. Murua
BMCBI
2010
143views more  BMCBI 2010»
13 years 7 months ago
ETE: a python Environment for Tree Exploration
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...
Jaime Huerta-Cepas, Joaquín Dopazo, Toni Ga...
ILP
1997
Springer
13 years 12 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki
KBSE
2007
IEEE
14 years 2 months ago
Test suite reduction and prioritization with call trees
This paper presents a tool that (i) constructs tree-based models of a program’s behavior during testing and (ii) employs these trees while reordering and reducing a test suite. ...
Adam M. Smith, Joshua Geiger, Gregory M. Kapfhamme...