Advertisement

A Similarity Measure between Tandem Duplication Trees

  • Jakub Koperwas
  • Krzysztof Walczak
Conference paper
Part of the Advances in Soft Computing book series (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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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–53Google Scholar
  2. 2.
    2. Elemento O. et al. (2002) Reconstructing The duplication History Of Tandemly Repeated Genes. Mol.Biol.Evol, 19, 278–288Google Scholar
  3. 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–231Google Scholar
  4. 4.
    4. Gascuel O. The Combinatorics of Tandem Duplication Trees Systematic Biology 52(1), 110–118Google Scholar
  5. 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–102Google Scholar
  6. 6.
    6. Ohno S. (1970) Evolution by Gene Duplication. Springer, New YorkGoogle Scholar
  7. 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–257zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    8. Tandem Repeats Database http://tandem.bu.eduGoogle Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • Jakub Koperwas
    • 1
  • Krzysztof Walczak
    • 1
  1. 1.Institute of Computer ScienceWarsaw University of TechnologyWarsawPoland

Personalised recommendations