𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fourier inversion formula for evolutionary trees

✍ Scribed by L.A. Székely; P.L. Erdős; M.A. Steel; D. Penny

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
265 KB
Volume
6
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

We establish a pair of identities, which will provide a useful tool in the reconstruction of evolutionary trees in Kimura's 3-parameter model.

📜 SIMILAR VOLUMES

Inversion formula for the windowed Fouri
Inversion formula for the windowed Fourier transform
✍ W. Sun 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## Abstract In this paper, we study the inversion formula for recovering a function from its windowed Fourier transform. We give a rigorous proof for an inversion formula which is known in engineering. We show that the integral involved in the formula is convergent almost everywhere on \documentcla

A formula for the number of labelled tre
A formula for the number of labelled trees
✍ Vites Longani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 347 KB

Let L(n, r) be the number of labelled trees with n points and r end-points. In this paper it is shown that the number L(n, r) can be obtained from the formula

A combinatorial description of the close
A combinatorial description of the closest tree algorithm for finding evolutionary trees
✍ Michael D. Hendy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The closest tree algorith¢a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va