400 search results - page 12 / 80 » On some Properties of DNA Graphs |
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
COMBINATORICS
2000
13 years 7 months ago
2000
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
LATIN
2004
Springer
14 years 1 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
WG
2001
Springer
14 years 9 days ago
2001
Springer
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
BMCBI
2006
13 years 8 months ago
2006
Background: Simulation of DNA-microarray data serves at least three purposes: (i) optimizing the design of an intended DNA microarray experiment, (ii) comparing existing pre-proce...