✦ LIBER ✦

Efficient chaining of seeds in ordered trees

✍ Scribed by Julien Allali; Cedric Chauve; Pascal Ferraro; Anne-Laure Gaillard

Book ID: 113699082
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 318 KB
Volume: 14
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2011.12.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient enumeration of ordered trees w

Efficient enumeration of ordered trees with leaves

✍ Katsuhisa Yamanaka; Yota Otachi; Shin-ichi Nakano 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Efficient Matrix Chain Ordering in Polyl

Efficient Matrix Chain Ordering in Polylog Time

✍ Bradford, Phillip G.; Rawlins, Gregory J. E.; Shannon, Gregory E. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 765 KB

Chains and Trees: ‘Strong’–‘Weak’ Order

Chains and Trees: ‘Strong’–‘Weak’ Order in Job Scheduling

✍ Moshe Dror 📂 Article 📅 1997 🏛 Springer Netherlands 🌐 English ⚖ 212 KB

Efficiency of neem and groundnut oils in

Efficiency of neem and groundnut oils in protecting leguminous tree seeds against seed beetles in the Sahel

✍ C. Cardet; T. Kandji; A. Delobel; P. Danthu 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 236 KB

Efficient Ordering Heuristics in Binary

Efficient Ordering Heuristics in Binary Decision Diagram–based Fault Tree Analysis

✍ Yuchang Mo; Farong Zhong; Huawen Liu; Quansheng Yang; Gang Cui 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB

On the number of deepest nodes in ordere

On the number of deepest nodes in ordered trees

✍ R. Kemp 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 637 KB

Let Qn.k,, be the number of all n-node ordered trees with r nodes of maximum level k and let B,,\*,, be the number of all r-tuply rooted ordered trees with n nodes and height less than or equal to k. In this paper we derive the identitity where n, k, r > 0. An explicit expression for Qn,k,r and its