Ubiquity of synonymity: almost all large binary trees are not uniquely identified by their spectra or their immanantal polynomials
<p>Abstract</p> <p>Background</p> <p>There are several common ways to encode a tree as a matrix, such as the adjacency matrix, the Laplacian matrix (that is, the infinitesimal generator of the natural random walk), and the matrix of pairwise distances between leaves. Su...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2012-05-01
|
| Series: | Algorithms for Molecular Biology |
| Online Access: | http://www.almob.org/content/7/1/14 |