The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - October-December (2010 vol.7)
pp: 688-703
Christophe Godin , INRIA, Sophia-Antipolis Méditerranée, Virtual Plants, UMR, DAP, Montpellier
Pascal Ferraro , University of Bordeaux, Bordeaux
ABSTRACT
In this paper, we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a given height are isomorphic. We show that these trees present remarkable compression properties, with high compression rates. In order to measure how far a tree is from being a self-nested tree, we then study how to quantify the degree of self-nestedness of any tree. For this, we define a measure of the self-nestedness of a tree by constructing a self-nested tree that minimizes the distance of the original tree to the set of self-nested trees that embed the initial tree. We show that this measure can be computed in polynomial time and depict the corresponding algorithm. The distance to this nearest embedding self-nested tree (NEST) is then used to define compression coefficients that reflect the compressibility of a tree. To illustrate this approach, we then apply these notions to the analysis of plant branching structures. Based on a database of simulated theoretical plants in which different levels of noise have been introduced, we evaluate the method and show that the NESTs of such branching structures restore partly or completely the original, noiseless, branching structures. The whole approach is then applied to the analysis of a real plant (a rice panicle) whose topological structure was completely measured. We show that the NEST of this plant may be interpreted in biological terms and may be used to reveal important aspects of the plant growth.
INDEX TERMS
Tree reduction, self-similarity, tree compression, tree-to-tree edit distance, plant architecture, branching structures, meristem, differentiation state.
CITATION
Christophe Godin, Pascal Ferraro, "Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.7, no. 4, pp. 688-703, October-December 2010, doi:10.1109/TCBB.2009.29
REFERENCES
[1] F. Hallé, R.A.A. Oldeman, and P.B. Tomlinson, Tropical Trees and Forests: An Architectural Analysis. Springer-Verlag, 1978.
[2] J.L. Harper, B.R. Rosen, and J. White, The Growth and Form of Modular Organisms. The Royal Soc., 1986.
[3] D. Barthélémy, C. Edelin, and F. Halle, "Architectural Concepts for Tropical Trees," Proc. Symp. Tropical Forests, L.B. Holm-Nielsen, I.C. Nielsen, and E. Balslev, eds., pp. 89-100, 1989.
[4] D. Barthélémy, "Levels of Organization and Repetition Phenomena in Seed Plants," Acta Biotheoretica, vol. 39, pp. 309-323, 1991.
[5] P. Room, L. Maillette, and J. Hanan, "Module and Metamer Dynamics and Virtual Plants," Advances in Ecological Research, vol. 25, pp. 105-157, 1994.
[6] P. Prusinkiewicz, "Modeling of Spatial Structure and Development of Plants: A Review," Scientia Horticulturae, vol. 74, pp. 113-149, 1998.
[7] P. Prusinkiewicz, "Selfsimilarity in Plants: Integrating Mathematical Biological Perspectives," Thinking in Patterns: Fractals and Related Phenomena in Nature, M.M. Novak, ed., pp. 103-118, World Scientific, 2004.
[8] O. Deussen and B. Lintermann, Digital Design of Nature. Springer-Verlag, 2005.
[9] C. Godin, E. Costes, and H. Sinoquet, "Plant Architecture Modelling—Virtual Plants and Complex Systems," Plant Architecture and its Manipulation, C. Turnbull, ed., vol. 17, pp. 238-287, Blackwell, 2005.
[10] M. Renton, Y. Guédon, C. Godin, and E. Costes, "Similarities and Gradients in Growth Unit Branching Patterns during Ontogeny in 'Fuji' Apple Trees: A Stochastic Approach," J. Experimental Botany, vol. 57, no. 12, pp. 3131-n3143, 2006.
[11] L. Mündermann, Y. Erasmus, B. Lane, E. Coen, and P. Prusinkiewicz, "Quantitative Modeling of Arabidopsis Development," Plant Physiology, vol. 139, no. 2, pp. 960-968, Oct. 2005.
[12] Y. Guo, Y. Ma, Z. Zhan, B. Li, M. Dingkuhn, D. Luquet, and P. de Reffye, "Parameter Optimization and Field Validation of the Functional-Structural Model Greenlab for Maize," Annals of Botany, vol. 97, no. 2, pp. 217-230, Feb. 2006.
[13] C. Godin, Y. Guédon, E. Costes, and Y. Caraglio, "Measuring, Analyzing Plants with the AMAPmod Software," Proc. Plants to Ecosystems—Advances in Computational Life Sciences, Second Int'l Symp. Computer Challenges in Life Science, M. Michalewicz, ed., pp. 53-84, 1997.
[14] H. Sinoquet and P. Rivet, "Measurement and Visualisation of the Architecture of an Adult Tree Based on a Three-Dimensional Digitising Device," Trees-Structure and Function, vol. 11, pp. 265-270, 1997.
[15] Y. Guédon, D. Barthélémy, Y. Caraglio, and E. Costes, "Pattern Analysis in Branching and Axillary Flowering Sequences," J. Theoretical Biology, vol. 212, no. 4, pp. 481-520, Oct. 2001.
[16] Y. Guédon, P. Heuret, and E. Costes, "Comparison Methods for Branching and Axillary Flowering Sequences," J. Theoretical Biology, vol. 225, no. 3, pp. 301-325, Dec. 2003.
[17] P. Ferraro and C. Godin, "A Distance Measure between Plant Architectures," Annals of Forest Science, vol. 57, nos. 5/6, pp. 445-461, 2000.
[18] J.-B. Durand, Y. Guédon, Y. Caraglio, and E. Costes, "Analysis of the Plant Architecture via Tree-Structured Statistical Models: The Hidden Markov Tree Models," New Phytologist, vol. 166, no. 3, pp. 813-825, June 2005.
[19] P. Ferraro, C. Godin, and P. Prusinkiewicz, "Toward a Quantification of Self-Similarity in Plants," Fractals, vol. 13, no. 2, pp. 91-109, 2005.
[20] W. Troll, "Die Wuchsform Der Baeume Und Straeucher," Vergleichende Morphologie der Hoeheren Pflanzen, W. Troll, ed., vol. 1, pp. 636-643, Borntraeger, 1937.
[21] A. Arber, Natural Philosophy of Plant Form. Cambridge Univ. Press, 1950.
[22] D. Frijters and A. Lindenmayer, "Developmental Descriptions of Branching Patterns with Paracladial Relationships," Formal Languages, Automata and Development, G. Rozenberg and A. Lindenmayer, eds., pp. 57-73, North-Holland Publishing Company, 1976.
[23] D. Barthélémy, Y. Caraglio, and E. Costes, "Architecture, Gradients Morphogénétiques et âge Physiologique Chez Les Végétaux," Modélisation et Simulation de l'Architecture des Végétaux, J. Bouchon, P.d. Reffye, and D. Barthélémy, eds., pp. 89-136, INRA, 1997.
[24] P. Prusinkiewicz and A. Lindenmayer, The Algorithmic Beauty of Plants. Springer Verlag, 1990.
[25] C. Godin and Y. Caraglio, "A Multiscale Model of Plant Topological Structures," J. Theoretical Biology, vol. 191, pp. 1-46, 1998.
[26] P. Kilpeläinen and H. Mannila, "Ordered and Unordered Tree Inclusion Problem," SIAM J. Computing, vol. 24, no. 2, pp. 340-356, 1995.
[27] L. Wang and D. Gusfield, "Improved Approximation Algorithms for Tree Alignment," J. Algorithms, vol. 25, no. 2, pp. 225-273, 1997.
[28] J.T. Wang, K. Zhang, and C.Y. Chang, "Identifying Approximately Common Substructures in Trees Based on a Restricted Edit Distance," Information Sciences, vol. 126, pp. 367-386, 1999.
[29] A. Ouangraoua, P. Ferraro, S. Dulucq, and L. Tichit, "Local Similarity between Quotiented Ordered Trees," J. Discrete Algorithms, vol. 5, no. 1, pp. 23-35, 2007.
[30] K. Zhang, "A New Editing Based Distance between Unordered Labeled Trees," Proc. Fourth Ann. Symp. Combinatorial Pattern Matching (CPM '93), 1993.
[31] K. Zhang, "A Constrained Edit Distance between Unordered Labeled Trees," Algorithmica, vol. 15, no. 3, pp. 205-222, 1996.
[32] S. Akers, "Binary Decision Diagrams," IEEE Trans. Computers, vol. 27, no. 6, pp. 509-516, June 1978.
[33] R. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
[34] A. Aho, I. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
[35] J. Hart and T. DeFanti, "Efficient Anti-Aliased Rendering of 3-D Linear Fractals," Computer Graphics, vol. 25, pp. 91-100, 1991.
[36] I. Sutherland, "Sketchpad—A Man-Machine Graphical Communication System," Proc. Spring Joint Computer Conf., 1963.
[37] J. Hart, "The Object Instancing Paradigm for Linear Fractal Modeling," Proc. Conf. Graphics Interface, pp. 224-231, 1992.
[38] T. Kay and J. Kajiya, "Ray Tracing Complex Scenes," Proc. ACM SIGGRAPH '86, pp. 269-278, Aug. 1986.
[39] C. Soler, F.X. Sillion, F. Blaise, and P. Reffye, "An Efficient Instantiation Algorithm for Simulating Radiant Energy Transfer in Plant Models," ACM Trans. Graphics, vol. 22, no. 2, pp. 204-233, 2003.
[40] E. Tokunaga, "Consideration on the Composition of Drainage Networks and Their Evolution," Geographical Reports of Tokyo Metropolitan Univ., vol. 13, pp. 1-27, 1978.
[41] X. Viennot, G. Eyrolles, N. Janey, and D. Arqués, "Combinatorial Analysis of Ramified Patterns and Computer Imagery of Trees," Proc. ACM SIGGRAPH '89, pp. 31-40, 1989.
[42] S. Peckam, "New Results for Self-Similar Trees with Applications to River Networks," Water Resource Research, vol. 31, pp. 1023-1029, 1995.
[43] M. Zamir, "On Fractal Properties of Arterial Trees," J. Theoretical Biology, vol. 1997, no. 4, pp. 517-526, 2002.
[44] B. Kron, "Growth of Self-Similar Graphs," J. Graph Theory, vol. 45, no. 3, pp. 224-239, 2004.
[45] R. Greenlaw, "Subtree Isomorphism Is in DLOG for Nested Trees," Int'l J. Foundations of Computer Science, vol. 7, no. 2, pp. 161-168, 1996.
[46] F. Preparata and R. Yeh, Introduction to Discrete Structures for Computer Science and Engineering. Addison-Wesley, 1973.
[47] P. Downey, R. Sethi, and R. Tarjan, "Variations on the Common Subexpression Problem," J. ACM Trans. Graphics, vol. 27, no. 4, pp. 758-771, 1980.
[48] D. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, 1997.
[49] G. Valiente, "An Efficient Bottom-Up Distance between Trees," Proc. Eighth Int'l Symp. String Processing and Information Retrieval (SPIRE '01), 2001.
[50] R.Y. Pinter, O. Rokhlenkoa, D. Tsurb, and M. Ziv-Ukelson, "Approximate Labelled Subtree Homeomorphism," J. Discrete Algorithms, vol. 6, no. 3, pp. 480-496, Sept. 2008.
[51] D.P. Bertsekas, Dynamic Programming: Deterministic and Stochastic Models. Prentice-Hall, 1987.
[52] R. Nozeran, "Integration of Organismal Development," Positional Controls in Plant Development, P. Barlow and D. Carr, eds., pp. 375-401, Cambridge Univ. Press, 1984.
[53] D. Barthélémy and Y. Caraglio, "Plant Architecture: A Dynamic, Multilevel and Comprehensive Approach to Plant Form, Structure and Ontogeny," Annals of Botany, vol. 99, no. 3, pp. 375-407, Mar. 2007.
[54] J.W.V. Goethe, Versuch, Die Metamorphose der Pflanzen zu Erklaeren. Carl Wilhelm Ettinger, 1790.
[55] J.W. Von Goethe, Goethe's Botanical Writings. Ox Bow Press, Oct. 1989.
[56] L.E. Gatsuk, O.V. Smirnova, L.I. Vorontzova, L.B. Zaugolnova, and L.A. Zhukova, "Age States of Plants of Various Growth Forms: A Review," J. Ecology, vol. 68, pp. 675-696, 1980.
[57] L. Maillette, "The Value of Meristem States, as Estimated by a Discrete-Time Markov Chain," OIKOS, vol. 59, pp. 235-240, 1990.
[58] P. Prusinkiewicz, Y. Erasmus, B. Lane, L.D. Harder, and E. Coen, "Evolution and Development of Inflorescence Architectures," Science, vol. 316, no. 5830, pp. 1452-1456, June 2007.
[59] R. Mech, M. James, M. Hammel, J. Hanan, and P. Prusinkiewicz, CPFG v4.0 User Manual. The Univ. of Calgary, 2005.
[60] P. Prusinkiewicz, "Art and Science for Life: Designing and Growing Virtual Plants with L-Systems," Acta Horticulturae, vol. 630, pp. 15-28, 2004.
[61] C. Paul-Victor, "Diversité Morphologique Et Architecturale De Quatre Variétés de riz (Oryza sativa, et Oryza glaberrina,)," Master's thesis, Univ. of Jussieu, 2004.
[62] C. Godin, E. Costes, and H. Sinoquet, "A Method for Describing Plant Architecture Which Integrates Topology and Geometry," Annals of Botany, vol. 84, pp. 343-357, 1999.
[63] A. Gupta and N. Nishimura, "Finding Largest Subtrees and Smallest Supertrees," Algorithmica, vol. 21, no. 2, pp. 183-210, 1998.
[64] R.E. Burkard, "Selected Topics on Assignment Problems," Discrete Applied Math., vol. 123, pp. 257-302, 2002.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool