Counting, generating and sampling tree alignments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Counting, generating and sampling tree alignments


Pairwise ordered tree alignment are combinatorial objects that appear in important applications, such as RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical sets of matches between identical pairs of trees. This ambiguity is uninforma-tive, and detrimental to any probabilistic analysis. In this work, we consider tree alignments up to equivalence. Our first result is a precise asymptotic enumeration of tree alignments, obtained from a context-free grammar by mean of basic analytic combinatorics. Our second result focuses on alignments between two given ordered trees S and T. 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 dynamic programming algorithm for sampling alignments under the Gibbs-Boltzmann probability distribution. This generalizes existing tree alignment algorithms, and opens the door for a probabilistic analysis of the space of suboptimal alignments.
Fichier principal
Vignette du fichier
CombinatoricsTreeAlignment-latin16.pdf (362.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01154030 , version 1 (21-05-2015)
hal-01154030 , version 2 (12-12-2015)
hal-01154030 , version 3 (06-03-2016)





Cedric Chauve, Julien Courtiel, Yann Ponty. Counting, generating and sampling tree alignments. ALCOB - 3rd International Conference on Algorithms for Computational Biology - 2016, Jun 2016, Trujillo, Spain. ⟨hal-01154030v2⟩
498 View
304 Download



Gmail Facebook X LinkedIn More