𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Exponentially many supertrees

✍ Scribed by S. Böcker

Book ID
104349393
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
409 KB
Volume
15
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

The amalgamation of leaf-labelled trees into a single supertree that displays each of the input trees is an important problem in classification. Clearly, there can be more than one (super) tree for a given set of input trees, in particular if a highly unresolved supertree exists. Here, we show (by explicit construction) that even if every supertree of a given collection of input trees is binary, there can still be exponentially many such supertrees.

📜 SIMILAR VOLUMES

Supertrees
Supertrees
✍ Lawrence, Kayleigh 📂 Article 📅 2010 🏛 Reed Business 🌐 English ⚖ 221 KB
Linear Codes with Exponentially Many Lig
Linear Codes with Exponentially Many Light Vectors
✍ Alexei Ashikhmin; Alexander Barg; Serge Vlăduţ 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

put forward the following conjecture: Let {C n } be a sequence of binary linear codes of distance d n and A dn be the number of vectors of weight d n in C n . Then log 2 A dn =o(n). We disprove this by constructing a family of linear codes from geometric Goppa codes in which the number of vectors of