S. Bharathi, J. Padmashree, S. Selvi, K. Thiagarajan
{"title":"DNA剪接系统的半图结构","authors":"S. Bharathi, J. Padmashree, S. Selvi, K. Thiagarajan","doi":"10.1109/BIC-TA.2011.26","DOIUrl":null,"url":null,"abstract":"Our main result is to correlate the graph splicing scheme of Rudolf Freund with semi graphs introduced by E. Sampathkumar [10]. We get characterization of DNA structure after splicing in terms of semi graph to show some splicing graph properties. In this paper, we introduce semi graph folding for the DNA splicing system and show that any n-cut spliced semi graph (n ? 1) can be folded onto an edge and two semi edges at the maximum of four semi graph folding.","PeriodicalId":211822,"journal":{"name":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Semigraph Structure on DNA Splicing System\",\"authors\":\"S. Bharathi, J. Padmashree, S. Selvi, K. Thiagarajan\",\"doi\":\"10.1109/BIC-TA.2011.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Our main result is to correlate the graph splicing scheme of Rudolf Freund with semi graphs introduced by E. Sampathkumar [10]. We get characterization of DNA structure after splicing in terms of semi graph to show some splicing graph properties. In this paper, we introduce semi graph folding for the DNA splicing system and show that any n-cut spliced semi graph (n ? 1) can be folded onto an edge and two semi edges at the maximum of four semi graph folding.\",\"PeriodicalId\":211822,\"journal\":{\"name\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-09-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BIC-TA.2011.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIC-TA.2011.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Our main result is to correlate the graph splicing scheme of Rudolf Freund with semi graphs introduced by E. Sampathkumar [10]. We get characterization of DNA structure after splicing in terms of semi graph to show some splicing graph properties. In this paper, we introduce semi graph folding for the DNA splicing system and show that any n-cut spliced semi graph (n ? 1) can be folded onto an edge and two semi edges at the maximum of four semi graph folding.