{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:58:24Z","timestamp":1725533904423},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027765"},{"type":"electronic","value":"9783642027772"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02777-2_3","type":"book-chapter","created":{"date-parts":[[2009,6,26]],"date-time":"2009-06-26T06:58:18Z","timestamp":1245999498000},"page":"4-17","source":"Crossref","is-referenced-by-count":10,"title":["Efficiently Calculating Evolutionary Tree Measures Using SAT"],"prefix":"10.1007","author":[{"given":"Mar\u00eda Luisa","family":"Bonet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine St.","family":"John","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"B. Allen","year":"2001","unstructured":"Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics\u00a05, 1\u201313 (2001)","journal-title":"Annals of Combinatorics"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1080\/10635150500431197","volume":"55","author":"M. Baroni","year":"2006","unstructured":"Baroni, M., Semple, C., Steel, M.: Hybrids in real time. Systematic Biology\u00a055, 46\u201356 (2006)","journal-title":"Systematic Biology"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/1471-2148-6-15","volume":"6","author":"R.G. Beiko","year":"2006","unstructured":"Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol.\u00a06, 15 (2006)","journal-title":"BMC Evol. Biol."},{"issue":"8","key":"3_CR4","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1089\/cmb.2006.13.1419","volume":"13","author":"M.L. Bonet","year":"2006","unstructured":"Bonet, M.L., John, K.S., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. Journal of Computational Biology\u00a013(8), 1419\u20131434 (2006)","journal-title":"Journal of Computational Biology"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s00026-004-0229-z","volume":"8","author":"M. Bordewich","year":"2005","unstructured":"Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics\u00a08, 409\u2013423 (2005)","journal-title":"Annals of Combinatorics"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Applied Mathematics (2007)","DOI":"10.1016\/j.dam.2006.08.008"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1177\/117693430700300017","volume":"3","author":"M. Bordewich","year":"2007","unstructured":"Bordewich, M., Linz, S., John, K.S., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evolutionary Bioinformatics\u00a03, 86\u201398 (2007)","journal-title":"Evolutionary Bioinformatics"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-72788-0_15","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"H. Zhang","year":"2007","unstructured":"Zhang, H., Li, C.M., Wei, W.: Combining adaptive noise and look-ahead in local search for SAT. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 121\u2013133. Springer, Heidelberg (2007)"},{"key":"3_CR9","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 labeled leaves. Journal of Classification\u00a02, 7\u201328 (1985)","journal-title":"Journal of Classification"},{"key":"3_CR10","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Software, http:\/\/www.cs.chalmers.se\/Cs\/Research\/FormalMethods\/MiniSat\/"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Grass Phylogeny\u00a0Working Group. Phylogeny and subfamilial classification of the grasses (poaceae). Annals of the Missouri Botanical Garden 88(3), 373\u2013457 (2001)","DOI":"10.2307\/3298585"},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1145\/369133.369188","volume-title":"Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB 2001)","author":"M.T. Hallett","year":"2001","unstructured":"Hallett, M.T., Lagergren, J.: Efficient algorithms for lateral gene transfer problems. In: ACM (ed.) Proceedings of the Fifth Annual International Conference on Computational Molecular Biology (RECOMB 2001), pp. 149\u2013156. ACM, New York (2001)"},{"key":"3_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":"3_CR15","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3233\/SAT190016","volume":"2","author":"M.J.H. Heule","year":"2006","unstructured":"Heule, M.J.H., van Maaren, H.: March dl: Adding adaptive heuristics and a new branching strategy. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 47\u201359 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/molbev\/msj030","volume":"23","author":"D.H. Huson","year":"2006","unstructured":"Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution\u00a023(2), 254\u2013267 (2006)","journal-title":"Molecular Biology and Evolution"},{"key":"3_CR17","unstructured":"Lynce, I., Marques Silva, J.P.: Efficient haplotype inference with boolean satisfiability. In: Proceedings of National Conference on Artificial Intelligence (AAAI) (2006)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/TCBB.2004.10","volume":"1","author":"B. Moret","year":"2004","unstructured":"Moret, B., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: Modeling, reconstructibility and accuracy. IEEE Transactions on Computational Biology and Bioinformatics\u00a01(1), 13\u201323 (2004)","journal-title":"IEEE Transactions on Computational Biology and Bioinformatics"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Munzner, T., Guimbr\u00e8tiere, F., Tasiran, S., Zhang, L., Zhou, Y.: TreeJuxtaposer: Scalable tree comparison using Focus+Context with guaranteed visibility. In: SIGGRAPH 2003 Proceedings, published as special issue of Transactions on Graphics, pp. 453\u2013462 (2003)","DOI":"10.1145\/1201775.882291"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11533719_11","volume-title":"Computing and Combinatorics","author":"L. Nakhleh","year":"2005","unstructured":"Nakhleh, L., Ruths, D., Wang, L.-S.: RIATA-HGT: A fast and accurate heuristic for reconstructing horizontal gene transfer. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 84\u201393. Springer, Heidelberg (2005)"},{"key":"3_CR21","first-page":"41","volume":"10","author":"G.J. Olsen","year":"1994","unstructured":"Olsen, G.J., Matsuda, H., Hagstrom, R., Overbeek, R.: Fastdnaml: A tool for construction of phylogenetic trees of dna sequences using maximum likelihood. Comput. Appl. Biosci.\u00a010, 41\u201348 (1994)","journal-title":"Comput. Appl. Biosci."},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1093\/bioinformatics\/19.2.301","volume":"19","author":"M.J. Sanderson","year":"2003","unstructured":"Sanderson, M.J.: r8s; inferring absolute rates of evolution and divergence times in the absence of a molecular clock. Bioinformatics\u00a019, 301\u2013302 (2003)","journal-title":"Bioinformatics"},{"key":"3_CR23","unstructured":"Schmidt, H.A.: Phylogenetic trees from large datasets. PhD thesis, Heinrich-Heine-Universitat, Dusseldorf (2003)"},{"key":"3_CR24","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Software, http:\/\/www.cs.rochester.edu\/u\/kautz\/walksat\/"},{"key":"3_CR25","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Trick, M., Johnson, D.S. (eds.) Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability, Providence RI (1993)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Semple, C.: Hybridization networks. New Mathematical Models for Evolution. Oxford University Press, Oxford (2007)","DOI":"10.1093\/oso\/9780199208227.003.0010"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/11527695_24","volume-title":"Theory and Applications of Satisfiability Testing","author":"D.A.D. Tompkins","year":"2005","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 306\u2013320. Springer, Heidelberg (2005)"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1093\/bioinformatics\/btn606","volume":"25","author":"Y. Wu","year":"2009","unstructured":"Wu, Y.: A practical method for exact computation of subtree prune and regraft distance. Bioinformatics\u00a025(2), 190\u2013196 (2009)","journal-title":"Bioinformatics"},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla:portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02777-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T21:42:27Z","timestamp":1710452547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02777-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027765","9783642027772"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02777-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}