Displaying similar documents to “On the approximability of comparing genomes with duplicates.”

The sum-product algorithm: algebraic independence and computational aspects

Francesco M. Malvestuto (2013)

Kybernetika

Similarity:

The sum-product algorithm is a well-known procedure for marginalizing an “acyclic” product function whose range is the ground set of a commutative semiring. The algorithm is general enough to include as special cases several classical algorithms developed in information theory and probability theory. We present four results. First, using the sum-product algorithm we show that the variable sets involved in an acyclic factorization satisfy a relation that is a natural generalization of...