Skip to main content
SpringerLink
Log in

Counting Faces in Split Networks

  • Conference paper
Bioinformatics Research and Applications (ISBRA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 5542))

Included in the following conference series:

Abstract

SplitsTree is a popular program for inferring and visualizing various phylogenetic networks including split networks. Split networks are useful for realizing metrics that are linear combinations of split metrics. We show that the realization is not unique in some cases and design an algorithm for computing split networks with minimum number of faces. We also prove that the minimum number of faces in a split network is equal to the number of pairs of incompatible splits.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bandelt, H., Dress, A.: A canonical decomposition theory for metrics on a finite set. Advances in Mathematics 92, 47–105 (1992)

    Article  Google Scholar 

  2. Bao, L., Bereg, S.: Clustered splitsnetworks. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 469–478. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Bryant, D., Moulton, V.: Neighbornet: An agglomerative method for the construction of planar phylogenetic networks. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 375–391. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Buneman, P.: The recovery of trees from measures of dissimlarity. Math. and the Archeological and Historical Sciences, 387–395 (1971)

    Google Scholar 

  5. Cassens, I., Van Waerebeek, K., Best, P.B., Crespo, E.A., Reyes, J., Milinkovitch, M.C.: The phylogeography of dusky dolphins (lagenorhynchus obscurus): a critical examination of network methods and rooting procedures. Mol. Ecol. 12(7), 1781–1792 (2003)

    Article  CAS  PubMed  Google Scholar 

  6. Dress, A., Huson, D.: Constructing splits graphs. IEEE/ACM Transactions in Computational Biology and Bioinformatics 1, 109–115 (2004)

    Article  Google Scholar 

  7. Gusfield, D., Bansal, V.: A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 217–232. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Gusfield, D., Eddhu, S., Langley, C.: The fine structure of galls in phylogenetic networks. INFORMS Journal on Computing 16, 459–469 (2004)

    Article  Google Scholar 

  9. Huson, D.H., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution 23(2), 254–267 (2005)

    Article  PubMed  Google Scholar 

  10. Linder, C.R., Warnow, T.: Overview of phylogeny reconstruction. In: Aluru, S. (ed.) Handbook of Computational Biology. CRC Computer and Information Science Series. Chapman & Hall, Boca Raton (2005)

    Google Scholar 

  11. Lyngsø, R.B., Song, Y.S., Hein, J.: Minimum recombination histories by branch and bound. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol. 3692, pp. 239–250. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  12. Moret, B.M.E., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.E.: Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Trans. Comput. Biology Bioinformatics 155(1), 13–23 (2004)

    Article  Google Scholar 

  13. Saitou, N., Nei, M.: The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution 4, 406–425 (1987)

    CAS  PubMed  Google Scholar 

  14. Song, Y.S., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Advances in Mathematics 21, 413–422 (2005)

    Google Scholar 

  15. Zahid, M.A.H., Mittal, A., Joshi, R.C.: A pattern recognition-based approach for phylogenetic network construction with constrained recombination. Pattern Recognition 39(12), 387–395 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science Erik Jonsson School of Engineering & Computer Science, The University of Texas at Dallas, Richardson, TX 75080, USA

    Lichen Bao & Sergey Bereg

Authors
  1. Lichen Bao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Bereg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science & Engineering Department, University of Connecticut, 371 Fairfield Way, Unit 2155, CT 06269, Storrs, USA

    Ion Măndoiu

  2. Bioinformatics Research Group (BioRG), School of Computing and Information Sciences, Florida International University, 11200 SW 8th Street, Room ECS254, University Park, FL 33199, Miami, USA

    Giri Narasimhan

  3. Department of Computer Science, Georgia State University, P.O. Box 3994, GA 30302-3994, Atlanta, USA

    Yanqing Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bao, L., Bereg, S. (2009). Counting Faces in Split Networks. In: Măndoiu, I., Narasimhan, G., Zhang, Y. (eds) Bioinformatics Research and Applications. ISBRA 2009. Lecture Notes in Computer Science(), vol 5542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01551-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01551-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01550-2

  • Online ISBN: 978-3-642-01551-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation