Skip to main content

A Similarity Measure between Tandem Duplication Trees

  • Conference paper
Intelligent Information Processing and Web Mining

Part of the book series: Advances in Soft Computing ((AINSC,volume 35))

Abstract

This paper opens the gate to understanding the nature of unequal crossing-over process, which is one of the mechanisms that leads to creation of new genes. The Data Mining and Tree Mining approaches are being modified to fit that particular biological problem. The novel notions: the similarity of duplication process and the similarity of a duplication region are proposed, and settled as the fundament of further analysis. The role and applications of the duplication process similarity measure are discussed. The roadmap for further extensive studies together with first interesting results are presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.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. 1. Benson G., Dong L. (1999) Reconstructing the Duplication History of a Tandem Repeat. Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology ISMB-99, 44–53

    Google Scholar 

  2. 2. Elemento O. et al. (2002) Reconstructing The duplication History Of Tandemly Repeated Genes. Mol.Biol.Evol, 19, 278–288

    Google Scholar 

  3. 3. Ester M. et al. (1996) A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise, Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, 226–231

    Google Scholar 

  4. 4. Gascuel O. The Combinatorics of Tandem Duplication Trees Systematic Biology 52(1), 110–118

    Google Scholar 

  5. 5. Klein P. (1998) Computing the Edit-Distance between Unrooted Ordered Trees, Proceedings of the 6th Annual European Symposium on Algorithms, August 24-26, 91–102

    Google Scholar 

  6. 6. Ohno S. (1970) Evolution by Gene Duplication. Springer, New York

    Google Scholar 

  7. 7. Rivals E. (2004) A Survey on Algorithmic Aspects of Tandem Repeats Evolution International Journal of Foundations of Computer Science, Vol. 15, no. 2, 225–257

    Article  MATH  MathSciNet  Google Scholar 

  8. 8. Tandem Repeats Database http://tandem.bu.edu

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Koperwas, J., Walczak, K. (2006). A Similarity Measure between Tandem Duplication Trees. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33521-8_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-33521-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33520-7

  • Online ISBN: 978-3-540-33521-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics