A distance measure between plant architectures

Free Access

Issue		Ann. For. Sci. Volume 57, Number 5-6, June-September 2000 Second International Workshop on Functional-Structural Tree Models


Page(s)		445 - 461
DOI		https://doi.org/10.1051/forest:2000134

References

1: Barthélémy D., Edelin C., Hallé F., Architectural concepts for tropical trees, Chapter in a book: Tropical forests: Botanical dynamics, speciation and diversity, Academic Press London, 1989, pp. 89-100.
2: Barthélemy J.-P., Guénoche A., Les Arbres et Les Représentations Des Proximités, 1988, Collection Méthode + Programmes, Masson, Paris.
3: Costes E., Sinoquet H., Godin C., Kelner J.J., 3D digitizing based on tree topology: application to study the variability of apple quality within the canopy, Acta Horticulturae, 1998.
4: deReffye P., Elguero E., Costes E., Growth units construction in trees: a stochastic approach, Acta Biotheor. 39 (1989) 325-342.
5: deReffye P., Fourcaud T., Blaise F., Barthélémy D., Houllier F., A Functional Model of Tree Growth and Tree Architecture, Silva Fenn. 31 (1997) 297-311.
6: Edmonds J., Karp R.M., Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems, J. Assoc. Comp. Mach. 19 (1972) 248-264.
7: Ferraro P., Une méthode de comparaison structurelle d'arborescences non ordonnées, technical report, Cirad (1998), Montpellier.
8: Godin C., Caraglio Y., A multiscale model of plant topological structures, J. Theor. Biol. 191 (1998) 1-46.
9: Godin C., Costes E., Caraglio Y., Exploring plant topological structure with the AMAPmod Software: an outline, Silva Fenn. 31 (1997) 355-366.
10: Godin C., Guédon Y., Costes E., Caraglio Y., Measuring and analyzing plants with the AMAPmod software, Chapter in a book: Advances in computational life sciences, Vol. I: Plants to ecosystems, CSIRO, Australia, 1997, pp. 63-94.
11: Guédon Y., Costes E., A statistical appraoch for analyzing sequences in fruit tree architecture, Fifth international symposium on computer modelling in fruit research and orchard management (1998), Proceeding, Acta Horticulturae, ISHS.
12: Hallé F., Oldeman R.A.A., Essai sur l'architecture et la dynamique de croissance des arbres tropicaux, 1970, Paris.
13: Hallé F., Oldeman R.A.A., Tomlinson P.B., Tropical trees and forests. An architectural analysis, 1978, Springer Verlag, New York, Heidelberg, Berlin.
14: Hanan J.S., Room P., Practical aspects of plant research, 1997, Australia, Chapter in a book, pp. 28-43.
15: Kaufman L., Rousseuw P.J., Finding groups in data, 1990, Wiley Series in Probability and Mathematical Statistics.
16: Kececioglu J.D., Myers E.W., Combinatorial algorithms for DNA assembly, Algorithmica 13 (1995) 7-51.
17: Kilpelläinen P., Mannila H., The Tree Inclusion Problem, 1 (1991) 202-214, Proc. Internat. Joint Conf. on the Theory and Practice of Software Development (CAAP'91).
18: Kruskal J.B., An Overview of Sequence Comparison, Chapter in Book: Addison-Wesley Publishing Company Inc., 1983, pp. 1-44.
19: Küppers M., Carbon relations and competition between woody species in a Central European hedgerow, Oecologia 66 (1985) 343-352.
20: Kurth W., Growth grammar interpreter GROGRA 2.4: A software for the 3-dimensional interpretation of stochastic, sensitive growth grammars in the context of plant modelling, technical report, Forschungszentrum Waldoekosysteme der Universitaet Goettingen (1994).
21: LeDizès S., Cruiziat P., Lacointe A., Sinoquet H., LeRoux X., Balandier P., Jacquet P., A Model for Simulating Structure-Function Relationships in Walnut Tree Growth Processes, Silva Fenn. 31 (1997) 313-328.
22: Levenstein A., Binary codes capable of correcting deletions, insertions and reversals, Sov. Phy. Dokl. 10 (1966) 707-710.
23: Levinson S.E., Rosenberg A.E., Levinson S.E., Evaluation of a word recognition system using syntax anlysis, Bell Syst. Tech. J. 57 (1978) 1619-1626.
24: Lu S.-Y., A tree-to-tree distance and its application to cluster analysis, IEEE Trans. Pattern Anal. Mach. Intell. 1 (1979) 219-224.
25: Mech R., Prusinkiewicz P., Visual models of plants interacting with their environment, SIGGRAPH 96 Conference Proceedings (1996) 397-410.
26: Miclet L., Méthodes Structurelles Pour la Reconnaissance Des Formes, 1984, 61 Bd. Saint-Germain, 75005 Paris, 184, Book.
27: Noetzel A.S., Selkow S.M., An Analysis of the General Tree-Editing Problem, Addison-Wesley Publishing Company Inc., 1983, pp. 237-252.
28: Ohmori A., Tanaka E., A unified view on tree metrics, Syntactic Struct. Patt. Recognition 45 (1988) 85-100.
29: Preparata F.P., Yeh R.T., Introduction to Discrete Structures for Computer Science and Engineering, 1973.
30: Prusinkiewicz P., Lindenmayer A., The algorithmic beauty of plants, 1990, New York.
31: Robinson D.F., A symbolic framework for the description of tree architecture models, Botan. J. Linn. Soc. 121 (1996) 243-261.
32: Selkow S.M., The tree-to-tree editing problem, Inf. Proc. Lett. (1977) 184-186.
33: Sinoquet H., Rivet P., Godin C., Assessment of the three-dimensional architecture of walnut trees using digitizing, Silva Fenn. 31 (1997) 265-273.
34: Sobel E., Martinez H., A multiple sequence alignment program, Nucleic Acid Res. 12 (1986) 75-88.
35: Stanley R.P., Enumerative combinatorics, 1986, Monterey Vol. 1.
36: Swofford D.L., Olsen G.J., Phylogeny reconstruction, 1990, Sunderland, Massachussets, USA, 411-501, Chapter in a book: Molecular Systematics, Sinauer Associates, Sunderland, Massachussets, USA.
37: Tai K.-C., The tree-to-tree correction problem, J. Ass. Comp. Mach. (1979) 422-433.
38: Tanaka E., Tanaka K., The tree-to-tree editing problem, Internat. J. Patt. Recogn. Artif. Intell. 2 (1988) 221-240.
39: Tanaka E., Toyama T., Kawai S., High speed error correction of phoneme sequences, Patt. Recogn. 19 (1986) 407-412.
40: Tarjan R.E., Data Structures and Network Algorithms, Chapter in a book, Regional Conference Series in Applied Mathematics, Murray Hill, New Jersey, USA, 1983, pp. 97-111.
41: Tarjan R.E., Data Structures and Network Algorithms, Chapter in a book: Regional Conference Series in Applied Mathematics, Murray Hill, New Jersey, USA, 1983, pp. 85-96.
42: Wagner R.A., Fisher M.J., The string-to-string correction problem, J. Ass. Comp. Mach. 21 (1974) 168-173.
43: Zhang K., A new editing-based distance between unordered trees, 4th CPM'93 Padala, Italy, 1993, pp. 254-265.
44: Zhang K., A constrained edit distance between unordered labeled trees, Algorithmica 15 (1996) 205-222.
45: Zhang K., Jiang T., Some MAX SNP-hard results concerning unordered labeled trees, Inf. Proc. Lett. 49 (1994) 249-254.

Abstract