{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:05Z","timestamp":1725558785363},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200765"},{"type":"electronic","value":"9783540397632"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39763-2_20","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T20:49:30Z","timestamp":1277498970000},"page":"259-270","source":"Crossref","is-referenced-by-count":2,"title":["Computing Refined Buneman Trees in Cubic Time"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"\u00d6stlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian N. S.","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Srinivasa","family":"Rao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Dress, A.W.: Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics\u00a07, 309\u2013343 (1986)","journal-title":"Advances in Applied Mathematics"},{"key":"20_CR2","volume-title":"Trees and Proximity Representations","author":"J.-P. Barth\u00e9l\u00e9my","year":"1991","unstructured":"Barth\u00e9l\u00e9my, J.-P., Gu\u00e9noche, A.: Trees and Proximity Representations. John Wiley & Sons, Chichester (1991)"},{"doi-asserted-by":"crossref","unstructured":"Berry, V., Bryant, D.: Faster reliable phylogenetic analysis. In: Proc. 3rd International Conference on Computational Molecular Biology (RECOMB), pp. 69\u201369 (1999)","key":"20_CR3","DOI":"10.1145\/299432.299457"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00235-2","volume":"240","author":"V. Berry","year":"2000","unstructured":"Berry, V., Gascuel, O.: Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science\u00a0240, 271\u2013298 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"20_CR5","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1006\/aama.2001.0758","volume":"27","author":"D. Bryant","year":"2001","unstructured":"Bryant, D., Berry, V.: A structured family of clustering and tree construction methods. Advances in Applied Mathematics\u00a027(4), 705\u2013732 (2001)","journal-title":"Advances in Applied Mathematics"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0893-9659(98)00148-7","volume":"12","author":"D. Bryant","year":"1999","unstructured":"Bryant, D., Moulton, V.: A polynomial time algorithm for constructing the refined buneman tree. Applied Mathematics Letters\u00a012, 51\u201356 (1999)","journal-title":"Applied Mathematics Letters"},{"key":"20_CR7","first-page":"387","volume-title":"Mathematics in Archaeological and Historical Sciences","author":"P. Buneman","year":"1971","unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In: Hodson, F., Kendall, D., Tautu, P. (eds.) Mathematics in Archaeological and Historical Sciences, pp. 387\u2013395. Edinburgh University Press, Edinburgh (1971)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J.C. Gower","year":"1969","unstructured":"Gower, J.C., Ross, J.G.S.: Minimum spanning trees and single-linkage cluster analysis. Applied Statistics\u00a018, 54\u201364 (1969)","journal-title":"Applied Statistics"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/net.3230210104","volume":"21","author":"D. Gusfield","year":"1991","unstructured":"Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks\u00a021, 19\u201328 (1991)","journal-title":"Networks"},{"issue":"1","key":"20_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1093\/bioinformatics\/14.1.68","volume":"14","author":"D. Huson","year":"1998","unstructured":"Huson, D.: Splitstree: a program for analyzing and visualizing evolutionary data. Bioinformatics\u00a014(1), 68\u201373 (1998), http:\/\/www-ab.informatik.uni-tuebingen.de\/software\/splits\/welcome_en.html","journal-title":"Bioinformatics"},{"key":"20_CR11","first-page":"5","volume":"73","author":"B. Leclerc","year":"1981","unstructured":"Leclerc, B.: Description combinatoire des altram\u00e9trique\u00e8s. Math. Sci. Hum.\u00a073, 5\u201337 (1981)","journal-title":"Math. Sci. Hum."},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(98)00128-0","volume":"91","author":"V. Moulton","year":"1999","unstructured":"Moulton, V., Steel, M.: Retractions of finite distance functions onto tree metrics. Discrete Applied Mathematics\u00a091, 215\u2013233 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR13","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195135848.001.0001","volume-title":"Molecular Evolution and Phylogenetics","author":"M. Nei","year":"2000","unstructured":"Nei, M., Kumar, S.: Molecular Evolution and Phylogenetics. Oxford University Press, Oxford (2000)"},{"key":"20_CR14","first-page":"406","volume":"4","author":"N. Saitou","year":"1987","unstructured":"Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology Evolution\u00a04, 406\u2013425 (1987)","journal-title":"Molecular Biology Evolution"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Sch\u00f6nhage","year":"1976","unstructured":"Sch\u00f6nhage, A., Paterson, M.S., Pippenger, N.: Finding the median. Journal of Computer and System Sciences\u00a013, 184\u2013199 (1976)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39763-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:45:47Z","timestamp":1711572347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39763-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200765","9783540397632"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39763-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}