✦ LIBER ✦

Pattern conserving data structure and algorithms for computations on dendritic trees

✍ Scribed by W.P. Ireland

Book ID: 103049212
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 450 KB
Volume: 22
Category: Article
ISSN: 0010-4809
DOI: 10.1016/0010-4809(89)90014-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 709 || Balanced search trees made simple

✍ Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola; Whitesides, Sue 📂 Article 📅 1993 🏛 Springer Berlin Heidelberg ⚖ 527 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 519 || Algorithms for generating all spanning trees of undirected, directed and weighted graphs

✍ Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 German ⚖ 813 KB

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003. The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 subm

[Lecture Notes in Computer Science] Adva

[Lecture Notes in Computer Science] Advances in Knowledge Discovery and Data Mining Volume 7818 || PUF-Tree: A Compact Tree Structure for Frequent Pattern Mining of Uncertain Data

✍ Pei, Jian; Tseng, Vincent S.; Cao, Longbing; Motoda, Hiroshi; Xu, Guandong 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 304 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 6844 || Finding Longest Approximate Periodic Patterns

✍ Dehne, Frank; Iacono, John; Sack, Jörg-Rüdiger 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 243 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2906 || Succinct Data Structures for Searchable Partial Sums

✍ Ibaraki, Toshihide; Katoh, Naoki; Ono, Hirotaka 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 180 KB

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996)

Multi-Dimensional Pattern Matching with

Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms

✍ Raffaele Giancarlo; Roberto Grossi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 434 KB

We introduce a new multidimensional pattern matching problem that is a Ž natural generalization of string matching, a well studied problem A. V. Aho, Ž . ''Handbook of Theoretical Computer Science'' J. van Leeuwen, Ed. , pp. 257᎐295, . Elsevier, Amsterdam, 1990 . The motivation for its algorithmic s