Counting, generating, analyzing and sampling tree alignments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Foundations of Computer Science Year : 2018

Counting, generating, analyzing and sampling tree alignments

Abstract

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 uninformative, 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
main.pdf (676.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01500116 , version 1 (02-04-2017)

Licence

Attribution - NonCommercial

Identifiers

  • HAL Id : hal-01500116 , version 1

Cite

Cedric Chauve, Julien Courtiel, Yann Ponty. Counting, generating, analyzing and sampling tree alignments. International Journal of Foundations of Computer Science, 2018, 29 (5), pp.741--767. ⟨hal-01500116⟩
1914 View
238 Download

Share

Gmail Facebook X LinkedIn More