Cargando…
Ubiquity of synonymity: almost all large binary trees are not uniquely identified by their spectra or their immanantal polynomials
BACKGROUND: 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. Such representations involve a specific labeling of the v...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2012
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3393622/ https://www.ncbi.nlm.nih.gov/pubmed/22613173 http://dx.doi.org/10.1186/1748-7188-7-14 |