A note on naturally embedded ternary trees.
Kuba, Markus (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
Displaying similar documents to “The combinatorics of evolutionary trees---a survey.”
A note on naturally embedded ternary trees.
Dissimilarity vectors of trees are contained in the tropical Grassmannian.
Iriarte Giraldo, Benjamin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Complexes of Directed Trees of Complete Multipartite Graphs
Duško Jojić (2012)
Publications de l'Institut Mathématique
Similarity:
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
Pitman, Jim (2001)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
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.
Operads and algebraic combinatorics of trees.
Chapoton, Frédéric (2007)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
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:
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).
On the formal inverse of polynomial endomorphisms
Piotr Ossowski (1998)
Colloquium Mathematicae
Similarity:
Tree compression pushdown automaton
Jan Janoušek, Bořivoj Melichar, Martin Poliak (2012)
Kybernetika
Similarity:
A new kind of a deterministic pushdown automaton, called a Tree Compression Automaton, is presented. The tree compression automaton represents a complete compressed index of a set of trees for subtrees and accepts all subtrees of given trees. The algorithm for constructing our pushdown automaton is incremental. For a single tree with nodes, the automaton has at most states, its transition function cardinality is at most and there are pushdown store symbols. If hashing is used...