The aim of this paper is to provide the machinery to effi- ciently compute the similarity between two tree languages and to provide algorithms to generate a ...
Oct 26, 2012 · We use the formalism of extended DTDs (EDTDs) to represent the unranked regular tree languages. In particular, we obtain an efficient algorithm ...
In this paper, we provide the formal foundation for such a testbed. We adopt similarity measures based on counting the number of common and different trees in ...
This paper provides the formal foundation for a testbed for experimentally validate learning and approximation algorithms for XML Schema Definitions, ...
Generating, sampling and counting subclasses of regular tree languages · conference paper · Published by Association for Computing Machinery (ACM).
Pairwise ordered tree alignment are combinatorial objects that appear in important applications, such as RNA secondary structure comparison.
Missing: subclasses | Show results with:subclasses
Generating, sampling and counting subclasses of regular tree languages. T Antonopoulos, F Geerts, W Martens, F Neven. Theory of Computing Systems 52 (3), 542 ...
Generating, sampling and counting subclasses of regular tree languages. In ICDT, pages 30--41, 2011. Digital Library · Google Scholar. [4]. Marcelo Arenas ...
Apr 2, 2017 · By refining our grammar to align specific trees, we obtain a decomposition scheme for the space of alignments, and use it to design an efficient ...
We study the problem of sampling trees from forests, in the setting where probabilities for each tree may be a function of arbitrarily large tree fragments.