No abstract

No abstract

In this paper, an algorithmic approach is developed to solve the combinatorial part of DNA sequencing by hybridization using graph theoretical concepts. It is assumed here, that the spectrum is ideal one and fragments are of equal length. The goal is to reconstruct the DNA molecule based on the fragments overlap. Suitable examples are also provided to justify the algorithm.

No abstract

In this article, using K. W. Roeder's Theorem, some properties of CHC (compact hyperbolic coxeter) tetrahedrons have been developed which are facilitated by the link of graph theory and combinatorics, and it has been found that there are exactly 3 CHC tetrahedrons upto symmetry.