Name
Abstract | ||
|---|---|---|
In dealing with the problem of modelling DNA recombination, the operation of splicing on linear and circular strings of symbols was introduced. Inspired by splicing on circular strings, the operation of flat splicing on a pair of strings (u, v) was considered. This operation involves “cutting” u at a specified position and “inserting” v into it, with v having a pre-specified prefix as well as suffix defined by a flat splicing rule. In this work, we consider a well-known technique in formal language theory, known as “matrix of rules”, and introduce matrix of flat splicing rules and thus define matrix flat splicing system (MFSS). Some results on the language generative power of MFSS are provided. An application of MFSS in the generation of chain code pictures is also pointed out. |
Year | Venue | Field |
|---|---|---|
2016 | BIC-TA | Generative power,Mathematical optimization,Formal language,Suffix,Matrix (mathematics),Computer science,Prefix,Theoretical computer science,RNA splicing,Chain code |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rodica Ceterchi | 1 | 119 | 17.38 |
| Linqiang Pan | 2 | 1513 | 93.32 |
| Bosheng Song | 3 | 93 | 11.66 |
| K. G. Subramanian | 4 | 339 | 59.27 |