On rotation distance between binary coupling trees and applications for 3nj-coefficients

Computer Physics Communications

Volumn 119, Issue 2, 1999, Pages 99-114

  Fack, V ^a   Lievens, S ^a   Van Der Jeugt, J ^a,b  

^a GHENT UNIVERSITY   (Belgium)

^b Res Assoc of the Fund Sci Res   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; TREES (MATHEMATICS);

BINARY COUPLING TREES; GROUP THEORY; LIE ALGEBRA; MATHEMATICAL BIOLOGY; RACAH COEFFICIENTS; RACAH-WIGNER THEORY;

QUANTUM THEORY;

EID: 0033516239     PISSN: 00104655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4655(99)00216-7     Document Type: Article

References (33)

1. A.P. Yutsis, I.B. Levinson, V.V. Vanagas, Mathematical Apparatus of the Theory of Angular Momentum (Israel Program for Scientific Translation, Jerusalem, 1962).
2. E. El Baz, B. Castel, Graphical Methods of Spin Algebra in Atomic, Nuclear, and Particle Physics (Marcel Dekker, New York, 1972).
3. L.C. Biedenharn, J.D. Louck, The Racah-Wigner algebra in quantum theory, Encyclopedia of Mathematics and its Applications, Vol. 9, G.-C. Rota, ed. (Addison-Wesley, Reading, MA, 1981).
4. A.R. Edmonds, Angular Momentum in Quantum Physics (Princeton Univ. Press, Princeton, 1957).
5. P.G. Burke, A program to calculate a general recoupling coefficient, Comput. Phys. Commun. 1 (1970) 241-250.
6. A. Bar-Shalom, M. Klapisch, NJGRAF - An efficient program for calculation of general recoupling coefficients by graphical analysis, compatible with NJSYM, Comput. Phys. Commun. 50 (1988) 375-393.
7. V. Fack, S.N. Pitre, J. Van der Jeugt, New efficient programs to calculate general recoupling coefficients. Part I: Generation of a summation formula, Comput. Phys. Commun. 83 (1994) 275-292.
8. V. Fack, S.N. Pitre, J. Van der Jeugt, New efficient programs to calculate general recoupling coefficients. Part II: Evaluation of a summation formula, Comput. Phys. Commun. 86 (1995) 105-122.
9. V. Fack, S.N. Pitre, J. Van der Jeugt, Calculation of general recoupling coefficients using graphical methods, Comput. Phys. Commun. 101 (1997) 155-170.
10. D.F. Robinson, Comparison of labeled trees with valency three, J. Combinatorial Theory Ser. B 11 (1971) 105-119.
11. K. Culik II, D. Wood, A note on some tree similarity measures, Inform. Process. Lett. 15 (1982) 39-42.
12. M.S. Waterman, T.F. Smith, On the similarity of dendrograms, J. Theor. Biol. 73 (1978) 789-800.
13. J.P. Jarvis, J.K. Luedeman, D.R. Shier, Comments on computing the similarity of binary trees, J. Theor. Biol. 100 (1983) 427-433.
14. W.H.E. Day, Properties of the nearest neighbor interchange metric for trees of small size, J. Theor. Biol. 101 (1983) 275-288.
15. R.P. Boland, E.K. Brown, W.H.E. Day, Approximating minimum-length-sequence metrics: A cautionary note, Math. Soc. Sci. 4 (1983) 261-270.
16. F. Buckley, F. Harary, Distance in Graphs (Addison-Wesley, Reading, MA, 1990).
17. B.G. Wybourne, Classical Groups for Physicists (Wiley, New York, 1974).
18. J.-Q. Chen, P.-N. Wang, Z.-M. Lü, X.-B. Wu, Tables of the Clebsch-Gordan, Racah and Subduction Coefficients of SU(n) Groups (World Scientific, Singapore, 1987).
19. N.J.A. Sloane, On-Line Encyclopedia of Integer Sequences, URL: http://www.research.att.com/~njas/sequences/.
20. A. Cayley, On the analytical forms called trees, with application to the theory of chemical combinations, Rep. British Assoc. Advance. Sci. 45 (1875) 257-305.
21. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
22. M. Li, J. Tromp, L. Zhang, On the nearest neighbour interchange distance between evolutionary trees, J. Theor. Biol. 182 (1996) 463-467.
23. M. Li, J. Tromp, L. Zhang, Some notes on the nearest neighbour interchange distance, Lect. Notes Comput. Sci. 1090 (1996) 343-351.
24. V. Fack, S. Lievens, J. Van der Jeugt, On the Diameter of the Rotation Graph of Binary Coupling Trees, University of Ghent preprint (1999).
25. D.D. Sleator, R.E. Tarjan, W.P. Thurston, Short encodings of evolving structures, SIAM J. Disc. Math. 5 (1992) 428-450.
26. F. Murtagh, Counting dendrograms: A survey, Discrete Appl. Math. 7 (1984) 191-199.
27. E.K. Brown, W.H.E. Day, A computationally efficient approximating to the nearest neighbor interchange metric, J. Class. 1 (1984) 93-124.
28. W.H.E. Day, Optimal algorithms for comparing trees with labeled leaves, J. Class. 2 (1985) 7-28.
29. M. Křivánek, Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete, J. Class. 3 (1986) 55-60.
30. D.D. Sleator, R.E. Tarjan, W.P. Thurston, Rotation distance, triangulations and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988) 647-681.
31. E. Mäkinen, On the rotation distance of binary trees, Inform. Process. Lett. 26 (1987) 271-272.
32. F. Luccio, L. Pagli, On the upper bound on the rotation distance of binary trees, Inform. Process. Lett. 31 (1989) 57-60.
33. R.O. Rogers, R.D. Dutton, On distance in the rotation graph of binary trees, Congr. Numer. 120 (1996) 103-113.