back soft

امروزدخترم رابردم دندانپزشکی .یکی ازهمکاران قدیمی به اسم خانم شریفی رادیدم خوشحال شدم ،راستش برای من فرقی نمی کنه که خاطره خوب ازهمکارام داشته باشم یانه وقتی بعدازمدتهااونهارامی بینم خوشحال میشم،بعدرف...

Vote count: 0 I need to find a text sequence that is writting into a text file, into many xml files. The variable that contains every xml to process, cames from a bash script, and its : ${filearray[$i]} I need to print the names of this xml files that does NOT contain the text sequence. asked 34 secs agouser2961008 Let's block ads! بخوانید...

Vote count: 0 I need to construct an algorithm (not necessarily effective) that given a string finds and prints two identical subsequences (by print I mean color for example). What more, sum of the sets of indexes of these two subsequences has to be a set of consecutive natural numbers. In mathematics, the thing what I am looking for is called "tight twins", if it helps anything. Let me give a few examples: 1) consider string 231213231 It has two subsequences I am looking for in the form of "123". To see it better look at this image: The first subsequence is marked with underlines and the second with overlines. As you can see they have all the properties I need. 2) consider string 12341234 3...

Vote count: 0 I am trying to find palindromic sequences within DNA by using recursion. I am doing this because it is impossible to know the exact length of a palindromic sequence within DNA. I have worked through the problem in my head and on paper, but the code below still does not come up with the answer I want it to. I am new to pyparsing and using CFGs. Therefore, I might be wrong with the way I set the code up. Any help would be welcome. stem = Forward() atRule = Word("A") + ZeroOrMore(stem) + Word("T") taRule = Word("T") + ZeroOrMore(stem) + Word("A") gcRule = Word("G") + ZeroOrMore(stem) + Word("C") cgRule = Word("C") + ZeroOrMore(stem) + Word("G") stem...