{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:08:20Z","timestamp":1742396900575},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642015502"},{"type":"electronic","value":"9783642015519"}],"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-01551-9_10","type":"book-chapter","created":{"date-parts":[[2009,4,28]],"date-time":"2009-04-28T06:29:20Z","timestamp":1240900160000},"page":"88-99","source":"Crossref","is-referenced-by-count":6,"title":["Untangling Tanglegrams: Comparing Trees by Their Drawings"],"prefix":"10.1007","author":[{"given":"Balaji","family":"Venkatachalam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Apple","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katherine","family":"St. John","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Gusfield","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, M.S., Chang, W.-C., Eulenstein, O., Fern\u00e1ndez-Baca, D.: Generalized binary tanglegrams: Algorithms and applications. In: BiCoB (2009)","DOI":"10.1007\/978-3-642-00727-9_13"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539794279626","volume":"27","author":"P. Bertolazzi","year":"1998","unstructured":"Bertolazzi, P., Battista, G.D., Mannino, C., Tamassia, R.: Optimal upward planarity testing of single-source digraphs. SIAM J. Comput.\u00a027(1), 132\u2013169 (1998)","journal-title":"SIAM J. Comput."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11618058_1","volume-title":"Graph Drawing","author":"T.C. Biedl","year":"2006","unstructured":"Biedl, T.C., Brandenburg, F.-J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"10_CR4","volume-title":"Graph Drawing","author":"K. Buchin","year":"2008","unstructured":"Buchin, K., Buchin, M., Byrka, J., N\u00f6llenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability. In: Graph Drawing. Springer, Heidelberg (2008)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Burt, A., Trivers, R.: Genes in Conflict. Belknap Harvard Press (2006)","DOI":"10.4159\/9780674029118"},{"key":"10_CR6","unstructured":"Charleston, M., Perkins, S.: Lizards, malaria, and jungles in the Caribbean. In: Page, R. (ed.) Tangled Trees: Phylogeny, Cospeciation, and Coevolution, pp. 65\u201392. University Of Chicago Press, Chicago (2003)"},{"issue":"2","key":"10_CR7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P. Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B (Methodological)\u00a039(2), 262\u2013268 (1977)","journal-title":"Journal of the Royal Statistical Society. Series B (Methodological)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"10_CR9","unstructured":"Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation. In: Australasian Symp. on Info. Vis., pp. 109\u2013115 (2004)"},{"volume-title":"Tangled Trees: Phylogeny, Cospeciation, and Coevolution","year":"2002","key":"10_CR10","unstructured":"Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University Of Chicago Press, Chicago (2002)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: SODA, pp. 28\u201336 (2003)","DOI":"10.1137\/S0895480102412856"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11590156_37","volume-title":"FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science","author":"H. Fernau","year":"2005","unstructured":"Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.\u00a03821, pp. 457\u2013469. Springer, Heidelberg (2005)"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L.R. Foulds","year":"1982","unstructured":"Foulds, L.R., Graham, R.L.: The Steiner problem in phylogeny is NP-complete. Adv. in Appl. Math.\u00a03(1), 43\u201349 (1982)","journal-title":"Adv. in Appl. Math."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M. Garey","year":"1983","unstructured":"Garey, M., Johnson, D.S.: Crossing number is np-complete. SIAM Journal on Algebraic and Discrete Methods\u00a04, 312\u2013316 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1017\/S0956796805005769","volume":"16","author":"R. Hinze","year":"2006","unstructured":"Hinze, R., Paterson, R.: Finger trees: A simple general-purpose data structure. Journal of Functional Programming\u00a016(2), 197\u2013217 (2006)","journal-title":"Journal of Functional Programming"},{"issue":"4","key":"10_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM\u00a021(4), 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Huelsenbeck, J.P., Ronquist, F.: Mrbayes: Bayesian inference of phylogeny (2001)","DOI":"10.1093\/bioinformatics\/17.8.754"},{"key":"10_CR18","first-page":"202","volume-title":"STOC 1996","author":"H. Kaplan","year":"1996","unstructured":"Kaplan, H., Tarjan, R.E.: Purely functional representations of catenable sorted lists. In: STOC 1996, pp. 202\u2013211. ACM, New York (1996)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kawarabayashi, K., Reed, B.: Computing crossing number in linear time. In: STOC, pp. 382\u2013390 (2007)","DOI":"10.1145\/1250790.1250848"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1014804110661","volume":"6","author":"J. Lee","year":"2002","unstructured":"Lee, J.: All-different polytopes. Journal of Combin. Optim.\u00a06(3), 335\u2013352 (2002)","journal-title":"Journal of Combin. Optim."},{"key":"10_CR21","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-74126-8_10","volume-title":"Algorithms in Bioinformatics","author":"A. Lozano","year":"2007","unstructured":"Lozano, A., Pinter, R.Y., Rokhlenko, O., Valiente, G., Ziv-Ukelson, M.: Seeded tree alignment and planar tanglegram layout. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol.\u00a04645, pp. 98\u2013110. Springer, Heidelberg (2007)"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1080\/10635150590946961","volume":"3","author":"D.M. Hillis","year":"2005","unstructured":"Hillis, D.M., Heath, T., John, K.S.: Analysis and visualization of tree space. Systematic Biology\u00a03, 471\u2013482 (2005)","journal-title":"Systematic Biology"},{"key":"10_CR23","first-page":"106","volume-title":"ALENEX","author":"M. N\u00f6llenburg","year":"2009","unstructured":"N\u00f6llenburg, M., Holten, D., V\u00f6lker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. In: ALENEX, pp. 106\u2013119. SIAM, Philadelphia (2009)"},{"issue":"1","key":"10_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TCBB.2006.4","volume":"3","author":"S. Roch","year":"2006","unstructured":"Roch, S.: A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE\/ACM Trans. Comp. Biol. and Bioinf.\u00a03(1), 92\u201394 (2006)","journal-title":"IEEE\/ACM Trans. Comp. Biol. and Bioinf."},{"issue":"1-2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(98)00120-0","volume":"223","author":"W.K. Shih","year":"1999","unstructured":"Shih, W.K., Hsu, W.-L.: A new planarity test. Theor. Comput. Sci.\u00a0223(1-2), 179\u2013191 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR26","volume-title":"PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4","author":"D.L. Swofford","year":"2002","unstructured":"Swofford, D.L.: PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4. Sinauer Associates, Sunderland, Massachusetts (2002)"},{"key":"10_CR27","unstructured":"Swofford, D.L., Olsen, G.J., Waddell, P.J., Hillis, D.M.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407\u2013514. Sinauer (1996)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Venkatachalam, B., Apple, J., John, K.S., Gusfield, D.: Untangling tanglegrams: Comparing trees by their drawings. Technical Report CSE-2009-1, UC Davis, Computer Science Department (2009)","DOI":"10.1007\/978-3-642-01551-9_10"},{"key":"10_CR29","unstructured":"Wan Zainon, W.N., Calder, P.: Visualising phylogenetic trees. In: Piekarski, W. (ed.) Seventh Australasian User Interface Conference (AUIC 2006), Hobart, Australia. CRPIT, vol.\u00a050, pp. 145\u2013152. ACS (2006)"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01551-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:44:33Z","timestamp":1558277073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01551-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642015502","9783642015519"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01551-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}