Abstract
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and species trees or when studying the co-speciation of hosts and parasites. The tanglegram layout problem seeks to produce a layout of the two trees that minimizes the number of crossings between the inter-tree edges. This problem is well-studied for the case when the mappings between the leaves of the two trees is one-to-one. However, in typical biological applications, this mapping is seldom one-to-one. In this work we (i) define a generalization of the tanglegram layout problem, called the Generalized Tanglegram Layout (GTL) problem, which allows for arbitrary interconnections between the leaves of the two trees, (ii) provide efficient algorithms for the case when the layout of one tree is fixed, (iii) discuss the fixed parameter tractability and approximability of the GTL problem, (iv) formulate heuristic solutions for the GTL problem, and (v) evaluate our algorithms experimentally.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arvestad, L., Berglund, A.-C., Lagergren, J., Sennblad, B.: Gene tree reconstruction and orthology analysis based on an integrated model for duplications and sequence evolution. In: RECOMB, pp. 326–335 (2004)
Buchin, K., Buchin, M., Byrka, J., Nöllenburg, M., Okamoto, Y., Silveira, R.I., Wolff, A.: Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability. In: Graph Drawing (2008)
Dietz, P.F.: Optimal algorithms for list indexing and subset rank. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol. 382, pp. 39–46. Springer, Heidelberg (1989)
Dwyer, T., Schreiber, F.: Optimal leaf ordering for two and a half dimensional phylogenetic tree visualisation. In: InVis. au, pp. 109–115 (2004)
Fernau, H., Kaufmann, M., Poths, M.: Comparing trees via crossing minimization. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 457–469. Springer, Heidelberg (2005)
Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage. a parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology 28, 132–163 (1979)
Holten, D., van Wijk, J.J.: Visual comparison of hierarchically organized data. In: 10th Eurographics/IEEE-VGTC Symposium on Visualization (EuroVis 2008) (2008)
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. 4645, pp. 98–110. Springer, Heidelberg (2007)
Maddison, W.P.: Gene trees in species trees. Systematic Biology 46(3), 523–536 (1997)
Nöllenburg, M., Holten, D., Völker, M., Wolff, A.: Drawing binary tanglegrams: An experimental evaluation. In: CoRR, abs/0806.0928 (2008); an updated version of this manuscript will appear in: The proceedings of ALENEX 2009
Page, R.D.M. (ed.): Tangled Trees: Phylogeny, Cospeciation, and Coevolution. University of Chicago Press (2002)
Sanderson, M., McMahon, M.: Inferring angiosperm phylogeny from EST data with widespread gene duplication. BMC Evolutionary Biology 7(suppl. 1), S3 (2007)
Syvanen, M.: Cross-species gene transfer; implications for a new theory of evolution. J. Theor Biol. 112 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bansal, M.S., Chang, WC., Eulenstein, O., Fernández-Baca, D. (2009). Generalized Binary Tanglegrams: Algorithms and Applications. In: Rajasekaran, S. (eds) Bioinformatics and Computational Biology. BICoB 2009. Lecture Notes in Computer Science(), vol 5462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00727-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-00727-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00726-2
Online ISBN: 978-3-642-00727-9
eBook Packages: Computer ScienceComputer Science (R0)