{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:46Z","timestamp":1725474646386},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540499947"},{"type":"electronic","value":"9783540499954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944836_17","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T23:48:02Z","timestamp":1164671282000},"page":"164-175","source":"Crossref","is-referenced-by-count":0,"title":["Linear-Time Algorithms for Two Subtree-Comparison Problems on Phylogenetic Trees with Different Species"],"prefix":"10.1007","author":[{"given":"Sun-Yuan","family":"Hsieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A. Amir","year":"1997","unstructured":"Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing\u00a026(6), 1656\u20131669 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-45123-4_12","volume-title":"Combinatorial Pattern Matching","author":"P. Bonizzoni","year":"2000","unstructured":"Bonizzoni, P., Della Vedova, G., Mauri, G.: Approximating the maximum isomorphic agreement subtree is hard. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 119\u2013128. Springer, Heidelberg (2000)"},{"key":"17_CR3","unstructured":"Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees, PhD thesis, University of Canterbury, Christchurch, New Zealand (1997)"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R. Cole","year":"2002","unstructured":"Cole, R., Farach, M., Hariharan, R., Przytycka, T., Thorup, M.: An O(nlogn) algorithm for the maximum agreement subtree problem for binary trees. SIAM Journal on Computing\u00a030(5), 1385\u20131404 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01908061","volume":"2","author":"W.H.E. Day","year":"1985","unstructured":"Day, W.H.E.: Optimal algorithms for comparing trees with labelled leaves. Journal of Classification\u00a02, 7\u201328 (1985)","journal-title":"Journal of Classification"},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M. Farach","year":"1995","unstructured":"Farach, M., Przytycka, T.M., Thorup, M.: On the agreement of many trees. Information Processing Letters\u00a055(6), 297\u2013301 (1995)","journal-title":"Information Processing Letters"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/S0097539794262422","volume":"26","author":"M. Farach","year":"1997","unstructured":"Farach, M., Thorup, M.: Sparse dynamic programming for evolutionary-tree comparison. SIAM Journal on Computing\u00a026(1), 210\u2013230 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1086\/412935","volume":"57","author":"J. Felsenstein","year":"1982","unstructured":"Felsenstein, J.: Numerical methods for inferring evolutionary trees. Quarterly Review on Biology\u00a057(4), 379\u2013404 (1982)","journal-title":"Quarterly Review on Biology"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W.M. Fitch","year":"1971","unstructured":"Fitch, W.M.: Toward defining the course of evolution: minimal change for a specific tree topology. Systematic Zoology\u00a020, 406\u2013441 (1971)","journal-title":"Systematic Zoology"},{"key":"17_CR10","unstructured":"Gordon, A.D.: On the assessment and comparison of classifications. In: Tomassone, R. (ed.) Analyse de Donn\u00e9es et Informatique, INRIA, pp. 149\u2013160 (1980)"},{"key":"17_CR11","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":"2","key":"17_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR13","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. John Wiley, Chichester (1975)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0166-218X(96)00062-5","volume":"71","author":"J. Hein","year":"1996","unstructured":"Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics\u00a071, 153\u2013169 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR15","doi-asserted-by":"crossref","DOI":"10.1128\/9781555818319","volume-title":"Two-Component Signal Transduction","author":"J.A. Hoch","year":"1995","unstructured":"Hoch, J.A., Silhavy, T.J.: Two-Component Signal Transduction. ASM Press, Washington (1995)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/978-3-540-24587-2_36","volume-title":"Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC)","author":"Y.L. Lin","year":"2003","unstructured":"Lin, Y.L., Hsu, T.S.: Efficient algorithms for descendent subtrees comparison of phylogenetic trees with applications to co-evolutionary classifications in bacterial genome. In: Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC). LNCS, vol.\u00a02906, pp. 339\u2013351. Springer, Heidelberg (2003)"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0966-842X(00)01833-3","volume":"8","author":"A. Rodrigue","year":"2000","unstructured":"Rodrigue, A., Quentin, Y., Lazdunski, A., M\/\u2019ejean, V., Foglino, M.: Two-component systems in pseudomonas aeruginosa: why so many? Trends Microbiol.\u00a08, 498\u2013504 (2000)","journal-title":"Trends Microbiol."},{"key":"17_CR18","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":"17_CR19","unstructured":"Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing company (1997)"},{"issue":"7","key":"17_CR20","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K. Strimmer","year":"1996","unstructured":"Strimmer, K., von Haeseler, A.: Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution\u00a013(7), 964\u2013969 (1996)","journal-title":"Molecular Biology and Evolution"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944836_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:52:45Z","timestamp":1619495565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944836_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540499947","9783540499954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11944836_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}