On the Ambiguity and Complexity Measures of Insertion-Deletion Systems

Krithivasan, Kamala; Kuppusamy, Lakshmanan; Mahendran, Anand; Khalid, Maham

doi:10.1007/978-3-642-32615-8_41

Cited by 2 publications

(6 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In one sequence, the context (b, c i ) is used completely and in another sequence the context (d j , a) is used completely, thus the two sequences are different by the used contexts, but the same word is obtained. Hence, the system γ ′ In next theorem, we solve the open problem mentioned in [7]. We show that there are some ins-del languages which are inherently 1-ambiguous but there are ins-del systems which are 0-unambiguous for those languages.…”

Section: Proof Consider the Languagesupporting

confidence: 40%

“…In [7], six levels of ambiguity of insertion-deletion systems have been defined and it is shown that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) ∈ {(5, 4), (4,2), (3,1), (3,2), (2, 1), (0, 1)}. Also, three new measures TLength-Con, TLength-Ins, TLength-Del are introduced and we discussed the trade-off between ambiguity and measures of insertion-deletion languages.…”

Section: Introductionsupporting

confidence: 42%

“…This is proved for the measures Prod, Ax and for the ambiguity levels 5 and 4. In this paper, we inherit all the results of [7] (with some revision) and we extend the paper with the following contributions: Theorems 4.2-4.4 are proved by considering new languages which are simpler than the languages considered in [7]. A new result on ambiguity is proved for the combination (1, 0) and is reflected in Theorem 4.5.…”

Section: Introductionsupporting

confidence: 41%

“…In this paper, we extend the work carried out in [7]. In [7], six levels of ambiguity of insertion-deletion systems have been defined and it is shown that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) ∈ {(5, 4), (4,2), (3,1), (3,2), (2, 1), (0, 1)}.…”

Section: Introductionsupporting

confidence: 39%

“…A new result on ambiguity is proved for the combination (1, 0) and is reflected in Theorem 4.5. This was left as an open problem in [7] and is solved here. We show the application of these defined ambiguity levels and how they can be interpreted in gene sequences with some suitable examples (see Section 4.1).…”

Section: Introductionmentioning

confidence: 43%

See 4 more Smart Citations

On the study of ambiguity and the trade-off between measures and ambiguity in insertion–deletion languages

Kuppusamy

Mahendran

Krithivasan

et al. 2011

Nano Communication Networks

Self Cite

View full text Add to dashboard Cite

Section: Proof Consider the Languagesupporting

confidence: 40%

Section: Introductionsupporting

confidence: 42%

Section: Introductionsupporting

confidence: 41%

Section: Introductionsupporting

confidence: 39%

Section: Introductionmentioning

confidence: 43%

See 3 more Smart Citations

On the study of ambiguity and the trade-off between measures and ambiguity in insertion–deletion languages

Kuppusamy

Mahendran

Krithivasan

et al. 2011

Nano Communication Networks

Self Cite

View full text Add to dashboard Cite

Real Time RNA Sequence Edition with Matrix Insertion Deletion for Improved Bio Molecular Computing using Template Match Measure

Kotteeswaran¹,

Khanaa²,

Rajesh³

2019

IJACSA

View full text Add to dashboard Cite

The RNA sequence editing has become a challenging task in the molecular computing. There are number of approaches that have been discussed earlier for the problem RNA editing in bio molecular computing, but they suffer to achieve higher performance. To improve the performance, an real time approach has been presented which uses sequence depth measure (SDM). The method receives the RNA sequence and estimates the depth measure for different sub sequences generated. Based on the SDM value, a cumulative sequence match measure (SMM) has been measured to classify the sequence towards the different classes available. The matrix insertion and deletion is performed based on the template match measure (TMM) which has been computed based on the matches found in the templates available for different classes. The experimental results of our approach prove to outperform in terms of Accuracy, Risk Detection Accuracy, Time Complexity and False Classification Ratio which in turn increases the performance of bio molecular computing and matrix insertion deletion.

show abstract

On the Ambiguity and Complexity Measures of Insertion-Deletion Systems

Cited by 2 publications

References 6 publications

On the study of ambiguity and the trade-off between measures and ambiguity in insertion–deletion languages

On the study of ambiguity and the trade-off between measures and ambiguity in insertion–deletion languages

Real Time RNA Sequence Edition with Matrix Insertion Deletion for Improved Bio Molecular Computing using Template Match Measure

Contact Info

Product

Resources

About