The combinatorics of evolutionary trees---a survey.
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Operads and algebraic combinatorics of trees.”
The combinatorics of evolutionary trees---a survey.
A note on naturally embedded ternary trees.
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dissimilarity vectors of trees are contained in the tropical Grassmannian.
Iriarte Giraldo, Benjamin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The product of trees in the Loday-Ronco algebra through Catalan alternative tableaux.
Aval, Jean-Christophe, Viennot, Xavier (2010)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm
Gerritzen, L. (2004)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 17A50, 05C05. In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x).
Constructing Binary Huffman Tree
Hiroyuki Okazaki, Yuichi Futa, Yasunari Shidama (2013)
Formalized Mathematics
Similarity:
Huffman coding is one of a most famous entropy encoding methods for lossless data compression [16]. JPEG and ZIP formats employ variants of Huffman encoding as lossless compression algorithms. Huffman coding is a bijective map from source letters into leaves of the Huffman tree constructed by the algorithm. In this article we formalize an algorithm constructing a binary code tree, Huffman tree.
Complexes of Directed Trees of Complete Multipartite Graphs
Duško Jojić (2012)
Publications de l'Institut Mathématique
Similarity:
On the formal inverse of polynomial endomorphisms
Piotr Ossowski (1998)
Colloquium Mathematicae
Similarity:
Free Term Algebras
Grzegorz Bancerek (2012)
Formalized Mathematics
Similarity:
We interoduce a new characterization of algebras of normal forms of term rewriting systems [35] as algerbras of term free in itself (any function from free generators into the algebra generates endomorphism of the algebra). Introduced algebras are free in classes of algebras satisfying some sets of equalities. Their universes are subsets of all terms and the denotations of operation symbols are partially identical with the operations of construction of terms. These algebras are compiler...
A new family of Markov branching trees: the alpha-gamma model.
Chen, Bo, Ford, Daniel, Winkel, Matthias (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
Pitman, Jim (2001)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity: