Folding technique on n-cut spliced semigraph in splicing system

In biology, DNA splicing system models the recombination behaviours of DNA molecules which require the presence of restriction enzymes. Since it is quite incompetent to describe DNA splicing system in one-dimensional string, hence graph theory is used in describing the complexity of DNA splicing sys...

詳細記述

保存先:
書誌詳細
主要な著者: Abdul Razak, Muhammad Nur Syiham, Wan, Heng Fong, Sarmin, Nor Haniza
フォーマット: Conference or Workshop Item
出版事項: 2020
主題:
オンライン・アクセス:http://eprints.utm.my/id/eprint/94050/
http://dx.doi.org/10.1063/5.0026045
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
その他の書誌記述
要約:In biology, DNA splicing system models the recombination behaviours of DNA molecules which require the presence of restriction enzymes. Since it is quite incompetent to describe DNA splicing system in one-dimensional string, hence graph theory is used in describing the complexity of DNA splicing system. Thus by graph splicing system, a type of semigraph can be obtained, called as n-cut spliced semigraph. Various concepts of graph theory have been applied on semigraph to study its characteristics and properties. In this study, the focus is on the application of the folding technique on n-cut spliced semigraph.It is observed that the maximum number of folding for every n-cut spliced semigraph is n+1 times. Also, the final form of new semigraphs obtained are determined.