Scholarlink

<p>We propose a direct simulation of an arbitrary network of splicing processors by a network of splicing processors having an underlying path graph. This is in line with similar simulations where the target network has other widely used graph topologies: complete graph, lattice graph, star graph, wheel graph, etc. Along with the effective construction, we provide an analysis of the size and time complexity of the obtained network. Our construction may not be the most economic conversion in terms of number of nodes, hence further investigation to find more succinct networks are of (at least) theoretical interest.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Networks of splicing processors: path graph topology simulation

  • 期刊论文

  • 发表日期：

    2025年1月7日

查看全文
  • José Angel Sánchez Martín,
  • Victor Mitrana,
  • Mihaela Păun

摘要

We propose a direct simulation of an arbitrary network of splicing processors by a network of splicing processors having an underlying path graph. This is in line with similar simulations where the target network has other widely used graph topologies: complete graph, lattice graph, star graph, wheel graph, etc. Along with the effective construction, we provide an analysis of the size and time complexity of the obtained network. Our construction may not be the most economic conversion in terms of number of nodes, hence further investigation to find more succinct networks are of (at least) theoretical interest.