Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String...
-
Upload
garry-lyons -
Category
Documents
-
view
218 -
download
0
description
Transcript of Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String...
![Page 1: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/1.jpg)
Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman
CSE, BUET Dhaka 1000
Degenerate String Reconstruction from Cover Arrays (Extended
Abstract)
1
![Page 2: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/2.jpg)
Motivation
Extensive use of degenerate string in molecular biology.
o used to model biological sequences. (e.g., FASTA format for representing either nucleotide sequences or peptide sequences)
o very efficient in expressing polymorphism in biological sequences. (e.g., Single Nucleotide Polymorphism (SNP))
2
![Page 3: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/3.jpg)
Goal of the Paper
Present efficient algorithms to reconstruct a degenerate string from a valid cover array.
We have derived two algorithms one using unbounded alphabet and other using minimum sized alphabet for that purpose.
3
![Page 4: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/4.jpg)
Degenerate String
Let = { A, C, G, T }
4
![Page 5: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/5.jpg)
Degenerate String
Let = { A, C, G, T }
Then we can get 2^4 -1 = 15 non-empty sets of letters.
5
![Page 6: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/6.jpg)
Degenerate String
Let = { A, C, G, T }
Then we can get 2^4 -1 = 15 non-empty sets of letters.
At each position of an degenerate string we have one of those sets.
6
![Page 7: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/7.jpg)
Degenerate String
7
![Page 8: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/8.jpg)
Degenerate String Example
8
![Page 9: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/9.jpg)
Degenerate String: Equality/Match
9
![Page 10: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/10.jpg)
Degenerate String: Equality/Match
10
![Page 11: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/11.jpg)
Cover Array of Regular String
We say that a string S covers a string U if every letter of U is contained in some occurrence of S as a substring of U. Then S is called a cover of U.
11
![Page 12: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/12.jpg)
Cover Array of Regular String
We say that a string S covers a string U if every letter of U is contained in some occurrence of S as a substring of U. Then S is called a cover of U.
The cover array C of a regular string X[1..n], is a data structure used to store the length of the longest proper cover of every prefix of X.
12
![Page 13: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/13.jpg)
Cover Array of Regular String
13
so for all stores the length of the longest cover of X[1..i] or 0.
![Page 14: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/14.jpg)
Cover Array of Regular String
14
so for all stores the length of the longest cover of X[1..i] or 0.
since every cover of any cover of X is also a cover of X, it turns out that, the cover array C compactly describes all the covers of every prefix of X.
![Page 15: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/15.jpg)
Exp. of Cover Array of Regular string
Table 2 : Cover array of abaababaabaababaaba
15
![Page 16: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/16.jpg)
Exp. of Cover Array of Regular string
From Table 2 we can see that, cover array of X, has the entries
representing the three covers of X having length 11, 6 and 3 respectively.
16
![Page 17: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/17.jpg)
Cover Array for Degenerate String
For a degenerate string, stores the list of the lengths of the covers of .
17
![Page 18: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/18.jpg)
Cover Array for Degenerate String
For a degenerate string, stores the list of the lengths of the covers of .
More elaborately, each is a list such that where denotes the p-th largest cover of X[1..i].
18
![Page 19: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/19.jpg)
Example of Cover Array for Degenerate String
Table 3. Cover Array of aba[ab][ab]a
19
![Page 20: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/20.jpg)
Basic Validation of a Cover Array
for we define as of a Cover of .
20
![Page 21: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/21.jpg)
Basic Validation of a Cover Array
for we define as of a Cover of .
candidate-lengths of covers of is
21
![Page 22: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/22.jpg)
Basic Validation of a Cover Array
22
![Page 23: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/23.jpg)
Basic Validation of a Cover Array
Further we assume that a symbol
is required by .
k
23
![Page 24: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/24.jpg)
Basic Validation of a Cover Array
Further we assume that a symbol
is required by .
Notably .
k
24
![Page 25: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/25.jpg)
Basic Validation of a Cover Array
Lemma 1. Suppose is the cover array of a string . If , then
25
![Page 26: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/26.jpg)
Basic Validation of a Cover Array
Lemma 1. Suppose is the cover array of a string . If , then
Proof. proof will be provided in the journal version.
26
![Page 27: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/27.jpg)
Basic Validation of a Cover Array
Theorem 2.
Proof. proof will be provided in the journal version. 27
![Page 28: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/28.jpg)
Our Algorithms
28
![Page 29: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/29.jpg)
Our Algorithms
29
![Page 30: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/30.jpg)
CrAyDSRUn
we denote by the new set of characters introduced in , i.e., .
30
![Page 31: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/31.jpg)
CrAyDSRUn
we denote by the new set of characters introduced in , i.e., .
we denote by the set of symbols that are not allowed only at Position , i.e.,
31
![Page 32: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/32.jpg)
CrAyDSRUn
we denote by the new set of characters introduced in , i.e., .
we denote by the set of symbols that are not allowed only at Position , i.e.,
denotes the set of symbols that can be assigned to .
32
![Page 33: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/33.jpg)
CrAyDSRUn
Lemma 3.
Proof. proof will be provided in the journal version.
33
![Page 34: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/34.jpg)
CrAyDSRUn: Basic Steps
Suppose, we have a cover array where is the product of maximum string length and maximum list length of cover array .
34
![Page 35: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/35.jpg)
CrAyDSRUn: Basic Steps
Suppose, we have a cover array where is the product of maximum string length and maximum list length of cover array .
so,
35
![Page 36: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/36.jpg)
CrAyDSRUn: Basic Steps
step 1, validity checking.
36
![Page 37: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/37.jpg)
CrAyDSRUn: Basic Steps
step 1, validity checking.
step 2, find .
37
![Page 38: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/38.jpg)
CrAyDSRUn: Basic Steps
step 1, validity checking.
step 2, find .
step 3, find .
38
![Page 39: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/39.jpg)
CrAyDSRUn: Basic Steps
step 1, validity checking.
step 2, find .
step 3, find .
step 4, place new character in proper positions.
39
![Page 40: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/40.jpg)
CrAyDSRUn: Step 1
scan/proceed one position at a time from left to right i.e., in an online fashion.
check validity at each position of input array according to “Basic Validation” section of a cover array.
40
![Page 41: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/41.jpg)
CrAyDSRUn: Step 1
as soon as it finds a violation of validity the algorithms returns the input array as invalid.
for further validation see Lemma 4 and Lemma 5 (Slide no. 45 and 46).
41
![Page 42: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/42.jpg)
CrAyDSRUn: Step 2
for each , our algorithm finds for each .
.
42
![Page 43: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/43.jpg)
CrAyDSRUn: Step 2
for each , our algorithm finds for each .
.
our algorithm finds with the help of Lemma 4 and Lemma 5.(see next slides)
43
![Page 44: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/44.jpg)
CrAyDSRUn: Step 2
Lemma 4.
Proof. proof will be provided in the journal version.
44
![Page 45: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/45.jpg)
CrAyDSRUn: Step 2
Lemma 5.
Proof. proof will be provided in the journal version.
45
![Page 46: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/46.jpg)
CrAyDSRUn: Step 2
we can see from Lemma 4 and Lemma 5 that we need to perform intersection operation. Finding intersection will take .
so for each position step 2 takes .
46
![Page 47: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/47.jpg)
CrAyDSRUn: Step 3
similar to step 2. find using Lemma 3.(see slide no.34) for that our algorithms finds a set of in a similar way of finding in previous step except that instead of there will be iterations for each .
47
![Page 48: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/48.jpg)
CrAyDSRUn: Step 3
similar to step 2. find using Lemma 3.(see slide no.34) for that our algorithms finds a set of in a similar way of finding in previous step except that instead of there will be iterations for each .
then . 48
![Page 49: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/49.jpg)
CrAyDSRUn: Step 3
49
so for each position step 3 takes .
![Page 50: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/50.jpg)
CrAyDSRUn: Step 4
if where then
50
![Page 51: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/51.jpg)
CrAyDSRUn: Step 4
if where then
if then new characters will be placed in proper positions.
51
![Page 52: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/52.jpg)
CrAyDSRUn: Running Time
for each position i, • Construction of
• Construction of
• Construction of
• Construction of
52
![Page 53: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/53.jpg)
CrAyDSRUn: Running Time
for each position i, • Construction of
• Construction of
• Construction of
• Construction of
so for positions, we need
53
![Page 54: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/54.jpg)
CrAyDSRin
Lemma 6. for every degenerate string if
is the only entry in , then and
Proof. proof will be provided in the journal version.
54
![Page 55: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/55.jpg)
CrAyDSRin
works exactly like except it computes slight differently.
55
![Page 56: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/56.jpg)
CrAyDSRin
works exactly like except it computes slight differently.
it computes following Lemmas 3.a and 6 (instead of Lemma 3.b).
56
![Page 57: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/57.jpg)
CrAyDSRin: Running Time
Runtime analysis follows readily from analysis of .
only extra calculation which can be done in .
57
![Page 58: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/58.jpg)
CrAyDSRin: Running Time
Runtime analysis follows readily from analysis of .
only extra calculation which can be done in .
therefore overall runtime complexity .
58
![Page 59: Dipankar Ranjan Baisya, Mir Md. Faysal & M. Sohel Rahman CSE, BUET Dhaka 1000 Degenerate String Reconstruction…](https://reader036.fdocuments.net/reader036/viewer/2022062601/5a4d1bfc7f8b9ab0599eca50/html5/thumbnails/59.jpg)
Thank you
59