Partial Words for DNA Coding (2004) [2 citations — 1 self]
|
Abstract:
Abstract. A very basic problem in all DNA computations is nding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesired behaviour like forming secondary structures. Various combinatorial properties like repetition-freeness and involutionfreeness have been proposed to exclude such misbehaviour. Another option, which has been considered, is requiring a big Hamming distance between the codewords. We propose to consider partial words for the solution of the coding problem. They, in some sense, already include the Hamming distance in the denition of compatibility and are investigated for many combinatorial properties. Thus, as the investigations on partial words are attracting more and more attention, they might be able to provide an ever-growing toolbox for nding good DNA encodings. 1
Citations
| 143 | Theory of Codes – Berstel, Perrin - 1985 |
| 112 | Salomaa (Eds), Handbook of Formal Language – Rozenberg, A - 1997 |
| 23 | Free Monoids and Languages – Shyr - 2001 |
| 10 | Periodicity on Partial Words – Blanchet-Sadri - 2004 |
| 9 | Coding Properties of DNA Languages – Hussini, Kari, et al. - 2002 |
| 8 | Algorithms for testing that sets of DNA words concatenate without secondary structure – Andronescu, Dees, et al. - 2003 |
| 7 | Partial Words and a Theorem of Fine and Wilf Revisited – Blanchet-Sadri, Hegstrom - 2002 |
| 6 | Partial Words and a Theorem of Fine and Wilf – Berstel, Boasson - 1999 |
| 6 | Languages of DNA based code words – JONOSKA, MAHALINGAM |
| 6 | Sticky-free and overhang-free DNA languages – Kari, Konstantinidis, et al. - 2003 |
| 2 | Jr.: On the Reliability and Eciency of a DNA-based Computation – Deaton, Garzon, et al. - 1998 |
| 2 | Gamzova: Periods' Interaction Property for Partial Words – Shur, V - 2003 |
