{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T11:55:58Z","timestamp":1774266958262,"version":"3.50.1"},"reference-count":26,"publisher":"Oxford University Press (OUP)","issue":"13","license":[{"start":{"date-parts":[[2016,10,2]],"date-time":"2016-10-02T00:00:00Z","timestamp":1475366400000},"content-version":"vor","delay-in-days":1937,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.5"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: In systematic biology, one is often faced with the task of comparing different phylogenetic trees, in particular in multi-gene analysis or cospeciation studies. One approach is to use a tanglegram in which two rooted phylogenetic trees are drawn opposite each other, using auxiliary lines to connect matching taxa. There is an increasing interest in using rooted phylogenetic networks to represent evolutionary history, so as to explicitly represent reticulate events, such as horizontal gene transfer, hybridization or reassortment. Thus, the question arises how to define and compute a tanglegram for such networks.<\/jats:p>\n               <jats:p>Results: In this article, we present the first formal definition of a tanglegram for rooted phylogenetic networks and present a heuristic approach for computing one, called the NN-tanglegram method. We compare the performance of our method with existing tree tanglegram algorithms and also show a typical application to real biological datasets. For maximum usability, the algorithm does not require that the trees or networks are bifurcating or bicombining, or that they are on identical taxon sets.<\/jats:p>\n               <jats:p>Availability: The algorithm is implemented in our program Dendroscope 3, which is freely available from www.dendroscope.org.<\/jats:p>\n               <jats:p>Contact: \u00a0scornava@informatik.uni-tuebingen.de; huson@informatik.uni-tuebingen.de<\/jats:p>","DOI":"10.1093\/bioinformatics\/btr210","type":"journal-article","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T23:32:32Z","timestamp":1308353552000},"page":"i248-i256","source":"Crossref","is-referenced-by-count":98,"title":["Tanglegrams for rooted phylogenetic trees and networks"],"prefix":"10.1093","volume":"27","author":[{"given":"Celine","family":"Scornavacca","sequence":"first","affiliation":[{"name":"Center for Bioinformatics (ZBIT), T\u00fcbingen University, Sand 14, 72076 T\u00fcbingen, Germany"}]},{"given":"Franziska","family":"Zickmann","sequence":"additional","affiliation":[{"name":"Center for Bioinformatics (ZBIT), T\u00fcbingen University, Sand 14, 72076 T\u00fcbingen, Germany"}]},{"given":"Daniel H.","family":"Huson","sequence":"additional","affiliation":[{"name":"Center for Bioinformatics (ZBIT), T\u00fcbingen University, Sand 14, 72076 T\u00fcbingen, Germany"}]}],"member":"286","published-online":{"date-parts":[[2011,6,14]]},"reference":[{"key":"2023012512141694300_B1","first-page":"114","article-title":"Generalized binary tanglegrams: Algorithms and applications","volume-title":"BICoB '09: Proceedings of the 1st International Conference on Bioinformatics and Computational Biology.","author":"Bansal","year":"2009"},{"key":"2023012512141694300_B2","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/978-3-642-11269-0_3","article-title":"A faster fixed-parameter approach to drawing binary tanglegrams","volume-title":"4th International Workshop of Parameterized and Exact Computation","author":"B\u00f6cker","year":"2009"},{"key":"2023012512141694300_B3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1093\/molbev\/msh018","article-title":"Neighbor-net: an agglomerative method for the construction of phylogenetic networks","volume":"21","author":"Bryant","year":"2004","journal-title":"Mol. Biol. Evol."},{"key":"2023012512141694300_B4","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1186\/1748-7188-2-8","article-title":"Consistency of the Neighbor-Net algorithm","volume":"2","author":"Bryant","year":"2007","journal-title":"Algorithms Mol. Biol."},{"key":"2023012512141694300_B5","first-page":"324","article-title":"Drawing (complete) binary tanglegrams: Hardness, approximation, fixed-parameter tractability","volume-title":"Proceedings of the 16th International Symposium on Graph Drawing","author":"Buchin","year":"2009"},{"key":"2023012512141694300_B6","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","volume-title":"Mathematics in the Archaeological and Historical Sciences.","author":"Buneman","year":"1971"},{"key":"2023012512141694300_B7","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctvjhzrc6","volume-title":"Genes in Conflict: The Biology of Selfish Genetic Elements.","author":"Burt","year":"2008","edition":"1st"},{"key":"2023012512141694300_B8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/S0025-5564(97)10012-8","article-title":"Jungles: a new solution to the host\/parasite phylogeny reconciliation problem","volume":"149","author":"Charleston","year":"1998","journal-title":"Math. Biosci."},{"key":"2023012512141694300_B9","first-page":"65","article-title":"Lizards, malaria, and jungles in the caribbean","volume-title":"Tangled Trees: Phylogeny, Cospeciation, and Coevolution.","author":"Charleston","year":"2003"},{"key":"2023012512141694300_B10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TCBB.2004.27","article-title":"Constructing splits graphs","volume":"1","author":"Dress","year":"2004","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"2023012512141694300_B11","first-page":"109","article-title":"Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation","volume-title":"Australasian Symposium on Information Visualisation","author":"Dwyer","year":"2004"},{"key":"2023012512141694300_B12","first-page":"457","article-title":"Comparing trees via crossing minimization","volume-title":"The 25th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"Fernau","year":"2005"},{"key":"2023012512141694300_B13","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/j.jcss.2009.10.014","article-title":"Comparing trees via crossing minimization","volume":"76","author":"Fernau","year":"2010","journal-title":"J. Comput. Syst."},{"key":"2023012512141694300_B14","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/TCBB.2008.58","article-title":"Drawing rooted phylogenetic networks","volume":"6","author":"Huson","year":"2009","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"2023012512141694300_B15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1093\/gbe\/evq077","article-title":"A survey of combinatorial methods for phylogenetic networks","volume":"3","author":"Huson","year":"2011","journal-title":"Genome Biol. Evol."},{"key":"2023012512141694300_B16","author":"Huson","year":"2011","journal-title":"Dendroscope 3 - a program for computing and drawing rooted phylogenetic trees and networks."},{"key":"2023012512141694300_B17","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1186\/1471-2105-8-460","article-title":"Dendroscope: an interactive viewer for large phylogenetic trees","volume":"8","author":"Huson","year":"2007","journal-title":"BMC Bioinformatics"},{"key":"2023012512141694300_B18","volume-title":"Phylogenetic Networks: Concepts, Algorithms and Applications.","author":"Huson","year":"2011"},{"key":"2023012512141694300_B19","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.3732\/ajb.0700008","article-title":"Incongruence between cpDNA and nrITS trees indicates extensive hybridization within eupersicaria (polygonaceae)","volume":"95","author":"Kim","year":"2008","journal-title":"Am. J. Bot."},{"key":"2023012512141694300_B20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11230-010-9256-9","article-title":"A multilocus approach to assessing co-evolutionary relationships between Steinernemaspp. (nematoda: Steinernematidae) and their bacterial symbionts Xenorhabdusspp. (\u03b3-proteobacteria: Enterobacteriaceae)","volume":"77","author":"Lee","year":"2010","journal-title":"Syst. Parasitol."},{"key":"2023012512141694300_B21","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TCBB.2008.59","article-title":"Seeded tree alignment","volume":"5","author":"Lozano","year":"2008","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"Suppl. 1","key":"2023012512141694300_B22","doi-asserted-by":"crossref","first-page":"6558","DOI":"10.1073\/pnas.0501840102","article-title":"Critical review of host specificity and its coevolutionary implications in the fig\/fig-wasp mutualism","volume":"102","author":"Machado","year":"2005","journal-title":"Proc. Natl Acad. Sci. USA"},{"key":"2023012512141694300_B23","doi-asserted-by":"crossref","first-page":"3625","DOI":"10.1128\/IAI.00006-10","article-title":"Distribution and phylogeny of immunoglobulin-binding protein G in Shiga toxin-producing Escherichia coli and its association with adherence phenotypes","volume":"78","author":"Merkel","year":"2010","journal-title":"Infect. Immun."},{"key":"2023012512141694300_B24","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1137\/1.9781611972894.11","article-title":"Drawing binary tanglegrams: an experimental evaluation","volume-title":"Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"N\u00f6llenburg","year":"2009"},{"key":"2023012512141694300_B25","author":"Scornavacca","year":"2011","journal-title":"Drawing phylogenetic networks with constraints on the order of taxa."},{"key":"2023012512141694300_B26","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1109\/TCBB.2010.57","article-title":"Untangling tanglegrams: comparing trees by their drawings","volume":"7","author":"Venkatachalam","year":"2010","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/27\/13\/i248\/48883997\/bioinformatics_27_13_i248.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/27\/13\/i248\/48883997\/bioinformatics_27_13_i248.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T14:28:16Z","timestamp":1674656896000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/27\/13\/i248\/178293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,14]]},"references-count":26,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2011,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btr210","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2011,7,1]]},"published":{"date-parts":[[2011,6,14]]}}}