{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:21Z","timestamp":1740099621650,"version":"3.37.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030364113"},{"type":"electronic","value":"9783030364120"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-36412-0_4","type":"book-chapter","created":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:04:15Z","timestamp":1575572655000},"page":"39-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimum-Width Drawings of Phylogenetic Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5676-7011","authenticated-orcid":false,"given":"Juan Jose","family":"Besa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]},{"given":"Timothy","family":"Johnson","sequence":"additional","affiliation":[]},{"given":"Martha C.","family":"Osegueda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,23]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-319-50106-2","volume-title":"Graph Drawing and Network Visualization","author":"MJ Alam","year":"2016","unstructured":"Alam, M.J., Dillencourt, M., Goodrich, M.T.: Capturing Lombardi flow in orthogonal drawings by minimizing the number of segments. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 608\u2013610. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-50106-2"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1007\/11602613_110","volume-title":"Algorithms and Computation","author":"C Bachmaier","year":"2005","unstructured":"Bachmaier, C., Brandes, U., Schlieper, B.: Drawing phylogenetic trees. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1110\u20131121. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11602613_110"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-642-25878-7_35","volume-title":"Graph Drawing","author":"MJ Bannister","year":"2012","unstructured":"Bannister, M.J., Eppstein, D.: Hardness of approximate compaction for nonplanar orthogonal graph drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 367\u2013378. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25878-7_35"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","volume":"25","author":"SN Bhatt","year":"1987","unstructured":"Bhatt, S.N., Cosmadakis, S.S.: The complexity of minimizing wire lengths in VLSI layouts. Inf. Process. Lett. 25(4), 263\u2013267 (1987)","journal-title":"Inf. Process. Lett."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-319-73915-1_25","volume-title":"Graph Drawing and Network Visualization","author":"T Biedl","year":"2018","unstructured":"Biedl, T., Mondal, D.: On upward drawings of trees on a given grid. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 318\u2013325. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73915-1_25"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/14772019.2011.634444","volume":"11","author":"RB Benson","year":"2013","unstructured":"Benson, R.B., Ketchum, H., Naish, D., Turner, L.E.: A new leptocleidid (sauropterygia, plesiosauria) from the vectis formation (early barremian-early aptian; early cretaceous) of the isle of wight and the evolution of leptocleididae, a controversial clade. J. Syst. Palaeontol. 11, 233\u2013250 (2013)","journal-title":"J. Syst. Palaeontol."},{"issue":"W1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"W573","DOI":"10.1093\/nar\/gks485","volume":"40","author":"A Boc","year":"2012","unstructured":"Boc, A., Diallo, A.B., Makarenkov, V.: T-REX: a web server for inferring, validating and visualizing phylogenetic trees and networks. Nucleic Acids Res. 40(W1), W573\u2013W579 (2012)","journal-title":"Nucleic Acids Res."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.7155\/jgaa.00281","volume":"17","author":"U Brandes","year":"2013","unstructured":"Brandes, U., Pampel, B.: Orthogonal-ordering constraints are tough. J. Graph Algorithms Appl. 17(1), 1\u201310 (2013)","journal-title":"J. Graph Algorithms Appl."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-18469-7_10","volume-title":"Graph Drawing","author":"W Brunner","year":"2011","unstructured":"Brunner, W., Matzeder, M.: Drawing ordered ($$k-1$$)\u2013ary trees on k\u2013grids. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 105\u2013116. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-18469-7_10"},{"key":"4_CR10","unstructured":"Carrizo, S.F.: Phylogenetic trees: an information visualisation perspective. In: Proceedings of the 2nd Conference on Asia-Pacific Bioinformatics, pp. 315\u2013320 (2004)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Tree drawings revisited. Discret. Comput. Geom. 1\u201322 (2018)","DOI":"10.1007\/s00454-019-00106-w"},{"issue":"2","key":"4_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0925-7721(01)00066-9","volume":"23","author":"TM Chan","year":"2002","unstructured":"Chan, T.M., Goodrich, M.T., Kosaraju, S.R., Tamassia, R.: Optimizing area and aspect ratio in straight-line orthogonal tree drawings. Comput. Geom. 23(2), 153\u2013162 (2002)","journal-title":"Comput. Geom."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-46648-7_31","volume-title":"Graph Drawing","author":"G Battista Di","year":"1999","unstructured":"Di Battista, G., Didimo, W., Patrignani, M., Pizzonia, M.: Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Kratochv\u00edyl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 297\u2013310. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-46648-7_31"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-77537-9_11","volume-title":"Graph Drawing","author":"F Frati","year":"2008","unstructured":"Frati, F.: Straight-line orthogonal drawings of binary and ternary trees. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 76\u201387. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77537-9_11"},{"issue":"03","key":"4_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1142\/S0218195996000228","volume":"06","author":"A Garg","year":"1996","unstructured":"Garg, A., Goodrich, M.T., Tamassia, R.: Planar upward tree drawings with optimal area. Int. J. Comput. Geom. Appl. 06(03), 333\u2013356 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0020-0190(89)90118-X","volume":"31","author":"A Gregori","year":"1989","unstructured":"Gregori, A.: Unit-length embedding of binary trees on a square grid. Inf. Process. Lett. 31(4), 167\u2013173 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR17","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 21(1), 19\u201328 (1991)","journal-title":"Networks"},{"issue":"5550","key":"4_CR18","doi-asserted-by":"publisher","first-page":"2310","DOI":"10.1126\/science.1065889","volume":"294","author":"JP Huelsenbeck","year":"2001","unstructured":"Huelsenbeck, J.P., Ronquist, F., Nielsen, R., Bollback, J.P.: Bayesian inference of phylogeny and its impact on evolutionary biology. Science 294(5550), 2310\u20132314 (2001)","journal-title":"Science"},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1093\/sysbio\/sys062","volume":"61","author":"DH Huson","year":"2012","unstructured":"Huson, D.H., Scornavacca, C.: Dendroscope 3: an interactive tool for rooted phylogenetic trees and networks. Syst. Biol. 61(6), 1061\u20131067 (2012)","journal-title":"Syst. Biol."},{"key":"4_CR20","unstructured":"Kim, S.K.: Simple algorithms for orthogonal upward drawings of binary and ternary trees. In: Canadian Conference on Computational Geometry (CCCG), pp. 115\u2013120 (1995)"},{"issue":"6","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Miller, M.A., Pfeiffer, W., Schwartz, T.: Creating the CIPRES science gateway for inference of large phylogenetic trees. In: Gateway Computing Environments Workshop (GCE), pp. 1\u20138, November 2010","DOI":"10.1109\/GCE.2010.5676129"},{"issue":"4","key":"4_CR23","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1111\/j.1471-8286.2004.00813.x","volume":"4","author":"J M\u00fcller","year":"2004","unstructured":"M\u00fcller, J., M\u00fcller, K.: TREEGRAPH: automated drawing of complex tree figures using an extensible tree description format. Mol. Ecol. Notes 4(4), 786\u2013788 (2004)","journal-title":"Mol. Ecol. Notes"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Page, R.D.: Visualizing phylogenetic trees using treeview. Curr. Protoc. Bioinform. (1), 6.2.1\u20136.2.15 (2003)","DOI":"10.1002\/0471250953.bi0602s01"},{"key":"4_CR25","unstructured":"Piel, W.H., Chan, L., Dominus, M.J., Ruan, J., Vos, R.A., Tannen, V.: Treebase v. 2: a database of phylogenetic knowledge. e-BioSphere (2009)"},{"issue":"3","key":"4_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.comgeo.2014.10.001","volume":"48","author":"A Rusu","year":"2015","unstructured":"Rusu, A., Fabian, A.: A straight-line order-preserving binary tree drawing algorithm with linear area and arbitrary aspect ratio. Comput. Geom. 48(3), 268\u2013294 (2015)","journal-title":"Comput. Geom."},{"issue":"4","key":"4_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0925-7721(99)00053-X","volume":"15","author":"CS Shin","year":"2000","unstructured":"Shin, C.S., Kim, S.K., Chwa, K.Y.: Area-efficient algorithms for straight-line tree drawings. Comput. Geom. 15(4), 175\u2013202 (2000)","journal-title":"Comput. Geom."},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1093\/bioinformatics\/bti191","volume":"21","author":"A Stamatakis","year":"2004","unstructured":"Stamatakis, A., Meier, H., Ludwig, T.: RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees. Bioinformatics 21(4), 456\u2013463 (2004)","journal-title":"Bioinformatics"},{"issue":"12","key":"4_CR29","doi-asserted-by":"publisher","first-page":"1569","DOI":"10.1093\/bioinformatics\/btq228","volume":"26","author":"J Sukumaran","year":"2010","unstructured":"Sukumaran, J., Holder, M.T.: Dendropy: a python library for phylogenetic computing. Bioinformatics 26(12), 1569\u20131571 (2010)","journal-title":"Bioinformatics"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1006\/jagm.1994.1018","volume":"16","author":"T Warnow","year":"1994","unstructured":"Warnow, T.: Tree compatibility and inferring evolutionary history. J. Algorithms 16(3), 388\u2013407 (1994)","journal-title":"J. Algorithms"},{"key":"4_CR31","unstructured":"Zainon, W.N.W., Calder, P.: Visualising phylogenetic trees. In: Proceedings of 7th Australasian User Interface Conference, pp. 145\u2013152 (2006)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36412-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,5]],"date-time":"2019-12-05T19:09:10Z","timestamp":1575572950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36412-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030364113","9783030364120"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36412-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xiamen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoaconference.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}