A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Formal properties of gene assembly: Equivalence problem for overlap graphs
Tekijät: Harju T, Petre I, Rozenberg G
Kustantaja: SPRINGER-VERLAG BERLIN
Julkaisuvuosi: 2004
Lehti:: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: ASPECTS OF MOLECULAR COMPUTING
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 2950
Aloitussivu: 202
Lopetussivu: 212
Sivujen määrä: 11
ISSN: 0302-9743
Tiivistelmä
Gene assembly in ciliates is a life process fascinating from both the biological and the computational points of view. Several formal models of this process have been formulated and investigated, among them a model based on (legal) strings and a model based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the overlap equivalence problem for realistic strings: when do two different realistic legal strings translate into the same overlap graph? Realistic legal strings axe legal strings that "really" correspond to genes generated during the gene assembly process.
Gene assembly in ciliates is a life process fascinating from both the biological and the computational points of view. Several formal models of this process have been formulated and investigated, among them a model based on (legal) strings and a model based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the overlap equivalence problem for realistic strings: when do two different realistic legal strings translate into the same overlap graph? Realistic legal strings axe legal strings that "really" correspond to genes generated during the gene assembly process.
Turun yliopiston Tutkimustietojärjestelmän portaali