Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Counting tanglegrams with species

Gessel, Ira M....

Free

Share this content

Counting tanglegrams with species by Gessel, Ira M. ( Author )

Content Provider	Lemonjar Open Access
Publisher	N.A
Publication Date	01-01-2015
Summary	A tanglegram is a pair of binary trees with the same set of leaves. Unlabeled tanglegrams were counted recently by Billey, Konvalinka, and Matsen, who also proposed the problem of counting several variations of unlabeled tanglegrams (unordered and unrooted tanglegrams). We use the theory of combinatorial species to solve these problems.
ISBN	-
Item Type	Article
File Type	pdf
File Size	36.88 KB
Language	English
Subjects	-
Unlimited	MYR 0.00
Total read	-
URL	http://arxiv.org/abs/1509.03867

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Gessel, Ira M.. Counting tanglegrams with species. N.A. January 01, 2015. Accessed August 16, 2025. https://online.provdatabase.com/cite/11335

APA 7th EditionReferences

Gessel, Ira M.. (2015). Counting tanglegrams with species. N.A. https://online.provdatabase.com/cite/11335

Chicago 17th EditionReferences

Gessel, Ira M.. Counting tanglegrams with species. N.A. 2015. https://online.provdatabase.com/cite/11335

HarvardReferences

Gessel, Ira M.. (2015). Counting tanglegrams with species. [Online]. N.A. Available from: https://online.provdatabase.com/cite/11335. (Accessed 16 August 2025).

Harvard AustraliaReferences

Gessel, Ira M., 2015, Counting tanglegrams with species, N.A, viewed 16 August 2025, <https://online.provdatabase.com/cite/11335>

MLA 9th EditionWorks Cited

Gessel, Ira M.. Counting tanglegrams with species. N.A, 2015. PROV Database, https://online.provdatabase.com/cite/11335.

Share this eBook