On some properties of DNA graphs

被引：43

作者：

Blazewicz, J

Hertz, A ^{[1
]}

Kobler, D

de Werra, D

机构：

[1] Ecole Polytech Fed Lausanne, Dept Math, MA Ecublens, CH-1015 Lausanne, Switzerland

[2] Politechn Poznanka, Inst Informat, Poznan, Poland

来源：

DISCRETE APPLIED MATHEMATICS | 1999年 / 98卷 / 1-2期

关键词：

DNA graphs; protein structure and functions; recognition algorithms;

D O I：

10.1016/S0166-218X(99)00109-2

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Molecular biology which aims to study DNA and protein structure and functions, has stimulated research in different scientific disciplines, discrete mathematics being one of them. One of the problems considered is that of recognition of DNA primary structure. It is known that some methods for solving this problem may be reduced (in their computational part) to graph-theoretic problems involving labeled graphs. Each vertex in such graphs has a label of length k written with an alphabet of size alpha, where k and alpha are two parameters. This paper is concerned with studying propel ties of these graphs (referred to as DNA graphs). More precisely, we give recognition algorithms and compare graphs labeled with different values of k and alpha. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：1 / 19

页数：19

共 12 条

[1] MONGE AND FEASIBILITY SEQUENCES IN GENERAL FLOW PROBLEMS [J].