potentiate dna

Test instructionsEnter a sequence of M-length n DNA, and sort the output from small to large in reverse order.PS: "Stable ordering" is that when a1==a2 occurs in a sequence, the relative position of A1 and A2 is not changed before and after sorting.Idea: Naked merge sort did not know can refer to the next http://blog.csdn.net/morewindows/article/details/6678165/but his code is wrong! Then I wrote one according to my understanding and measured it right

SCU-4501 Given a number of DNA sequences, the shortest containing the length of all sequencesContains not necessarily a continuous inclusion, it can not be a substring Pressure DPConstruct each bit in turnMark the position of each string and press it into 6 binary numbers.Then each state expands a stringAnd then expand all the other next one with the same stringThen drop the state into the queue and transfer it, and output the answer whe

How do I add a custom function to Excel by using Excel DNA?1. Create a new class file on the Class Library project, let's call him MyUdf.cs.2. Add a static method to this class, as follows: NOTE: it must be a static method. Public classmyudf {[Excelfunction (Name="Say", Description ="My first. NET function", Category ="This is a category grouping")] Public Static stringSayHello ([excelargument (Name ="name", Description ="Incoming name")]s

Topic Link: DNA SequenceAnalysis: AC automata + matrix acceleration (fast power).The idea of a state transfer diagram for an AC automaton at this time is very thorough, and the AC automata is the ability to determine the transfer of the state.AC Code:#include Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced. POJ 2778 DNA Sequence (ac automata + Matr

The main idea : give you n a the string of DNA, that is, to contain ' A ', ' T ', ' G ', ' C ' four bases, these given strings are inherited disease, and then give you a string of not more than 1000, ask you at least a few places to let this string does not contain hereditary disease, if no matter how modification is useless, output '-1 ' Analysis: Using Dp[ni][nnode], indicating the length of the time I reached the nth node modification of the minimu

https://oj.leetcode.com/problems/repeated-dna-sequences/publiclist[leetcode]187 repeated DNA sequences

DNA sorting Time limit:1000 ms Memory limit:10000 K Total submissions:73451 Accepted:29334 DescriptionOne measure of ''unsortedness ''in a sequence is the number of pairs of entries that are out of order with respect to each other. for instance, in the letter sequence '''daabec'', this measure is 5, since D is greater than four letters to its right and E is Greater than one letter to its right. this measure is cal

DNA sorting Time limit:1000 ms Memory limit:10000 K Total submissions:60701 Accepted:23971 DescriptionOne measure of ''unsortedness ''in a sequence is the number of pairs of entries that are out of order with respect to each other. for instance, in the letter sequence '''daabec'', this measure is 5, since D is greater than four letters to its right and E is Greater than one letter to its right. this measure is cal

Click to open the chain Hangzhou electric 1379problem DescriptionOne measure of ' unsortedness ' in a sequence is the number of the pairs of entries, which is out of order with respect to each Other. For instance, with the letter sequence "Daabec", this measure is 5, since D was greater than four letters E is greater than one letter to it right. This measure was called the number of inversions in the sequence. The sequence ' AACEDGG ' have only one inversion (E and D)--it are nearly sorted--whil

Given m dna sequences with N lengths, find a DNA sequence so that the total Hamming distance to all sequences is as small as possible. The Hamming distance between two equal-length strings is equal to the number of different characters. Returns the minimum Lexicographic Order. Idea: We can enumerate the letters at each position in sequence. To minimize the total Hamming, we need to take the same number of

Question address: http://poj.org/problem? Id = 1007 DNA sorting Time limit:1000 ms Memory limit:10000 K Total submissions:63582 Accepted:25103 DescriptionOne measure of ''unsortedness ''in a sequence is the number of pairs of entries that are out of order with respect to each other. for instance, in the letter sequence '''daabec'', this measure is 5, since D is greater than four Letters to its right and E is great

Links: http://poj.org/problem?id=2778Test instructions: Given no more than 10 strings, each string of not more than 10 of the disaster gene; Q. How many genes do not contain a catastrophic gene in the length of a given length of not more than 2e9?DNA: Contains only ' A ', ' T ', ' C ', ' G ' four characters;Idea: This is not very nude AC automata. There is no obvious text string matching process, but we can pass the trie of the disaster gene, we need