Mathematical Preliminaries

  • Andrzej Ehrenfeucht
  • Tero Harju
  • Ion Petre
  • David M. Prescott
  • Grzegorz Rozenberg
Part of the Natural Computing Series book series (NCS)


In the chapters to follow we shall consider gene assembly from a more formal point of view through operations on strings and graphs. In this chapter we introduce the basic notions and notations concerning strings and graphs needed in those chapters.


Simple Graph Gene Assembly Edge Labelling Vertex Labelling Empty String 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Notes on References

  1. 42.
    Pevzner, P. A., DNA physical mapping and alternating Eulerian cycles in colored graphs. Algorithmica 13 (1995) 77–105MathSciNetMATHCrossRefGoogle Scholar
  2. 58.
    West, D. B., Introduction to Graph Theory, Prentice Hall, Upper Saddle River, NJ (1996)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Andrzej Ehrenfeucht
    • 1
  • Tero Harju
    • 2
  • Ion Petre
    • 3
  • David M. Prescott
    • 4
  • Grzegorz Rozenberg
    • 5
  1. 1.Department of Computer ScienceUniversity of ColoradoBoulderUSA
  2. 2.Department of MathematicsUniversity of TurkuTurkuFinland
  3. 3.Department of Computer ScienceÅbo Akademi UniversityTurkuFinland
  4. 4.Department of Molecular, Cellular and Developmental BiologyUniversity of ColoradoBoulderUSA
  5. 5.Leiden Institute for Advanced Computer ScienceLeiden UniversityLeidenThe Netherlands

Personalised recommendations