{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:21Z","timestamp":1759335501113},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T00:00:00Z","timestamp":1337558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1186\/1748-7188-7-14","type":"journal-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T14:14:32Z","timestamp":1337609672000},"source":"Crossref","is-referenced-by-count":6,"title":["Ubiquity of synonymity: almost all large binary trees are not uniquely identified by their spectra or their immanantal polynomials"],"prefix":"10.1186","volume":"7","author":[{"given":"Frederick A","family":"Matsen","sequence":"first","affiliation":[]},{"given":"Steven N","family":"Evans","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,21]]},"reference":[{"key":"150_CR1","volume-title":"Inferring Phylogenies","author":"J Felsenstein","year":"2004","unstructured":"Felsenstein J: Inferring Phylogenies. 2004, Sunderland, MA: Sinauer Press,"},{"key":"150_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1086\/419657","volume":"72","author":"A Mooers","year":"1997","unstructured":"Mooers A, Heard S: Evolutionary process from phylogenetic tree shape. Q Rev Biol. 1997, 72: 31-54. 10.1086\/419657","journal-title":"Q Rev Biol"},{"issue":"4","key":"150_CR3","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.2307\/2409983","volume":"47","author":"M Kirkpatrick","year":"1993","unstructured":"Kirkpatrick M, Slatkin M: Searching for evolutionary patterns in the shape of a phylogenetic tree. Evolution. 1993, 47 (4): 1171-1181. 10.2307\/2409983","journal-title":"Evolution"},{"issue":"6","key":"150_CR4","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1080\/10635150290102564","volume":"51","author":"P Agapow","year":"2002","unstructured":"Agapow P, Purvis A: Power of eight tree shape statistics to detect nonrandom diversification: A comparison by simulation of two models of cladogenesis. Syst Biol. 2002, 51 (6): 866-872.","journal-title":"Syst Biol"},{"issue":"4","key":"150_CR5","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1080\/10635150600889617","volume":"55","author":"FA Matsen","year":"2006","unstructured":"Matsen FA: A geometric approach to tree shape statistics. Systematic biology. 2006, 55 (4): 652-661.","journal-title":"Systematic biology"},{"issue":"3","key":"150_CR6","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/tcbb.2007.1020","volume":"4","author":"FA Matsen","year":"2007","unstructured":"Matsen FA: Optimization over a class of tree shape statistics. IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB). 2007, 4 (3): 506-512.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics (TCBB)"},{"key":"150_CR7","volume-title":"Algebraic graph theory","author":"N Biggs","year":"1993","unstructured":"Biggs N: Algebraic graph theory. 1993, Cambridge Mathematical Library, Cambridge: Cambridge University Press, second,","edition":"second"},{"key":"150_CR8","volume-title":"Spectral graph theory, Volume 92 of CBMS Regional Conference Series in Mathematics","author":"FRK Chung","year":"1997","unstructured":"Chung FRK: Spectral graph theory, Volume 92 of CBMS Regional Conference Series in Mathematics. 1997, Published for the Conference Board of the Mathematical Sciences, Washington, DC,"},{"key":"150_CR9","volume-title":"Phylogenetics, Volume 24 of Oxford Lecture Series in Mathematics and its Applications","author":"C Semple","year":"2003","unstructured":"Semple C, Steel M: Phylogenetics, Volume 24 of Oxford Lecture Series in Mathematics and its Applications. 2003, Oxford: Oxford University Press,"},{"key":"150_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s004540010020","volume":"24","author":"A Gupta","year":"2000","unstructured":"Gupta A: Embedding tree metrics into low-dimensional Euclidean spaces. Discrete Comput Geom. 2000, 24: 105-116.","journal-title":"Discrete Comput Geom"},{"key":"150_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures in Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek J: Lectures in Discrete Geometry. 2002, New York: Springer,"},{"key":"150_CR12","volume-title":"Spectra of graphs","author":"DM Cvetkovi\u0107","year":"1995","unstructured":"Cvetkovi\u0107 DM, Doob M, Sachs H: Spectra of graphs. 1995, Heidelberg: Johann Ambrosius Barth, third,","edition":"third"},{"key":"150_CR13","first-page":"275","volume-title":"New Directions in the Theory of Graphs","author":"AJ Schwenk","year":"1973","unstructured":"Schwenk AJ: Almost all trees are cospectral. New Directions in the Theory of Graphs. 1973, 275-307. New York: Acade-meic Press,"},{"issue":"4","key":"150_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1002\/jgt.3190170404","volume":"17","author":"P Botti","year":"1993","unstructured":"Botti P, Merris R: Almost all trees share a complete set of immanantal polynomials. J Graph Theory. 1993, 17 (4): 467-476. 10.1002\/jgt.3190170404","journal-title":"J Graph Theory"},{"issue":"2","key":"150_CR15","doi-asserted-by":"publisher","first-page":"121","DOI":"10.2307\/1967710","volume":"24","author":"JHM Wedderburn","year":"1922","unstructured":"Wedderburn JHM: The functional equation g(x2) = 2\u03b1x + [g(x)]2. Ann of Math (2). 1922, 24 (2): 121-140. 10.2307\/1967710","journal-title":"Ann of Math (2)"},{"key":"150_CR16","volume-title":"Representation theory of the symmetric group","author":"GdB Robinson","year":"1961","unstructured":"Robinson GdB: Representation theory of the symmetric group. 1961, Mathematical Expositions, No. 12, University of Toronto Press, Toronto,"},{"key":"150_CR17","volume-title":"Representation theory, Volume 129 of Graduate Texts in Mathematics","author":"W Fulton","year":"1991","unstructured":"Fulton W, Harris J: Representation theory, Volume 129 of Graduate Texts in Mathematics. 1991, New York: Springer-Verlag,"},{"key":"150_CR18","volume-title":"Representations of finite and compact groups, Volume 10 of Graduate Studies in Mathematics","author":"B Simon","year":"1996","unstructured":"Simon B: Representations of finite and compact groups, Volume 10 of Graduate Studies in Mathematics. 1996, Providence, RI: American Mathematical Society,"},{"key":"150_CR19","volume-title":"The symmetric group, Volume 203 of Graduate Texts in Mathematics","author":"BE Sagan","year":"2001","unstructured":"Sagan BE: The symmetric group, Volume 203 of Graduate Texts in Mathematics. 2001, New York: Springer-Verlag, second,","edition":"second"},{"key":"150_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1098\/rsta.1934.0015","volume":"233","author":"DE Littlewood","year":"1934","unstructured":"Littlewood DE, Richardson AR: Group characters and algebra. Philos Trans Roy Soc London A. 1934, 233: 99-141. 10.1098\/rsta.1934.0015","journal-title":"Philos Trans Roy Soc London A"},{"key":"150_CR21","volume-title":"The Theory of Group Characters and Matrix Representations of Groups","author":"DE Littlewood","year":"1940","unstructured":"Littlewood DE: The Theory of Group Characters and Matrix Representations of Groups. 1940, New York: Oxford University Press,"},{"issue":"1-3","key":"150_CR22","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/S0019-9958(83)80056-4","volume":"58","author":"JM Steyaert","year":"1983","unstructured":"Steyaert JM, Flajolet P: Patterns and pattern-matching in trees: an analysis. Inform and Control. 1983, 58 (1-3): 19-58. 10.1016\/S0019-9958(83)80056-4","journal-title":"Inform and Control"},{"key":"150_CR23","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0001-8708(78)90005-1","volume":"29","author":"R Graham","year":"1978","unstructured":"Graham R, Lov\u00e1sz L: Distance matrix polynomials of trees. Adv Mathematics. 1978, 29: 60-88. 10.1016\/0001-8708(78)90005-1","journal-title":"Adv Mathematics"},{"key":"150_CR24","volume-title":"U.C Berkeley Department of Statistics Technical Report No. 771","author":"S Bhamidi","year":"2009","unstructured":"Bhamidi S, Evans SN, Sen A: Spectra of large random trees. U.C Berkeley Department of Statistics Technical Report No. 771. 2009, [To appear in J. Theoret. Probab.],"},{"key":"150_CR25","volume-title":"D\u00e9veloppement d'applications avec Objective CAML. . ,","author":"E Chailloux","year":"2000","unstructured":"Chailloux E, Manoury P, Pagano B: D\u00e9veloppement d'applications avec Objective CAML. . , Sebastopol, CA: O'Reilly 2000, \n                    http:\/\/caml.inria.fr\/pub\/docs\/oreilly-book\/"},{"key":"150_CR26","doi-asserted-by":"publisher","first-page":"583","DOI":"10.2307\/1969046","volume":"49","author":"R Otter","year":"1948","unstructured":"Otter R: The number of trees. Ann of Math (2). 1948, 49: 583-599. 10.2307\/1969046","journal-title":"Ann of Math (2)"},{"issue":"2","key":"150_CR27","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1112\/S0025579300009177","volume":"24","author":"BV Landau","year":"1977","unstructured":"Landau BV: An asymptotic expansion for the Wedderburn-Etherington sequence. Mathematika. 1977, 24 (2): 262-265. 10.1112\/S0025579300009177","journal-title":"Mathematika"},{"issue":"4","key":"150_CR28","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S1446788700016190","volume":"20","author":"F Harary","year":"1975","unstructured":"Harary F, Robinson RW, Schwenk AJ: Twenty-step algorithm for determining the asymptotic number of trees of various species. J Austral Math Soc Ser A. 1975, 20 (4): 483-503. 10.1017\/S1446788700016190","journal-title":"J Austral Math Soc Ser A"},{"issue":"3","key":"150_CR29","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1017\/S1446788700033760","volume":"41","author":"F Harary","year":"1986","unstructured":"Harary F, Robinson RW, Schwenk AJ: Corrigendum: \"Twenty-step algorithm for determining the asymptotic number of trees of various species\" [J. Austral. Math. Soc. Ser. A 20 (1975), no. 4, 483-503; MR0406858 (53 #10644)]. J Austral Math Soc Ser A. 1986, 41 (3): 325-10.1017\/S1446788700033760. 10.1017\/S1446788700033760","journal-title":"J Austral Math Soc Ser A"},{"key":"150_CR30","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1137\/1016082","volume":"16","author":"EA Bender","year":"1974","unstructured":"Bender EA: Asymptotic methods in enumeration. SIAM Rev. 1974, 16: 485-515. 10.1137\/1016082","journal-title":"SIAM Rev"},{"issue":"2","key":"150_CR31","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1137\/1018045","volume":"18","author":"EA Bender","year":"1976","unstructured":"Bender EA: Errata: \"Asymptotic methods in enumeration\" (SIAM Rev. 16 (1974), 485-515). SIAM Rev. 1976, 18 (2): 292-10.1137\/1018045. 10.1137\/1018045","journal-title":"SIAM Rev"},{"issue":"1-3","key":"150_CR32","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0012-365X(95)00041-T","volume":"154","author":"T Lu","year":"1996","unstructured":"Lu T: The enumeration of trees with and without given limbs. Discrete Math. 1996, 154 (1-3): 153-165. 10.1016\/0012-365X(95)00041-T","journal-title":"Discrete Math"},{"key":"150_CR33","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/3605743","volume":"21","author":"I Etheringtion","year":"1937","unstructured":"Etheringtion I: Non-associate powers and a functional equation. Math Gaz. 1937, 21: 36-39. 10.2307\/3605743","journal-title":"Math Gaz"},{"issue":"10","key":"150_CR34","doi-asserted-by":"publisher","first-page":"697","DOI":"10.2307\/2305574","volume":"56","author":"CD Olds","year":"1949","unstructured":"Olds CD, Becker HW: Advanced Problems and Solutions: Solutions: 4277. Amer Math Monthly. 1949, 56 (10): 697-699. 10.2307\/2305574","journal-title":"Amer Math Monthly"},{"key":"150_CR35","doi-asserted-by":"publisher","first-page":"44","DOI":"10.2307\/1426329","volume":"3","author":"EF Harding","year":"1971","unstructured":"Harding EF: The probabilities of rooted tree-shapes generated by random bifurcation. Adv Appl Probability. 1971, 3: 44-77. 10.2307\/1426329","journal-title":"Adv Appl Probability"},{"issue":"3","key":"150_CR36","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1137\/S003614459732076X","volume":"40","author":"SH Hou","year":"1998","unstructured":"Hou SH: A simple proof of the Leverrier-Faddeev characteristic polynomial algorithm. SIAM Rev. 1998, 40 (3): 706-709. 10.1137\/S003614459732076X","journal-title":"SIAM Rev"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-14.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-7-14\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-14.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T18:47:07Z","timestamp":1548096427000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-7-14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,21]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-7-14","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,21]]},"article-number":"14"}}