✦ LIBER ✦

Twelve Countings with Rooted Plane Trees

✍ Scribed by Martin Klazar

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 357 KB
Volume: 18
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.1995.0095

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Addendum Twelve Countings with Rooted Pl

Addendum Twelve Countings with Rooted Plane Trees

✍ Martin Klazar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 131 KB

On digraphs with a rooted tree structure

✍ Jayme L. Szwarcfiter 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB

An algorithm to count the number of repe

An algorithm to count the number of repeated patient data entries with B tree

✍ Masahiko Okada; Mihoko Okada 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 255 KB

An algorithm to obtain the number of different values that appear a specified number of times in a given data field of a given data file is presented. Basically, a well-known B-tree structure is employed in this study. Some modifications were made to the basic B-tree algorithm. The first step of the

Tree Rooting with Outgroups When They Di

Tree Rooting with Outgroups When They Differ in Their Nucleotide Composition from the Ingroup: The Drosophila saltans and willistoni Groups, a Case Study

✍ Rosa Tarrı́o; Francisco Rodrı́guez-Trelles; Francisco J. Ayala 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 74 KB

Rooting is frequently the most precarious step in any phylogenetic analysis. Outgroups can become useless for rooting if they are too distantly related to the ingroup. Specifically, little attention has been paid to scenarios where outgroups have evolved different nucleotide frequencies from the ing