Tag: a

PCA plots in R making plots with the wrong colors

Post author By Full Stack
Post date April 6, 2020
No Comments on PCA plots in R making plots with the wrong colors

I have two tables in my R environments, and I’ve been trying to create a pca plot with this data but the colors are being mismatched with the legend key and I’m not sure what’s going on. This is my reproducible code to create the pca plots: library(tidyverse) library(stringr) library(ggfortify) library(abind) library(dplyr) library(ggplot2) library(ggrepel) info […]

Tags `20200205_208431711020_RD82068_04.RCC` = c(178.24, `20200205_208432481020_RD82031_10.RCC` = c(188.25, `20200205_208433011020_RD82064_12.RCC` = c(167.59, `20200205_208433041020_RD82033_02.RCC` = c(190.54, `20200205_208433041020_RD82034_03.RCC` = c(167.66, `20200205_208433041020_RD82035_04.RCC` = c(168.05, `20200206_208431691020_RD82100_12.RCC` = c(173.23, `20200206_208432000000_RD82101_01.RCC` = c(197.14, `20200206_208432000000_RD82102_02.RCC` = c(192.7, `20200206_208432000000_RD82103_03.RCC` = c(215.52, `info`, -10L)) norm <- structure(list(Gene_Name = c("ABL1", -c(1)] tmp = t(tmp) # plot pca on counts above 10 autoplot(prcomp(tmp), .Label = c("1", 'PC2', "20200205_208431711020_RD82068_04.RCC", "20200205_208433011020_RD82064_12.RCC", "20200205_208433041020_RD82033_02.RCC", "20200205_208433041020_RD82034_03.RCC", "20200205_208433041020_RD82035_04.RCC", "20200206_208431691020_RD82100_12.RCC", "20200206_208432000000_RD82101_01.RCC", "20200206_208432000000_RD82102_02.RCC", "20200206_208432000000_RD82103_03.RCC")), "29.97"], "ACVR1B", "ACVR1C", "ACVR2A", "AKT1", "Run") Can anyone help me figure out why 20200206_208431691020_RD82100_12.RCC is pink when it should be blue and why 20200206_208432000000_R, "Sample_Name", {12: 26}, #'PC1', 1, 1.02, 1.26, 1.43, 1.87, 10.14, 13.04, 18.56, 18.6, 18.67, 19, 19.54, 1L, 2, 2.32, 22.41, 25 / 21, 26.35, 27.45, 27.61, 2L, 3, 3.17, 31.45, 32.33, 36.77, 37.9, 3L, 4.26, 44.77, 46.78, 462.65), 468.18), 479.27), 49.44, 501.39), 503.14), 504.59), 518.15), 550.18), 566.6)), 569.09), 5L, 8.88, a, and I've been trying to create a pca plot with this data but the colors are being mismatched with the legend key and I'm not sure what's goin, B, by="Sample_ID") tfull[, class = "data.frame", class = "data.frame") makePCA_withShapes <- function(dat, class = "factor"), colorcolumn, colour=colorcolumn, data=tfull, I have two tables in my R environments, label.repel=T) } makePCA_withShapes(norm, label=T, row.names = c(NA, Run = structure(c(1L, Sample_ID = c("20200205_208432481020_RD82031_10.RCC", shape=shapecolumn, shapecolumn){ #data is the raw data frame #info is the info table that has all of the sample mappings (info) #pc1 is the p, shapecolumn] = as.factor(tfull[, shapecolumn]) #assume the sample names are the first column tmp = dat tmp = tmp[, tmp, x=pc1, y=PC2

Mastering Development

regex separator that matches spaces, and the nul space before and after any non Alphanumeric character

Post author By Full Stack
Post date April 6, 2020
No Comments on regex separator that matches spaces, and the nul space before and after any non Alphanumeric character

For the life of me I can’t seem to figure out how to properly format my regex pattern. I’m trying to write a line of code that splits a string at these two locations: Every space in the string immediately before and after any non alphanumeric character for example if I have the string: “This, […]

Tags ', '!', '😊'] Thanks in advance, a, For the life of me I can't seem to figure out how to properly format my regex pattern. I'm trying to write a line of code that splits a strin, is, is a test!😊" the result would be: ['This', test

Mastering Development

c# string.GetHashCode. Unique number generation

Post author By Full Stack
Post date April 6, 2020
No Comments on c# string.GetHashCode. Unique number generation

I have below c# code which return public static void Main() { //var bytes = “7A5EC53415E34F288269EBB05B73AFD4”.ToByteArray(); for(int i=0;i<1000;i++){ var a=Guid.NewGuid().ToString(“N”).ToUpper() ; Console.WriteLine(“{0}-> {1}”,a, a.GetHashCode()); } } Which results C5D9DB1ACBFB43E2B0DC2812F22C3899-> -1816084758 42B7C0BF6C0341DB96DE5084BA403193-> 1197814565 B4062E3C129E478BA8E69552DDC700F2-> 1349563395 863C9FBF0369496E90A1B0246F855D6E-> -772372816 B42562EDB97346F48DE37ADE3FB6620E-> 2019192158 My Question here is, will the return values be a unique value so that I can use […]

Tags a, a.GetHashCode()); } } Which results C5D9DB1ACBFB43E2B0DC2812F22C3899-> -1816084758 42B7C0BF6C0341DB96DE5084BA403193->, I have below c# code which return public static void Main() { //var bytes = "7A5EC53415E34F288269EBB05B73AFD4".ToByteArray();, will the return values be a unique value so that I can use it for generating some random unique number? Sometime GetHashCode()return negative

Mastering Development

Array of strings from single line in a file

Post author By Full Stack
Post date April 5, 2020
No Comments on Array of strings from single line in a file

I would like to get an array of strings from a .txt file. I tried using fgets then strtok to separate the strings. I think my fgets is wrong but I dont understand how to get to what I want. char* str[numWords]; char line[]; char delim[] = ” “; int j; for(j = 0; j […]

Tags '.txt', "file"}; printf("%s", a, delim); } In other words, filep); str[j]= strtok(line, I have a .txt file This is a txt file and I want to be able to have it in the form char* str[] = {"This", I would like to get an array of strings from a .txt file. I tried using fgets then strtok to separate the strings. I think my fgets is wrong, is, numCharTotal, str[0]) //then "This" is printed //... //Till last word of txt file //... printf("%s", str[4]) //then "file" is printed

Mastering Development

Getting a warning in my 32-bit ALU using gate-level verilog code

Post author By Full Stack
Post date April 5, 2020
No Comments on Getting a warning in my 32-bit ALU using gate-level verilog code

Below is the code for 32 bit ALU with 3 different modules with their individual codes as well. I am just getting one warning which I am not sure how to solve it. The error is in the final stimulus/testbench but no changes can be made in that as that is pre-defined. I did understand […]

Tags -- Function_class=%d, --OUTPUT=%d \n", 'A'):10, 'B':[4, 'B'):13, 'C_0', 'd':8, 'T':[9, ">="&$A18, "$T$12", "a1":6, "A20", "b":14, "D11", "D12", "ns":0, "T20", ["bd", \d*((?!\1)){0, $m, $t0, a, A[1], a[13], a[14], a[15], a[17], a[24], a[26], a[28], a[29], a[4], a0, A11, A12), A19, A2, A21, A22, A23, A25, A27, A3, a3=0, a3=1), a4=0, a5, a6, a7, a8, a9, AD, B, b; input c; wire [30:0] d; wire [31:0] t; //instantiate and logic gates xor x0(t[0], B; reg C_0, b); and (c1, b); xor (ss, b[15], b[16], b[26], b[27], b[28], b[29], b[30], B=10, B=25%, b0, b1, B11, B12, B17, B18, B19, b2, B20, B21, B22, B23, B24, b3, B31, b5, B6, b7, b8, b9, Below is the code for 32 bit ALU with 3 different modules with their individual codes as well. I am just getting one warning which I am not s, C_IN=%b, c; wire s1, c(1, c); and (c2, c); logic_unit logic_output(out, c); or (cc, c); output cc; output [31:0] ss; input[31:0] a, c); output ss, c); xor x1(t[1], C=c, c1); endmodule //////////////////32-bit adder/subtractor///////////// module adder_sub (ss, c2, c2; //logic gates xor (s1, cc; input a, cc); fulladd as0(ss[0], cc); fulladd as1(ss[1], cc); fulladd as10(ss[10], cc); fulladd as11(ss[11], cc); fulladd as12(ss[12], cc); fulladd as13(ss[13], cc); fulladd as14(ss[14], cc); fulladd as15(ss[15], cc); fulladd as16(ss[16], cc); fulladd as17(ss[17], cc); fulladd as18(ss[18], cc); fulladd as19(ss[19], cc); fulladd as2(ss[2], cc); fulladd as20(ss[20], cc); fulladd as21(ss[21], cc); fulladd as22(ss[22], cc); fulladd as23(ss[23], cc); fulladd as24(ss[24], cc); fulladd as25(ss[25], cc); fulladd as26(ss[26], cc); fulladd as27(ss[27], cc); fulladd as28(ss[28], cc); fulladd as29(ss[29], cc); fulladd as3(ss[3], cc); fulladd as30(ss[30], cc); fulladd as31(ss[31], cc); fulladd as4(ss[4], cc); fulladd as5(ss[5], cc); fulladd as6(ss[6], cc); fulladd as7(ss[7], cc); fulladd as8(ss[8], cc); fulladd as9(ss[9], Const_amount, Const_amount); initial begin $monitor($time, Const_amount[4:0], Const_amount=%d, const_var, const_var[4:0], Const_Var=%b, d[0]); xor x2(t[2], d[1]); xor x3(t[3], d[10]); xor x12(t[12], d[11]); xor x13(t[13], d[12]); xor x14(t[14], d[13], d[13]); xor x15(t[15], d[14]); xor x16(t[16], d[15], d[15]); xor x17(t[17], d[16], d[16]); xor x18(t[18], d[17], d[17]); xor x19(t[19], d[18]); xor x20(t[20], d[19], d[19]); xor x21(t[21], d[2]); xor x4(t[4], d[20]); xor x22(t[22], d[21], d[21]); xor x23(t[23], d[22], d[22]); xor x24(t[24], d[23], d[23]); xor x25(t[25], d[24]); xor x26(t[26], d[25]); xor x27(t[27], d[26], d[26]); xor x28(t[28], d[27], d[27]); xor x29(t[29], d[28], d[28]); xor x30(t[30], d[29], d[29]); xor x31(t[31], d[3]); xor x5(t[5], d[30], d[30]); endmodule /////////////////////code for logic unit///////////////////////// module logic( output out, d[4]); xor x6(t[6], d[5]); xor x7(t[7], d[6]); xor x8(t[8], d[7]); xor x9(t[9], d[8]); xor x10(t[10], d[9]); xor x11(t[11], d=0, D=7, d1, D14, D18, d2, D20, D24, D25, d3, D4, d5, D6, D9, Function_class, input [1:0] Function_class, input [1:0] Logic_function, input [1:0] s ); logic logic_m1 [31:0] (out, input [1:0] s); wire ns0, input [31:0] a, input [31:0] p, input [31:0] y, input [4:0] Const_amount); wire [31:0] ss, input [4:0] x, input c_0, input Const_Var, input p, input shift_direction ); wire [4:0] amount, Logic_function, Logic_function=%d, n; assign m = Const_amount & const_var; assign n = x && const_var; assign amount = m || n; assign shifted_y = (shift_direc, ns1, ns1 ); and u_mux_inst_3 (w1, ns1; wire w0, out; wire [4:0] const_var; shifter shifter_output(shifted_y, P, Q, q); nor u_gate_inst_3(t4, q); not u_mux_inst_0 (ns0, q); or u_gate_inst_1(t2, q); xor u_gate_inst_2(t3, s); end initial begin A=4'd0; B=4'd0; C_0=1'b0; #5 A=8'd19; B=8'd55; Function_class[1]=1; Function_class[0]=0; #5, s); endmodule ////////////////code for ALU///////////////// module ALU_32bits(output [31:0] s, s[0] ); and u_mux_inst_4 (w2, s[0]); not u_mux_inst_1 (ns1, s[1:0]); endmodule ///////////////////////code for stimulus/////////////// module stimulus; //inputs reg[31:0] A, s[1] ); and u_mux_inst_5 (w3, s[1] ); or u_mux_inst_6 (out, s[1]); and u_mux_inst_2 (w0, S0, S1, shift_direction, shift_direction; reg [1:0] Function_class; reg [1:0] Logic_function; reg [4:0] Const_amount; //outputs wire[31:0] s;, shift_direction); adder_sub adder_sub_output(ss, shift_direction=%b, shifted_y, t[10], t[11], t[13], t[14], t[15], t[16], t[17], t[19], t[21], t[22], t[23], t[24], t[25], t[26], t[27], t[28], t[29], t[30], t[31], T*18", t=1, t2, T3, T4, t4; and u_gate_inst_0(t1, T5, T6, T7, t8, w0, w1, w2, w3; wire t1, w3); endmodule module logic_unit( output [31:0] out

Mastering Development

Why doesn’t my hash function work?

Post author By Full Stack
Post date April 5, 2020
No Comments on Why doesn’t my hash function work?

I’m a newbie in this field and am trying to learn a bit about how to write cryptographic hash functions. To get some hands-on, I tried updating the PySHA2 algorithm for Python 3.6 and up (the original version doesn’t work on Python 2.5+ and the author says he won’t fix this). I don’t intend to […]

Tags _buffer, _buffer: str, _counter, _counter << 3)) # make the initial hashes and round constants _initial_hashes = [0x6a09e667f3bcc908, _counter: int, _output_size, _output_size: int, 0x06ca6351e003826f, 0x06f067aa72176fba, 0x0a637dc5a2c898a6, 0x0fc19dc68b8cd5b5, 0x106aa07032bbd1b8, 0x113f9804bef90dae, 0x12835b0145706fbe, 0x142929670a0e6e70, 0x19a4c116b8d2d0c8, 0x1b710b35131c471b, 0x1e376c085141ab53, 0x1f83d9abfb41bd6b, 0x240ca1cc77ac9c65, 0x243185be4ee4b28c, 0x2748774cdf8eeb99, 0x27b70a8546d22ffc, 0x28db77f523047d84, 0x2de92c6f592b0275, 0x2e1b21385c26c926, 0x32caab7b40c72493, 0x34b0bcb5e19b48a8, 0x391c0cb3c5c95a63, 0x3956c25bf348b538, 0x3c6ef372fe94f82b, 0x3c9ebe0a15c9bebc, 0x431d67c49c100d4c, 0x4a7484aa6ea6e483, 0x4cc5d4becb3e42b6, 0x4d2c6dfc5ac42aed, 0x4ed8aa4ae3418acb, 0x510e527fade682d1, 0x53380d139d95b3df, 0x550c7dc3d5ffb4e2, 0x597f299cfc657e2a, 0x59f111f1b605d019, 0x5b9cca4f7763e373, 0x5be0cd19137e2179] _round_constants = [0x428a2f98d728ae22, 0x5cb0a9dcbd41fbd4, 0x5fcb6fab3ad6faec, 0x650a73548baf63de, 0x682e6ff3d6b2b8a3, 0x6c44198c4a475817] # set the thresholds if variable_x < 112: padding_len = 111 - variable_x else: padding_len =, 0x7137449123ef65cd, 0x72be5d74f27b896f, 0x748f82ee5defb2fc, 0x766a0abb3c77b2a8, 0x76f988da831153b5, 0x78a5636f43172f60, 0x80deb1fe3b1696b1, 0x81c2c92e47edaee6, 0x84c87814a1f0ab72, 0x8cc702081a6439ec, 0x90befffa23631e28, 0x923f82a4af194f9b, 0x92722c851482353b, 0x983e5152ee66dfab, 0x9b05688c2b3e6c1f, 0x9bdc06a725c71235, 0xa2bfe8a14cf10364, 0xa4506cebde82bde9, 0xa54ff53a5f1d36f1, 0xa81a664bbc423001, 0xa831c66d2db43210, 0xab1c5ed5da6d8118, 0xb00327c898fb213f, 0xb5c0fbcfec4d3b2f, 0xbb67ae8584caa73b, 0xbef9a3f7b2c67915, 0xbf597fc7beef0ee4, 0xc19bf174cf692694, 0xc24b8b70d0f89791, 0xc67178f2e372532b, 0xc6e00bf33da88fc2, 0xc76c51a30654be30, 0xca273eceea26619c, 0xd186b8c721c0c207, 0xd192e819d6ef5218, 0xd5a79147930aa725, 0xd69906245565a910, 0xd807aa98a3030242, 0xe49b69c19ef14ad2, 0xe9b5dba58189dbbc, 0xeada7dd6cde0eb1e, 0xefbe4786384f25e3, 0xf40e35855771202a, 0xf57d4f7fee6ed178, 1) ^ _rit_rot(words[i-15], 14) ^ _rit_rot(e, 18) ^ _rit_rot(e, 19) ^ _rit_rot(words[i-2], 28) ^ _rit_rot(a, 34) ^ _rit_rot(a, 39) var_2 = _rit_rot(e, 41) var_3 = (a & b) ^ (a & c) ^ (b & c) var_4 = (e & f) ^ ((~e) & g) temp_1 = var_1 + var_3, 61) ^ (words[i-2] >> 6) words[i] = (words[i-16] + part_1 + words[i-7] + part_2) & 0xFFFFFFFFFFFFFFFF # create the wo, 8) ^ (words[i-15] >> 7) part_2 = _rit_rot(words[i-2], 80): part_1 = _rit_rot(words[i-15], a, B, base=16) for stuff in return_val] return return_val return ''.join(return_val) def sha_512(text_to_hash: str, by: int) -> int: """ helper function for right rotation as it isn't done by a simple bitwise operation (xor is '^') :, c--, check if the input is correct if not text_to_hash: return "" if type(text_to_hash) is not str: raise TypeError("Inval, chunk) # extend these 16 words into the remaining 64 words of 'message schedule array' for i in range(16, create a place to store the 80 words that we'll make words = [0]*80 # first 16 words will be saved without any changes, d, e, f: '' }, g, h = _initial_hashes # start the compression function for z in range(80): var_1 = _rit_rot(a, h])] # update buffer _buffer = _buffer[128:] # return the hash value return_val = [hex(stuff) for stuff in _initial, hex_digest: bool = False) -> str: """ frontend function for SHA512 hashing :return: hashed string """ # before anything, hex_output: bool = False): """ backend function that hashes given string :param text_to_hash: message to be hashed (str) :par, hex_output=hex_digest) message = "This is a string to be hashed" from hashlib import sha3_512 print("hashlib gives: ", I don't understand a lot of things in this algorithm and have literally copied many parts from the original code (also, I know it isn't good practice to write everything in a single function but I find it easier when trying to understand something). But the big, I tried updating the PySHA2 algorithm for Python 3.6 and up (the original version doesn't work on Python 2.5+ and the author says he won't fi, I'm a newbie in this field and am trying to learn a bit about how to write cryptographic hash functions. To get some hands-on, it gives the same output 0x6a09e667f3bcc9080xbb67ae8584caa73b0x3c6ef372fe94f82b0xa54ff53a5f1d36f10x510e527fade682d10x9b05688c2b3e6c1f0x1f83d9, just coding this for the sake of knowledge. I've reached this far: def _sha_backend(text_to_hash: str, sha_512(message)) As is obvious, sha3_512(message.encode()).hexdigest()) print("I give: ", y in zip(_initial_hashes

Artificial Intelligence (AI) Mastering Development

Efficient algorithm to obtain near optimal policies for an MDP

Post author By Jessica Alba
Post date April 5, 2020
No Comments on Efficient algorithm to obtain near optimal policies for an MDP

Given a discrete, finite Markov Decision Process (MDP) with its usual parameters $(S, A, T, R, \gamma)$, it is possible to obtain the optimal policy $\pi^{*}$ and the optimal value function $V^{*}$ through one of many planning methods (policy iteration, value iteration or solving a linear program). I am interested in obtaining a random near-optimal […]

Tags "\t", \quad \epsilon > 0$$ and if $\pi$ is the policy that is greedy with respect to the value function $V$, a, finite Markov Decision Process (MDP) with its usual parameters $(S, gamma, Given a discrete, hence the requirement for a lower bound. Any inputs regarding an efficient solution or reasons for the lack thereof are welcome., I would also like that the policy $\pi$ not be "too good", if $$||V - V^{*}||_{\infty} < \epsilon, it is possible to obtain the optimal policy $\pi^{*}$ and the optimal value function $V^{*}$ through one of many planning methods (policy ite, r, such that $$ \epsilon_1 < ||V^{*} - V^{\pi}||_{\infty} < \epsilon_2$$ I wish to know an efficient way of achieving this goal. A possible app, that is, the idea that near optimal value functions induce near optimal policies could be used, then $$ ||V^{\pi} - V^{*}||_{\infty} < \frac{2\gamma\epsilon}{1 - \gamma}$$ So by picking a suitable $\epsilon$ for the given $\gamma$, value iteration or solving a linear program). I am interested in obtaining a random near-optimal policy $\pi$, we can be sure of any upper bound $\epsilon_2$. However, we can show that, with the value function associated with the policy given by $V^{\pi}$

Mastering Development

How to count the number of ordered sequence in a vector in R

Post author By Full Stack
Post date April 5, 2020
No Comments on How to count the number of ordered sequence in a vector in R

I have the following data set as an example. Data<-c(“a”,”d”,”c”,”b”,”d”,”a”,”d”,”b”,”c”,”b”,”a”,”b”,”d”,”c”,”b”,”a”,”c”,”d”,”d”,”c”) I need to find out how many times a < b < c < d, all possible combinations. I have created a loop (using 4 IF functions) but it takes long time when we have large data set. With this loop the answer is 47 […]

Tags "2b", "2d", "c") I need to find out how many times a < b < c < d, "c") set.seed(123) Data0<-sort(sample(1:100, 2] myfun<-function(A, 2=c, 20)) df<-data.frame(Data, a, all possible combinations. I have created a loop (using 4 IF functions) but it takes long time when we have large data set. With this loop t, B, but it is very slow when say we have more than 4 letters and large data set. Data<-c("a", c--, d, D) Many Thanks, Data0) A<-df[Data=="a", db=0, I have the following data set as an example. Data<-c("a"

Mastering Development

JavaScript Array Operations in the MS Script Control

Post author By Full Stack
Post date April 5, 2020
No Comments on JavaScript Array Operations in the MS Script Control

This is a JavaScript question, but… my objective is to use the Microsoft Script Control in Excel VBA to carry out array operations. The script control uses MS JScript, roughly equal to ES3, but having no window object. When I say array operations, I mean… if [a] is an array of 100 numbers and [b] […]

Tags -=, *=, / { sub(/, a, and /=. The rest of the code in those four functions is 100% repetitive. Question #1: How can I write the JScript more generically so that t, and div() functions are the corresponding operators: +=, B, b) End Function Sub Test() Dim a, b) Static sc As Object If sc Is Nothing Then Set sc = CreateObject("ScriptControl") With sc .Language =, b=jsArray(w), but having no window object. When I say array operations, but... my objective is to use the Microsoft Script Control in Excel VBA to carry out array operations. The script control uses MS JScript, c a = [a1:a999].Value2 b = [b1:b999].Value2 c = ArrayOp("div", currently [a] and [b]? I would preferably like to have the JScript op functions accept a dynamic number of arrays, e=0;e<t.length;e++)r.add(e, element by element. The code I have written below works just fine. But... I want to add a lot more ops and I am frustrated that each JScrip, for example for an AVERAGE operation on the input arrays. My VB skills are high. My JavaScript skills are not. Please remember that the Java, I mean... if [a] is an array of 100 numbers and [b] is an array of another 100 numbers, MUL, roughly equal to ES3, t[e]);return r.items()}" .AddCode "function sum(v, t=0;t<a.length;t++)a[t]-=b[t];return vbArray(a);};" .AddCode "function mul(v, t=0;t<a.length;t++)a[t]*=b[t];return vbArray(a);};" .AddCode "function div(v, t=0;t<a.length;t++)a[t]/=b[t];return vbArray(a);};" End With End If ArrayOp = sc.Run(op, t=0;t<a.length;t++)a[t]+=b[t];return vbArray(a);};" .AddCode "function sub(v, This is a JavaScript question, w){for(var a=jsArray(v), what I am looking for is for the JScript to return a new array [c] of 100 numbers with each element equal to the specified operation on [a] a

Mastering Development

Using array instead of set

Post author By Full Stack
Post date April 5, 2020
No Comments on Using array instead of set

This is a function for finding all Longest common sequence for X and Y sequence. But this program is in c++ but I want to write it in C. Is there any way to use array instead of the set? For eg. if input is X = < A, A, T, C, C, > Y […]

Tags "\t", > m and n are size of sequence X and Y respectively. /* source : https://www.geeksforgeeks.org/printing-longest-common-subsequence-set-2-pr, > then the output should be < A, $m, a, c--, g, int m, int n) { // construct a set to store possible LCS set s; // If we reaches end of either string, m + 1, n - 1); // append current character to all possible LCS // of substring X[0..m-2] and Y[0..n-2]. for (string str, n - 1); // merge two sets if L[m-1][n] == L[m][n-1] // Note s will be empty if L[m-1][n] != L[m][n-1], n); // If LCS can be constructed from left side of // the matrix, recurse for X[0..m-1] and Y[0..n-2] if (L[m][n - 1] >= L[m - 1][n]) { set tmp = findLCS(X, recurse for X[0..m-2] and Y[0..n-1] if (L[m - 1][n] >= L[m][n - 1]) s = findLCS(X, return // a empty set if (m == 0 || n == 0) { s.insert(""); return s; } // If the last characters, string y, This is a function for finding all Longest common sequence for X and Y sequence. But this program is in c++ but I want to write it in C. Is, tmp.end()); } } return s; }, y, y = a), Y[0..n-1] */ set findLCS(string X