On a generalized model of labeled graphs

  • Authors:

  • Adam Kozak;Tomasz GłOwacki;Piotr Formanowicz

  • Affiliations:

  • Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland;Institute of Computing Science, Poznan University of Technology, Poznan, Poland and Institute of Bioorganic Chemistry, Polish Academy of Sciences, Poznan, Poland

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2013

Quantified Score

Hi-index 0.04

Visualization

Abstract

Labeled graphs have applications in algorithms for reconstructing chains that have been split into smaller parts. Chain reconstruction is a common problem in biochemistry and bioinformatics, particularly for sequencing DNA or peptide chains. Labeled graphs (in the sense defined in this paper) have also the important structural property which allows to reduce the Hamiltonian path problem to Eulerian path problem. This work introduces a model and properties of a class of base-labeled graphs that unify the properties of labeled and free-labeled graphs (Blazewicz et al., 1999) [1]. It describes the basic relationships between those classes and some of their applications. It also introduces lexical graphs which are the superclass of de Bruijn graphs. Lexical graphs keep many properties of de Bruijn graphs which have a wide area of applications e.g. in mathematics, electronics and computing sciences.