The Fibers and Range of Reduction Graphs in Ciliates
| dc.creator | Brijder, Robert | |
| dc.creator | Hoogeboom, Hendrik Jan | |
| dc.date | 2007-02-07 | |
| dc.date.accessioned | 2026-07-07T10:20:13Z | |
| dc.date.available | 2026-07-07T10:20:13Z | |
| dc.description | The biological process of gene assembly has been modeled based on three types of string rewriting rules, called string pointer rules, defined on so-called legal strings. It has been shown that reduction graphs, graphs that are based on the notion of breakpoint graph in the theory of sorting by reversal, for legal strings provide valuable insights into the gene assembly process. We characterize which legal strings obtain the same reduction graph (up to isomorphism), and moreover we characterize which graphs are (isomorphic to) reduction graphs. | |
| dc.description | 24 pages, 13 figures | |
| dc.identifier | https://arxiv.org/abs/cs/0702041 | |
| dc.identifier | http://arxiv.org/abs/cs/0702041 | |
| dc.identifier | Acta Informatica, Volume 45, Number 5 / July, 2008, Pages 383-402 | |
| dc.identifier | doi:10.1007/s00236-008-0074-3 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174775 | |
| dc.subject | Logic in Computer Science | |
| dc.title | The Fibers and Range of Reduction Graphs in Ciliates | |
| dc.type | text |